./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/MultCommutative-2.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/recursive/MultCommutative-2.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 ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:55:24,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:55:24,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:55:24,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:55:24,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:55:24,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:55:24,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:55:24,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:55:24,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:55:24,578 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:55:24,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:55:24,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:55:24,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:55:24,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:55:24,579 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:55:24,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:55:24,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:55:24,579 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:55:24,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:55:24,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:55:24,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:55:24,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:55:24,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:55:24,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:55:24,580 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:55:24,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:55:24,580 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:55:24,580 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:55:24,580 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:55:24,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:55:24,581 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:55:24,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:55:24,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:55:24,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:55:24,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:55:24,581 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:55:24,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:55:24,581 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:55:24,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:55:24,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:55:24,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:55:24,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:55:24,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:55:24,582 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 -> ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd [2025-02-05 15:55:24,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:55:24,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:55:24,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:55:24,768 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:55:24,768 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:55:24,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/MultCommutative-2.c [2025-02-05 15:55:25,886 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5335294f2/9c5e870e3eed4ae8a952cc1876f51935/FLAGa0214e90a [2025-02-05 15:55:26,144 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:55:26,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/MultCommutative-2.c [2025-02-05 15:55:26,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5335294f2/9c5e870e3eed4ae8a952cc1876f51935/FLAGa0214e90a [2025-02-05 15:55:26,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5335294f2/9c5e870e3eed4ae8a952cc1876f51935 [2025-02-05 15:55:26,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:55:26,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:55:26,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:55:26,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:55:26,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:55:26,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:55:26" (1/1) ... [2025-02-05 15:55:26,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7382e96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:26, skipping insertion in model container [2025-02-05 15:55:26,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:55:26" (1/1) ... [2025-02-05 15:55:26,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:55:26,690 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/recursive/MultCommutative-2.c[970,983] [2025-02-05 15:55:26,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:55:26,710 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:55:26,718 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/recursive/MultCommutative-2.c[970,983] [2025-02-05 15:55:26,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:55:26,727 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:55:26,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:26 WrapperNode [2025-02-05 15:55:26,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:55:26,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:55:26,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:55:26,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:55:26,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:26" (1/1) ... [2025-02-05 15:55:26,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:26" (1/1) ... [2025-02-05 15:55:26,743 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-02-05 15:55:26,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:55:26,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:55:26,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:55:26,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:55:26,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:26" (1/1) ... [2025-02-05 15:55:26,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:26" (1/1) ... [2025-02-05 15:55:26,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:26" (1/1) ... [2025-02-05 15:55:26,755 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 15:55:26,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:26" (1/1) ... [2025-02-05 15:55:26,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:26" (1/1) ... [2025-02-05 15:55:26,756 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:26" (1/1) ... [2025-02-05 15:55:26,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:26" (1/1) ... [2025-02-05 15:55:26,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:26" (1/1) ... [2025-02-05 15:55:26,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:26" (1/1) ... [2025-02-05 15:55:26,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:55:26,759 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:55:26,759 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:55:26,759 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:55:26,759 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:26" (1/1) ... [2025-02-05 15:55:26,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:55:26,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:26,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:55:26,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:55:26,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:55:26,810 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2025-02-05 15:55:26,810 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2025-02-05 15:55:26,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:55:26,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:55:26,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:55:26,845 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:55:26,846 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:55:26,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret5; [2025-02-05 15:55:26,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19: havoc #t~ret4; [2025-02-05 15:55:26,924 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 15:55:26,924 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:55:26,930 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:55:26,930 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:55:26,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:55:26 BoogieIcfgContainer [2025-02-05 15:55:26,930 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:55:26,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:55:26,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:55:26,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:55:26,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:55:26" (1/3) ... [2025-02-05 15:55:26,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231c996a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:55:26, skipping insertion in model container [2025-02-05 15:55:26,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:26" (2/3) ... [2025-02-05 15:55:26,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231c996a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:55:26, skipping insertion in model container [2025-02-05 15:55:26,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:55:26" (3/3) ... [2025-02-05 15:55:26,937 INFO L128 eAbstractionObserver]: Analyzing ICFG MultCommutative-2.c [2025-02-05 15:55:26,946 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:55:26,947 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG MultCommutative-2.c that has 2 procedures, 23 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 15:55:26,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:55:26,983 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;@3aaffbe3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:55:26,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:55:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:55:26,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 15:55:26,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:26,989 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:26,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:26,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:26,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1335180330, now seen corresponding path program 1 times [2025-02-05 15:55:26,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:26,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120744690] [2025-02-05 15:55:26,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:26,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:27,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 15:55:27,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 15:55:27,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:27,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 15:55:27,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:27,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120744690] [2025-02-05 15:55:27,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120744690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:27,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:27,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:55:27,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892564223] [2025-02-05 15:55:27,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:27,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:55:27,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:27,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:55:27,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:55:27,257 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:55:27,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:27,321 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2025-02-05 15:55:27,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:55:27,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-02-05 15:55:27,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:27,326 INFO L225 Difference]: With dead ends: 36 [2025-02-05 15:55:27,326 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 15:55:27,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:55:27,330 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:27,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 138 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 15:55:27,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-02-05 15:55:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-05 15:55:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2025-02-05 15:55:27,352 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 20 [2025-02-05 15:55:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:27,353 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-02-05 15:55:27,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:55:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2025-02-05 15:55:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 15:55:27,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:27,354 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:27,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:55:27,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:27,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:27,355 INFO L85 PathProgramCache]: Analyzing trace with hash 241588428, now seen corresponding path program 1 times [2025-02-05 15:55:27,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:27,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403130167] [2025-02-05 15:55:27,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:27,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:27,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 15:55:27,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 15:55:27,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:27,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 15:55:27,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:27,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403130167] [2025-02-05 15:55:27,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403130167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:27,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:27,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:55:27,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413030120] [2025-02-05 15:55:27,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:27,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:55:27,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:27,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:55:27,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:55:27,472 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:55:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:27,531 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2025-02-05 15:55:27,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:55:27,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-02-05 15:55:27,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:27,532 INFO L225 Difference]: With dead ends: 35 [2025-02-05 15:55:27,533 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 15:55:27,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:55:27,533 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:27,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 15:55:27,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2025-02-05 15:55:27,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-05 15:55:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-02-05 15:55:27,539 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 26 [2025-02-05 15:55:27,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:27,539 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-02-05 15:55:27,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:55:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2025-02-05 15:55:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 15:55:27,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:27,540 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:27,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:55:27,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:27,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:27,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1384005172, now seen corresponding path program 1 times [2025-02-05 15:55:27,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:27,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72226352] [2025-02-05 15:55:27,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:27,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:27,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 15:55:27,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 15:55:27,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:27,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 15:55:27,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:27,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72226352] [2025-02-05 15:55:27,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72226352] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:27,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993425652] [2025-02-05 15:55:27,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:27,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:27,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:27,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:27,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:55:27,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 15:55:27,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 15:55:27,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:27,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:27,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:55:27,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:27,701 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 15:55:27,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 15:55:27,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993425652] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:27,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:27,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-02-05 15:55:27,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446556986] [2025-02-05 15:55:27,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:27,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:55:27,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:27,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:55:27,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:55:27,760 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:55:27,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:27,816 INFO L93 Difference]: Finished difference Result 35 states and 53 transitions. [2025-02-05 15:55:27,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:55:27,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-02-05 15:55:27,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:27,817 INFO L225 Difference]: With dead ends: 35 [2025-02-05 15:55:27,817 INFO L226 Difference]: Without dead ends: 27 [2025-02-05 15:55:27,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:55:27,817 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:27,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:27,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-05 15:55:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2025-02-05 15:55:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 15:55:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-02-05 15:55:27,821 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 27 [2025-02-05 15:55:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:27,822 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-02-05 15:55:27,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:55:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-02-05 15:55:27,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 15:55:27,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:27,823 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:27,829 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 15:55:28,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:28,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:28,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:28,025 INFO L85 PathProgramCache]: Analyzing trace with hash -741173588, now seen corresponding path program 2 times [2025-02-05 15:55:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:28,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337649402] [2025-02-05 15:55:28,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:55:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:28,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-05 15:55:28,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 15:55:28,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:55:28,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 15:55:28,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:28,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337649402] [2025-02-05 15:55:28,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337649402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:28,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:28,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:55:28,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838021412] [2025-02-05 15:55:28,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:28,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:55:28,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:28,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:55:28,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:55:28,130 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 15:55:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:28,165 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2025-02-05 15:55:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:55:28,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-02-05 15:55:28,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:28,166 INFO L225 Difference]: With dead ends: 29 [2025-02-05 15:55:28,167 INFO L226 Difference]: Without dead ends: 25 [2025-02-05 15:55:28,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:55:28,168 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:28,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 38 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:28,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-05 15:55:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-05 15:55:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 15:55:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2025-02-05 15:55:28,174 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 27 [2025-02-05 15:55:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:28,174 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-02-05 15:55:28,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 15:55:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2025-02-05 15:55:28,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 15:55:28,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:28,175 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:28,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:55:28,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:28,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:28,176 INFO L85 PathProgramCache]: Analyzing trace with hash -950755594, now seen corresponding path program 1 times [2025-02-05 15:55:28,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:28,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926372335] [2025-02-05 15:55:28,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:28,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:28,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 15:55:28,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 15:55:28,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:28,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 15:55:28,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:28,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926372335] [2025-02-05 15:55:28,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926372335] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:28,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638748323] [2025-02-05 15:55:28,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:28,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:28,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:28,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:28,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:55:28,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 15:55:28,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 15:55:28,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:28,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:28,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:55:28,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-05 15:55:28,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-05 15:55:28,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638748323] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:28,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:28,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-02-05 15:55:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297459240] [2025-02-05 15:55:28,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:28,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:55:28,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:28,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:55:28,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:55:28,420 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 15:55:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:28,518 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2025-02-05 15:55:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:55:28,518 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 46 [2025-02-05 15:55:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:28,519 INFO L225 Difference]: With dead ends: 47 [2025-02-05 15:55:28,519 INFO L226 Difference]: Without dead ends: 39 [2025-02-05 15:55:28,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:55:28,520 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:28,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 118 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:55:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-05 15:55:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2025-02-05 15:55:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 24 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (16), 7 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-05 15:55:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2025-02-05 15:55:28,526 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 46 [2025-02-05 15:55:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:28,526 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2025-02-05 15:55:28,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 15:55:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2025-02-05 15:55:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 15:55:28,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:28,527 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:28,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:28,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:28,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:28,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:28,729 INFO L85 PathProgramCache]: Analyzing trace with hash -985320906, now seen corresponding path program 3 times [2025-02-05 15:55:28,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:28,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941243838] [2025-02-05 15:55:28,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:55:28,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:28,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-02-05 15:55:28,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 15:55:28,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 15:55:28,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 15:55:29,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:29,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941243838] [2025-02-05 15:55:29,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941243838] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:29,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928220177] [2025-02-05 15:55:29,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:55:29,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:29,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:29,056 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:29,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:55:29,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-02-05 15:55:29,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 15:55:29,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 15:55:29,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:29,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-05 15:55:29,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 15:55:29,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 15:55:30,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928220177] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:30,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:30,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 35 [2025-02-05 15:55:30,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165268924] [2025-02-05 15:55:30,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:30,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 15:55:30,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:30,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 15:55:30,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1057, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 15:55:30,154 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 35 states, 32 states have (on average 1.65625) internal successors, (53), 25 states have internal predecessors, (53), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2025-02-05 15:55:30,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:30,590 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2025-02-05 15:55:30,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 15:55:30,590 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 1.65625) internal successors, (53), 25 states have internal predecessors, (53), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) Word has length 34 [2025-02-05 15:55:30,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:30,591 INFO L225 Difference]: With dead ends: 47 [2025-02-05 15:55:30,593 INFO L226 Difference]: Without dead ends: 43 [2025-02-05 15:55:30,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=256, Invalid=1636, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 15:55:30,595 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:30,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 194 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:55:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-05 15:55:30,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2025-02-05 15:55:30,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 27 states have internal predecessors, (27), 5 states have call successors, (5), 1 states have call predecessors, (5), 7 states have return successors, (21), 9 states have call predecessors, (21), 5 states have call successors, (21) [2025-02-05 15:55:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2025-02-05 15:55:30,605 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 34 [2025-02-05 15:55:30,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:30,605 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2025-02-05 15:55:30,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 1.65625) internal successors, (53), 25 states have internal predecessors, (53), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2025-02-05 15:55:30,605 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2025-02-05 15:55:30,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 15:55:30,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:30,606 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:30,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:30,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:30,810 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:30,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:30,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1494101284, now seen corresponding path program 4 times [2025-02-05 15:55:30,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:30,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579343589] [2025-02-05 15:55:30,811 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:55:30,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:30,816 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-02-05 15:55:30,835 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 15:55:30,835 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:55:30,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 15:55:31,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:31,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579343589] [2025-02-05 15:55:31,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579343589] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:31,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982444501] [2025-02-05 15:55:31,415 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:55:31,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:31,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:31,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:31,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:55:31,439 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-02-05 15:55:31,452 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 15:55:31,452 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:55:31,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:31,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-02-05 15:55:31,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:55:31,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 11 proven. 31 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 15:55:32,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982444501] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:32,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:32,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 18] total 38 [2025-02-05 15:55:32,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538624236] [2025-02-05 15:55:32,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:32,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-05 15:55:32,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:32,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-05 15:55:32,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 15:55:32,130 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 38 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 27 states have internal predecessors, (53), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (13), 11 states have call predecessors, (13), 8 states have call successors, (13) [2025-02-05 15:55:32,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:32,861 INFO L93 Difference]: Finished difference Result 77 states and 126 transitions. [2025-02-05 15:55:32,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-05 15:55:32,861 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 27 states have internal predecessors, (53), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (13), 11 states have call predecessors, (13), 8 states have call successors, (13) Word has length 41 [2025-02-05 15:55:32,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:32,863 INFO L225 Difference]: With dead ends: 77 [2025-02-05 15:55:32,863 INFO L226 Difference]: Without dead ends: 60 [2025-02-05 15:55:32,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=411, Invalid=2895, Unknown=0, NotChecked=0, Total=3306 [2025-02-05 15:55:32,865 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:32,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 209 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:55:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-05 15:55:32,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2025-02-05 15:55:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 35 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (34), 12 states have call predecessors, (34), 7 states have call successors, (34) [2025-02-05 15:55:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 77 transitions. [2025-02-05 15:55:32,884 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 77 transitions. Word has length 41 [2025-02-05 15:55:32,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:32,884 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 77 transitions. [2025-02-05 15:55:32,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 27 states have internal predecessors, (53), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (13), 11 states have call predecessors, (13), 8 states have call successors, (13) [2025-02-05 15:55:32,884 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 77 transitions. [2025-02-05 15:55:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 15:55:32,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:32,886 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:32,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:33,086 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,SelfDestructingSolverStorable6 [2025-02-05 15:55:33,087 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:33,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:33,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2063596178, now seen corresponding path program 2 times [2025-02-05 15:55:33,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:33,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260090375] [2025-02-05 15:55:33,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:55:33,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:33,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-05 15:55:33,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 15:55:33,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:55:33,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 7 proven. 40 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 15:55:33,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:33,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260090375] [2025-02-05 15:55:33,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260090375] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:33,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483218784] [2025-02-05 15:55:33,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:55:33,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:33,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:33,161 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:33,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:55:33,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-05 15:55:33,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 15:55:33,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:55:33,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:33,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:55:33,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:33,233 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-02-05 15:55:33,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:55:33,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483218784] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:33,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:33,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2025-02-05 15:55:33,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111808942] [2025-02-05 15:55:33,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:33,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:55:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:33,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:55:33,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:55:33,357 INFO L87 Difference]: Start difference. First operand 50 states and 77 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 7 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-05 15:55:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:33,427 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2025-02-05 15:55:33,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:55:33,427 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 7 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2025-02-05 15:55:33,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:33,428 INFO L225 Difference]: With dead ends: 79 [2025-02-05 15:55:33,428 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 15:55:33,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:55:33,429 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:33,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 86 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 15:55:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-05 15:55:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:55:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-02-05 15:55:33,432 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 61 [2025-02-05 15:55:33,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:33,432 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-02-05 15:55:33,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 7 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-05 15:55:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-02-05 15:55:33,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 15:55:33,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:33,433 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:33,439 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 15:55:33,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:33,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:33,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:33,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1655028292, now seen corresponding path program 5 times [2025-02-05 15:55:33,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:33,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702634327] [2025-02-05 15:55:33,635 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:55:33,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:33,639 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 5 equivalence classes. [2025-02-05 15:55:33,646 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 15:55:33,646 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-05 15:55:33,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 15:55:34,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:34,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702634327] [2025-02-05 15:55:34,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702634327] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:34,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344709321] [2025-02-05 15:55:34,019 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:55:34,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:34,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:34,021 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:34,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:55:34,044 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 5 equivalence classes. [2025-02-05 15:55:34,057 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 15:55:34,057 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-05 15:55:34,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:34,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-02-05 15:55:34,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:55:34,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:55:34,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344709321] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:34,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:34,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 15] total 39 [2025-02-05 15:55:34,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609075522] [2025-02-05 15:55:34,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:34,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-05 15:55:34,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:34,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-05 15:55:34,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1347, Unknown=0, NotChecked=0, Total=1482 [2025-02-05 15:55:34,708 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 39 states, 35 states have (on average 1.542857142857143) internal successors, (54), 27 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (13), 12 states have call predecessors, (13), 8 states have call successors, (13) [2025-02-05 15:55:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:35,245 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2025-02-05 15:55:35,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-05 15:55:35,246 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 1.542857142857143) internal successors, (54), 27 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (13), 12 states have call predecessors, (13), 8 states have call successors, (13) Word has length 41 [2025-02-05 15:55:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:35,247 INFO L225 Difference]: With dead ends: 43 [2025-02-05 15:55:35,247 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 15:55:35,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=387, Invalid=2805, Unknown=0, NotChecked=0, Total=3192 [2025-02-05 15:55:35,248 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:35,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 191 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:55:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 15:55:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-02-05 15:55:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 15:55:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-02-05 15:55:35,252 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 41 [2025-02-05 15:55:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:35,252 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-02-05 15:55:35,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 1.542857142857143) internal successors, (54), 27 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (13), 12 states have call predecessors, (13), 8 states have call successors, (13) [2025-02-05 15:55:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-02-05 15:55:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 15:55:35,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:35,253 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:35,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:35,453 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,SelfDestructingSolverStorable8 [2025-02-05 15:55:35,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:35,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:35,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1467085126, now seen corresponding path program 6 times [2025-02-05 15:55:35,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:35,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000207192] [2025-02-05 15:55:35,455 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:55:35,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:35,459 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 62 statements into 9 equivalence classes. [2025-02-05 15:55:35,473 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 15:55:35,474 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-02-05 15:55:35,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 9 proven. 125 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:55:36,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:36,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000207192] [2025-02-05 15:55:36,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000207192] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:36,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073407749] [2025-02-05 15:55:36,191 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:55:36,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:36,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:36,195 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:36,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:55:36,227 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 62 statements into 9 equivalence classes. [2025-02-05 15:55:36,246 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 15:55:36,246 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-02-05 15:55:36,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:36,248 WARN L254 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-02-05 15:55:36,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:36,584 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 3 proven. 81 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-05 15:55:36,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 14 proven. 112 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 15:55:37,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073407749] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:37,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:37,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16, 21] total 47 [2025-02-05 15:55:37,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017962505] [2025-02-05 15:55:37,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:37,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-05 15:55:37,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:37,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-05 15:55:37,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1993, Unknown=0, NotChecked=0, Total=2162 [2025-02-05 15:55:37,426 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 47 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 33 states have internal predecessors, (67), 13 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (19), 14 states have call predecessors, (19), 13 states have call successors, (19) [2025-02-05 15:55:37,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:37,891 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2025-02-05 15:55:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 15:55:37,892 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 33 states have internal predecessors, (67), 13 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (19), 14 states have call predecessors, (19), 13 states have call successors, (19) Word has length 62 [2025-02-05 15:55:37,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:37,892 INFO L225 Difference]: With dead ends: 45 [2025-02-05 15:55:37,892 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 15:55:37,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=409, Invalid=3497, Unknown=0, NotChecked=0, Total=3906 [2025-02-05 15:55:37,894 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:37,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 238 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:55:37,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 15:55:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-05 15:55:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-05 15:55:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-02-05 15:55:37,897 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 62 [2025-02-05 15:55:37,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:37,898 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-02-05 15:55:37,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 33 states have internal predecessors, (67), 13 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (19), 14 states have call predecessors, (19), 13 states have call successors, (19) [2025-02-05 15:55:37,898 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-02-05 15:55:37,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 15:55:37,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:37,898 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:37,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:38,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:38,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:38,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:38,100 INFO L85 PathProgramCache]: Analyzing trace with hash 196932686, now seen corresponding path program 7 times [2025-02-05 15:55:38,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:38,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759027231] [2025-02-05 15:55:38,100 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 15:55:38,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:38,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 15:55:38,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 15:55:38,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:38,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 137 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:55:38,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:38,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759027231] [2025-02-05 15:55:38,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759027231] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:38,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828591664] [2025-02-05 15:55:38,721 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 15:55:38,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:38,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:38,722 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:38,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 15:55:38,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 15:55:38,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 15:55:38,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:38,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:38,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-02-05 15:55:38,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 4 proven. 83 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-05 15:55:39,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 23 proven. 115 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:55:40,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828591664] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:40,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:40,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 18, 27] total 64 [2025-02-05 15:55:40,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203225820] [2025-02-05 15:55:40,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:40,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-02-05 15:55:40,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:40,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-02-05 15:55:40,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3808, Unknown=0, NotChecked=0, Total=4032 [2025-02-05 15:55:40,818 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 64 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 43 states have internal predecessors, (90), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (22), 21 states have call predecessors, (22), 17 states have call successors, (22) [2025-02-05 15:55:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:41,915 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2025-02-05 15:55:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-05 15:55:41,916 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 43 states have internal predecessors, (90), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (22), 21 states have call predecessors, (22), 17 states have call successors, (22) Word has length 62 [2025-02-05 15:55:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:41,918 INFO L225 Difference]: With dead ends: 48 [2025-02-05 15:55:41,918 INFO L226 Difference]: Without dead ends: 41 [2025-02-05 15:55:41,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=677, Invalid=6633, Unknown=0, NotChecked=0, Total=7310 [2025-02-05 15:55:41,920 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:41,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 440 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 15:55:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-05 15:55:41,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2025-02-05 15:55:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (13), 8 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:55:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-02-05 15:55:41,928 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 62 [2025-02-05 15:55:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:41,928 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-02-05 15:55:41,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 43 states have internal predecessors, (90), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (22), 21 states have call predecessors, (22), 17 states have call successors, (22) [2025-02-05 15:55:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-02-05 15:55:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 15:55:41,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:41,930 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:41,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 15:55:42,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:42,131 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:42,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:42,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1657736378, now seen corresponding path program 8 times [2025-02-05 15:55:42,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:42,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258740106] [2025-02-05 15:55:42,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:55:42,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:42,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-02-05 15:55:42,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 15:55:42,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:55:42,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 28 proven. 156 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-02-05 15:55:43,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:43,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258740106] [2025-02-05 15:55:43,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258740106] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:43,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338131627] [2025-02-05 15:55:43,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:55:43,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:43,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:43,086 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:43,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 15:55:43,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-02-05 15:55:43,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 15:55:43,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:55:43,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:43,137 WARN L254 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 121 conjuncts are in the unsatisfiable core [2025-02-05 15:55:43,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 6 proven. 136 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-02-05 15:55:43,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 29 proven. 203 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-05 15:55:44,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338131627] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:44,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:44,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 33] total 55 [2025-02-05 15:55:44,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456964490] [2025-02-05 15:55:44,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:44,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-05 15:55:44,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:44,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-05 15:55:44,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=2735, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 15:55:44,859 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 55 states, 51 states have (on average 1.588235294117647) internal successors, (81), 36 states have internal predecessors, (81), 14 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (27), 19 states have call predecessors, (27), 14 states have call successors, (27) [2025-02-05 15:55:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:45,888 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2025-02-05 15:55:45,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-05 15:55:45,889 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 1.588235294117647) internal successors, (81), 36 states have internal predecessors, (81), 14 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (27), 19 states have call predecessors, (27), 14 states have call successors, (27) Word has length 76 [2025-02-05 15:55:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:45,890 INFO L225 Difference]: With dead ends: 59 [2025-02-05 15:55:45,890 INFO L226 Difference]: Without dead ends: 49 [2025-02-05 15:55:45,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=761, Invalid=6211, Unknown=0, NotChecked=0, Total=6972 [2025-02-05 15:55:45,892 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 105 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:45,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 366 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:55:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-05 15:55:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2025-02-05 15:55:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 8 states have return successors, (18), 10 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-05 15:55:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2025-02-05 15:55:45,900 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 76 [2025-02-05 15:55:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:45,900 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-02-05 15:55:45,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 1.588235294117647) internal successors, (81), 36 states have internal predecessors, (81), 14 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (27), 19 states have call predecessors, (27), 14 states have call successors, (27) [2025-02-05 15:55:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2025-02-05 15:55:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 15:55:45,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:45,902 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:45,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:46,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:46,105 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:46,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:46,105 INFO L85 PathProgramCache]: Analyzing trace with hash 988511436, now seen corresponding path program 9 times [2025-02-05 15:55:46,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:46,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953344624] [2025-02-05 15:55:46,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:55:46,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:46,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 83 statements into 13 equivalence classes. [2025-02-05 15:55:46,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 15:55:46,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-05 15:55:46,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 20 proven. 176 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-02-05 15:55:46,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:46,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953344624] [2025-02-05 15:55:46,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953344624] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:46,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104658603] [2025-02-05 15:55:46,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:55:46,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:46,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:46,745 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:46,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 15:55:46,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 83 statements into 13 equivalence classes. [2025-02-05 15:55:46,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 15:55:46,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-05 15:55:46,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:46,804 WARN L254 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 133 conjuncts are in the unsatisfiable core [2025-02-05 15:55:46,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 5 proven. 163 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-02-05 15:55:47,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 38 proven. 250 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-05 15:55:48,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104658603] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:48,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:48,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 36] total 55 [2025-02-05 15:55:48,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487449905] [2025-02-05 15:55:48,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:48,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-05 15:55:48,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:48,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-05 15:55:48,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2745, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 15:55:48,725 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 55 states, 51 states have (on average 1.607843137254902) internal successors, (82), 36 states have internal predecessors, (82), 15 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (25), 19 states have call predecessors, (25), 15 states have call successors, (25) [2025-02-05 15:55:49,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:49,767 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2025-02-05 15:55:49,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-05 15:55:49,768 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 1.607843137254902) internal successors, (82), 36 states have internal predecessors, (82), 15 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (25), 19 states have call predecessors, (25), 15 states have call successors, (25) Word has length 83 [2025-02-05 15:55:49,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:49,768 INFO L225 Difference]: With dead ends: 65 [2025-02-05 15:55:49,769 INFO L226 Difference]: Without dead ends: 53 [2025-02-05 15:55:49,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=783, Invalid=5859, Unknown=0, NotChecked=0, Total=6642 [2025-02-05 15:55:49,772 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 57 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:49,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 362 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:55:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-05 15:55:49,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2025-02-05 15:55:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 8 states have return successors, (17), 10 states have call predecessors, (17), 5 states have call successors, (17) [2025-02-05 15:55:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2025-02-05 15:55:49,784 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 83 [2025-02-05 15:55:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:49,785 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2025-02-05 15:55:49,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 1.607843137254902) internal successors, (82), 36 states have internal predecessors, (82), 15 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (25), 19 states have call predecessors, (25), 15 states have call successors, (25) [2025-02-05 15:55:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2025-02-05 15:55:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 15:55:49,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:49,786 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:49,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:49,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 15:55:49,987 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:49,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:49,987 INFO L85 PathProgramCache]: Analyzing trace with hash 619291484, now seen corresponding path program 10 times [2025-02-05 15:55:49,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:49,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112832853] [2025-02-05 15:55:49,987 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:55:49,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:49,991 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-02-05 15:55:50,001 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 15:55:50,002 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:55:50,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 48 proven. 194 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-02-05 15:55:50,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:50,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112832853] [2025-02-05 15:55:50,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112832853] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:50,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567718041] [2025-02-05 15:55:50,817 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:55:50,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:50,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:50,821 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:50,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 15:55:50,857 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-02-05 15:55:50,876 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 15:55:50,876 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:55:50,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:50,878 WARN L254 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 133 conjuncts are in the unsatisfiable core [2025-02-05 15:55:50,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 7 proven. 167 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-02-05 15:55:51,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 32 proven. 256 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-05 15:55:53,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567718041] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:53,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:53,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 24, 36] total 74 [2025-02-05 15:55:53,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791539044] [2025-02-05 15:55:53,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:53,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2025-02-05 15:55:53,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:53,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2025-02-05 15:55:53,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=5125, Unknown=0, NotChecked=0, Total=5402 [2025-02-05 15:55:53,994 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 74 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 45 states have internal predecessors, (99), 15 states have call successors, (15), 1 states have call predecessors, (15), 20 states have return successors, (31), 29 states have call predecessors, (31), 15 states have call successors, (31) [2025-02-05 15:55:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:55,422 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2025-02-05 15:55:55,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-05 15:55:55,422 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 45 states have internal predecessors, (99), 15 states have call successors, (15), 1 states have call predecessors, (15), 20 states have return successors, (31), 29 states have call predecessors, (31), 15 states have call successors, (31) Word has length 83 [2025-02-05 15:55:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:55,423 INFO L225 Difference]: With dead ends: 63 [2025-02-05 15:55:55,423 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 15:55:55,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2312 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=803, Invalid=9297, Unknown=0, NotChecked=0, Total=10100 [2025-02-05 15:55:55,427 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 103 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:55,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 620 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 15:55:55,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 15:55:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2025-02-05 15:55:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.0625) internal successors, (34), 33 states have internal predecessors, (34), 5 states have call successors, (5), 2 states have call predecessors, (5), 9 states have return successors, (19), 11 states have call predecessors, (19), 5 states have call successors, (19) [2025-02-05 15:55:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2025-02-05 15:55:55,460 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 83 [2025-02-05 15:55:55,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:55,461 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2025-02-05 15:55:55,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 45 states have internal predecessors, (99), 15 states have call successors, (15), 1 states have call predecessors, (15), 20 states have return successors, (31), 29 states have call predecessors, (31), 15 states have call successors, (31) [2025-02-05 15:55:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2025-02-05 15:55:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:55:55,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:55,464 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 13, 13, 13, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:55,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:55,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 15:55:55,666 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:55,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:55,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1948672892, now seen corresponding path program 11 times [2025-02-05 15:55:55,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:55,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520148155] [2025-02-05 15:55:55,666 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:55:55,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:55,671 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 111 statements into 18 equivalence classes. [2025-02-05 15:55:55,688 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:55:55,688 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-02-05 15:55:55,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 109 proven. 383 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-05 15:55:56,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:56,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520148155] [2025-02-05 15:55:56,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520148155] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:56,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987922104] [2025-02-05 15:55:56,922 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:55:56,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:56,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:56,924 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:56,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 15:55:56,960 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 111 statements into 18 equivalence classes. [2025-02-05 15:55:56,989 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:55:56,989 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-02-05 15:55:56,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:56,992 WARN L254 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 181 conjuncts are in the unsatisfiable core [2025-02-05 15:55:56,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 8 proven. 315 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2025-02-05 15:55:57,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:56:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 53 proven. 519 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-02-05 15:56:01,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987922104] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:56:01,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:56:01,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 26, 48] total 103 [2025-02-05 15:56:01,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488761216] [2025-02-05 15:56:01,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:56:01,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2025-02-05 15:56:01,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:56:01,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2025-02-05 15:56:01,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=10085, Unknown=0, NotChecked=0, Total=10506 [2025-02-05 15:56:01,401 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 103 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 64 states have internal predecessors, (143), 23 states have call successors, (23), 1 states have call predecessors, (23), 29 states have return successors, (40), 39 states have call predecessors, (40), 23 states have call successors, (40) [2025-02-05 15:56:03,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:56:03,762 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2025-02-05 15:56:03,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-05 15:56:03,762 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 64 states have internal predecessors, (143), 23 states have call successors, (23), 1 states have call predecessors, (23), 29 states have return successors, (40), 39 states have call predecessors, (40), 23 states have call successors, (40) Word has length 111 [2025-02-05 15:56:03,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:56:03,763 INFO L225 Difference]: With dead ends: 73 [2025-02-05 15:56:03,763 INFO L226 Difference]: Without dead ends: 59 [2025-02-05 15:56:03,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4398 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1498, Invalid=17684, Unknown=0, NotChecked=0, Total=19182 [2025-02-05 15:56:03,767 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 138 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 3549 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 3716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 3549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:56:03,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 893 Invalid, 3716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 3549 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 15:56:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-05 15:56:03,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2025-02-05 15:56:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 35 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 10 states have return successors, (21), 12 states have call predecessors, (21), 5 states have call successors, (21) [2025-02-05 15:56:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2025-02-05 15:56:03,780 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 111 [2025-02-05 15:56:03,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:56:03,780 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2025-02-05 15:56:03,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 64 states have internal predecessors, (143), 23 states have call successors, (23), 1 states have call predecessors, (23), 29 states have return successors, (40), 39 states have call predecessors, (40), 23 states have call successors, (40) [2025-02-05 15:56:03,781 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2025-02-05 15:56:03,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 15:56:03,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:56:03,782 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 11, 11, 11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:56:03,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-05 15:56:03,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:56:03,982 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:56:03,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:56:03,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1898741348, now seen corresponding path program 12 times [2025-02-05 15:56:03,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:56:03,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268270914] [2025-02-05 15:56:03,983 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:56:03,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:56:03,989 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 97 statements into 14 equivalence classes. [2025-02-05 15:56:04,000 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 15:56:04,001 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-02-05 15:56:04,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 65 proven. 335 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:56:05,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:56:05,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268270914] [2025-02-05 15:56:05,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268270914] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:56:05,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613126615] [2025-02-05 15:56:05,019 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:56:05,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:56:05,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:56:05,021 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:56:05,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 15:56:05,065 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 97 statements into 14 equivalence classes. [2025-02-05 15:56:05,091 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 15:56:05,091 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-02-05 15:56:05,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:05,093 WARN L254 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 157 conjuncts are in the unsatisfiable core [2025-02-05 15:56:05,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:56:05,923 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 18 proven. 229 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-02-05 15:56:05,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:56:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 38 proven. 380 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 15:56:08,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613126615] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:56:08,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:56:08,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 27, 41] total 86 [2025-02-05 15:56:08,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992369199] [2025-02-05 15:56:08,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:56:08,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2025-02-05 15:56:08,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:56:08,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2025-02-05 15:56:08,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=7006, Unknown=0, NotChecked=0, Total=7310 [2025-02-05 15:56:08,803 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 86 states, 82 states have (on average 1.5609756097560976) internal successors, (128), 52 states have internal predecessors, (128), 23 states have call successors, (23), 1 states have call predecessors, (23), 21 states have return successors, (37), 34 states have call predecessors, (37), 23 states have call successors, (37) [2025-02-05 15:56:10,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:56:10,761 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2025-02-05 15:56:10,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-05 15:56:10,761 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 82 states have (on average 1.5609756097560976) internal successors, (128), 52 states have internal predecessors, (128), 23 states have call successors, (23), 1 states have call predecessors, (23), 21 states have return successors, (37), 34 states have call predecessors, (37), 23 states have call successors, (37) Word has length 97 [2025-02-05 15:56:10,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:56:10,762 INFO L225 Difference]: With dead ends: 69 [2025-02-05 15:56:10,763 INFO L226 Difference]: Without dead ends: 62 [2025-02-05 15:56:10,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3467 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1054, Invalid=12752, Unknown=0, NotChecked=0, Total=13806 [2025-02-05 15:56:10,765 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 134 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 2695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:56:10,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 841 Invalid, 2695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 15:56:10,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-05 15:56:10,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2025-02-05 15:56:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 37 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 11 states have return successors, (23), 13 states have call predecessors, (23), 5 states have call successors, (23) [2025-02-05 15:56:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2025-02-05 15:56:10,775 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 97 [2025-02-05 15:56:10,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:56:10,776 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2025-02-05 15:56:10,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 82 states have (on average 1.5609756097560976) internal successors, (128), 52 states have internal predecessors, (128), 23 states have call successors, (23), 1 states have call predecessors, (23), 21 states have return successors, (37), 34 states have call predecessors, (37), 23 states have call successors, (37) [2025-02-05 15:56:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2025-02-05 15:56:10,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 15:56:10,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:56:10,778 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 12, 12, 12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:56:10,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-05 15:56:10,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:56:10,983 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:56:10,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:56:10,984 INFO L85 PathProgramCache]: Analyzing trace with hash 411000118, now seen corresponding path program 13 times [2025-02-05 15:56:10,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:56:10,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165099605] [2025-02-05 15:56:10,984 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 15:56:10,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:56:10,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:56:10,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:56:10,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:56:10,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 492 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 15:56:12,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:56:12,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165099605] [2025-02-05 15:56:12,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165099605] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:56:12,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605162295] [2025-02-05 15:56:12,425 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 15:56:12,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:56:12,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:56:12,427 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:56:12,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 15:56:12,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:56:12,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:56:12,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:56:12,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:12,503 WARN L254 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 169 conjuncts are in the unsatisfiable core [2025-02-05 15:56:12,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:56:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 10 proven. 278 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2025-02-05 15:56:13,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:56:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 41 proven. 451 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 15:56:17,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605162295] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:56:17,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:56:17,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 30, 45] total 106 [2025-02-05 15:56:17,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250176371] [2025-02-05 15:56:17,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:56:17,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2025-02-05 15:56:17,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:56:17,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2025-02-05 15:56:17,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=10767, Unknown=0, NotChecked=0, Total=11130 [2025-02-05 15:56:17,141 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 106 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 67 states have internal predecessors, (156), 29 states have call successors, (29), 1 states have call predecessors, (29), 26 states have return successors, (40), 39 states have call predecessors, (40), 29 states have call successors, (40) [2025-02-05 15:56:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:56:19,349 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2025-02-05 15:56:19,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-02-05 15:56:19,350 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 67 states have internal predecessors, (156), 29 states have call successors, (29), 1 states have call predecessors, (29), 26 states have return successors, (40), 39 states have call predecessors, (40), 29 states have call successors, (40) Word has length 104 [2025-02-05 15:56:19,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:56:19,351 INFO L225 Difference]: With dead ends: 72 [2025-02-05 15:56:19,351 INFO L226 Difference]: Without dead ends: 65 [2025-02-05 15:56:19,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3972 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1374, Invalid=18086, Unknown=0, NotChecked=0, Total=19460 [2025-02-05 15:56:19,353 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 128 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 3034 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 3269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 3034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:56:19,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1049 Invalid, 3269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 3034 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 15:56:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-05 15:56:19,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2025-02-05 15:56:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 12 states have return successors, (25), 14 states have call predecessors, (25), 5 states have call successors, (25) [2025-02-05 15:56:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-02-05 15:56:19,360 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 104 [2025-02-05 15:56:19,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:56:19,360 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-02-05 15:56:19,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 67 states have internal predecessors, (156), 29 states have call successors, (29), 1 states have call predecessors, (29), 26 states have return successors, (40), 39 states have call predecessors, (40), 29 states have call successors, (40) [2025-02-05 15:56:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2025-02-05 15:56:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:56:19,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:56:19,361 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 17, 17, 17, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:56:19,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-05 15:56:19,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 15:56:19,565 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:56:19,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:56:19,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1931280804, now seen corresponding path program 14 times [2025-02-05 15:56:19,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:56:19,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865387859] [2025-02-05 15:56:19,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:56:19,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:56:19,570 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 139 statements into 2 equivalence classes. [2025-02-05 15:56:19,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:56:19,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:56:19,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1127 backedges. 2 proven. 954 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-02-05 15:56:21,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:56:21,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865387859] [2025-02-05 15:56:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865387859] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:56:21,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016296513] [2025-02-05 15:56:21,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:56:21,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:56:21,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:56:21,929 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:56:21,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-05 15:56:21,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 139 statements into 2 equivalence classes. [2025-02-05 15:56:22,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:56:22,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:56:22,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:22,019 WARN L254 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 229 conjuncts are in the unsatisfiable core [2025-02-05 15:56:22,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:56:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1127 backedges. 11 proven. 515 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-02-05 15:56:23,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:56:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1127 backedges. 68 proven. 884 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-02-05 15:56:29,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016296513] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:56:29,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:56:29,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 32, 60] total 137 [2025-02-05 15:56:29,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523498197] [2025-02-05 15:56:29,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:56:29,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 137 states [2025-02-05 15:56:29,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:56:29,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2025-02-05 15:56:29,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=18141, Unknown=0, NotChecked=0, Total=18632 [2025-02-05 15:56:29,412 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 137 states, 132 states have (on average 1.5833333333333333) internal successors, (209), 87 states have internal predecessors, (209), 39 states have call successors, (39), 1 states have call predecessors, (39), 36 states have return successors, (51), 50 states have call predecessors, (51), 39 states have call successors, (51) [2025-02-05 15:56:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:56:33,348 INFO L93 Difference]: Finished difference Result 85 states and 118 transitions. [2025-02-05 15:56:33,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-02-05 15:56:33,348 INFO L78 Accepts]: Start accepts. Automaton has has 137 states, 132 states have (on average 1.5833333333333333) internal successors, (209), 87 states have internal predecessors, (209), 39 states have call successors, (39), 1 states have call predecessors, (39), 36 states have return successors, (51), 50 states have call predecessors, (51), 39 states have call successors, (51) Word has length 139 [2025-02-05 15:56:33,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:56:33,349 INFO L225 Difference]: With dead ends: 85 [2025-02-05 15:56:33,349 INFO L226 Difference]: Without dead ends: 68 [2025-02-05 15:56:33,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6462 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2445, Invalid=30861, Unknown=0, NotChecked=0, Total=33306 [2025-02-05 15:56:33,352 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 234 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 5071 mSolverCounterSat, 597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 5668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 597 IncrementalHoareTripleChecker+Valid, 5071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:56:33,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1257 Invalid, 5668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [597 Valid, 5071 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 15:56:33,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-05 15:56:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2025-02-05 15:56:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.05) internal successors, (42), 41 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 13 states have return successors, (27), 15 states have call predecessors, (27), 5 states have call successors, (27) [2025-02-05 15:56:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2025-02-05 15:56:33,362 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 139 [2025-02-05 15:56:33,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:56:33,362 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2025-02-05 15:56:33,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 137 states, 132 states have (on average 1.5833333333333333) internal successors, (209), 87 states have internal predecessors, (209), 39 states have call successors, (39), 1 states have call predecessors, (39), 36 states have return successors, (51), 50 states have call predecessors, (51), 39 states have call successors, (51) [2025-02-05 15:56:33,362 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2025-02-05 15:56:33,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:56:33,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:56:33,363 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 14, 14, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:56:33,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-05 15:56:33,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 15:56:33,567 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:56:33,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:56:33,568 INFO L85 PathProgramCache]: Analyzing trace with hash -637876178, now seen corresponding path program 15 times [2025-02-05 15:56:33,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:56:33,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559120703] [2025-02-05 15:56:33,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:56:33,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:56:33,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 118 statements into 16 equivalence classes. [2025-02-05 15:56:33,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:56:33,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-02-05 15:56:33,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 138 proven. 440 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-02-05 15:56:34,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:56:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559120703] [2025-02-05 15:56:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559120703] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:56:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692605998] [2025-02-05 15:56:34,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:56:34,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:56:34,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:56:34,931 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:56:34,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-05 15:56:35,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 118 statements into 16 equivalence classes. [2025-02-05 15:56:35,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:56:35,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-02-05 15:56:35,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:35,071 WARN L254 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 193 conjuncts are in the unsatisfiable core [2025-02-05 15:56:35,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:56:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 12 proven. 367 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2025-02-05 15:56:36,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:56:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 47 proven. 611 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 15:56:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692605998] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:56:39,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:56:39,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 34, 51] total 109 [2025-02-05 15:56:39,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645525518] [2025-02-05 15:56:39,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:56:39,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2025-02-05 15:56:39,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:56:39,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2025-02-05 15:56:39,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=11397, Unknown=0, NotChecked=0, Total=11772 [2025-02-05 15:56:39,978 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 109 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 65 states have internal predecessors, (156), 25 states have call successors, (25), 1 states have call predecessors, (25), 30 states have return successors, (45), 44 states have call predecessors, (45), 25 states have call successors, (45) [2025-02-05 15:56:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:56:42,561 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2025-02-05 15:56:42,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-05 15:56:42,561 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 65 states have internal predecessors, (156), 25 states have call successors, (25), 1 states have call predecessors, (25), 30 states have return successors, (45), 44 states have call predecessors, (45), 25 states have call successors, (45) Word has length 118 [2025-02-05 15:56:42,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:56:42,562 INFO L225 Difference]: With dead ends: 78 [2025-02-05 15:56:42,562 INFO L226 Difference]: Without dead ends: 71 [2025-02-05 15:56:42,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5095 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1423, Invalid=20039, Unknown=0, NotChecked=0, Total=21462 [2025-02-05 15:56:42,566 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 192 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 3643 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 3918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 3643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:56:42,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1233 Invalid, 3918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 3643 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 15:56:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-05 15:56:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2025-02-05 15:56:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 43 states have internal predecessors, (44), 5 states have call successors, (5), 2 states have call predecessors, (5), 14 states have return successors, (29), 16 states have call predecessors, (29), 5 states have call successors, (29) [2025-02-05 15:56:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2025-02-05 15:56:42,580 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 118 [2025-02-05 15:56:42,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:56:42,581 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2025-02-05 15:56:42,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 65 states have internal predecessors, (156), 25 states have call successors, (25), 1 states have call predecessors, (25), 30 states have return successors, (45), 44 states have call predecessors, (45), 25 states have call successors, (45) [2025-02-05 15:56:42,582 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2025-02-05 15:56:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 15:56:42,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:56:42,583 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 20, 20, 20, 20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:56:42,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-05 15:56:42,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:56:42,784 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:56:42,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:56:42,785 INFO L85 PathProgramCache]: Analyzing trace with hash -951600130, now seen corresponding path program 16 times [2025-02-05 15:56:42,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:56:42,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074356867] [2025-02-05 15:56:42,785 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:56:42,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:56:42,799 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 160 statements into 2 equivalence classes. [2025-02-05 15:56:42,816 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 15:56:42,818 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:56:42,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1535 backedges. 64 proven. 776 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2025-02-05 15:56:45,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:56:45,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074356867] [2025-02-05 15:56:45,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074356867] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:56:45,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779146364] [2025-02-05 15:56:45,061 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:56:45,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:56:45,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:56:45,063 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:56:45,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-05 15:56:45,141 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 160 statements into 2 equivalence classes. [2025-02-05 15:56:45,178 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 15:56:45,178 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:56:45,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:45,182 WARN L254 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 265 conjuncts are in the unsatisfiable core [2025-02-05 15:56:45,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:56:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1535 backedges. 13 proven. 696 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2025-02-05 15:56:47,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:56:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1535 backedges. 80 proven. 1220 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-05 15:56:53,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779146364] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:56:53,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:56:53,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 36, 69] total 137 [2025-02-05 15:56:53,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144285459] [2025-02-05 15:56:53,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:56:53,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 137 states [2025-02-05 15:56:53,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:56:53,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2025-02-05 15:56:53,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=18082, Unknown=0, NotChecked=0, Total=18632 [2025-02-05 15:56:53,268 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 137 states, 133 states have (on average 1.3834586466165413) internal successors, (184), 79 states have internal predecessors, (184), 26 states have call successors, (26), 1 states have call predecessors, (26), 43 states have return successors, (59), 58 states have call predecessors, (59), 26 states have call successors, (59) [2025-02-05 15:56:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:56:57,278 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2025-02-05 15:56:57,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-02-05 15:56:57,279 INFO L78 Accepts]: Start accepts. Automaton has has 137 states, 133 states have (on average 1.3834586466165413) internal successors, (184), 79 states have internal predecessors, (184), 26 states have call successors, (26), 1 states have call predecessors, (26), 43 states have return successors, (59), 58 states have call predecessors, (59), 26 states have call successors, (59) Word has length 160 [2025-02-05 15:56:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:56:57,282 INFO L225 Difference]: With dead ends: 93 [2025-02-05 15:56:57,282 INFO L226 Difference]: Without dead ends: 74 [2025-02-05 15:56:57,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7335 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2279, Invalid=32877, Unknown=0, NotChecked=0, Total=35156 [2025-02-05 15:56:57,284 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 266 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 5510 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 5754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 5510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:56:57,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1256 Invalid, 5754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 5510 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 15:56:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-05 15:56:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2025-02-05 15:56:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 15 states have return successors, (31), 17 states have call predecessors, (31), 5 states have call successors, (31) [2025-02-05 15:56:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2025-02-05 15:56:57,292 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 160 [2025-02-05 15:56:57,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:56:57,292 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2025-02-05 15:56:57,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 137 states, 133 states have (on average 1.3834586466165413) internal successors, (184), 79 states have internal predecessors, (184), 26 states have call successors, (26), 1 states have call predecessors, (26), 43 states have return successors, (59), 58 states have call predecessors, (59), 26 states have call successors, (59) [2025-02-05 15:56:57,292 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2025-02-05 15:56:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:56:57,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:56:57,293 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 16, 16, 16, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:56:57,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-05 15:56:57,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:56:57,494 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:56:57,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:56:57,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1044666150, now seen corresponding path program 17 times [2025-02-05 15:56:57,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:56:57,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015304855] [2025-02-05 15:56:57,494 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:56:57,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:56:57,499 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 132 statements into 18 equivalence classes. [2025-02-05 15:56:57,510 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:56:57,510 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-02-05 15:56:57,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 41 proven. 496 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-02-05 15:56:58,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:56:58,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015304855] [2025-02-05 15:56:58,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015304855] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:56:58,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904687707] [2025-02-05 15:56:58,914 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:56:58,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:56:58,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:56:58,916 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:56:58,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-05 15:56:59,011 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 132 statements into 18 equivalence classes. [2025-02-05 15:56:59,046 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:56:59,047 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-02-05 15:56:59,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:56:59,053 WARN L254 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 217 conjuncts are in the unsatisfiable core [2025-02-05 15:56:59,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:57:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 29 proven. 454 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2025-02-05 15:57:00,595 INFO L312 TraceCheckSpWp]: Computing backward predicates...