./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-industry-pattern/check_removal_from_set_after_insertion.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/array-industry-pattern/check_removal_from_set_after_insertion.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 07a8b8b198dffd8285677bd0bfdd16b4d1f780e3a9696ef3e27a077e8ff12a49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:02:52,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:02:52,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:02:52,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:02:52,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:02:52,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:02:52,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:02:52,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:02:52,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:02:52,543 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:02:52,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:02:52,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:02:52,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:02:52,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:02:52,543 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:02:52,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:02:52,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:02:52,543 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:02:52,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:02:52,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:02:52,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:02:52,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:02:52,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:02:52,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:02:52,545 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:02:52,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:02:52,545 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:02:52,545 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:02:52,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:02:52,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:02:52,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:02:52,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:02:52,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:02:52,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:02:52,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:02:52,546 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:02:52,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:02:52,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:02:52,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:02:52,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:02:52,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:02:52,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:02:52,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:02:52,546 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 -> 07a8b8b198dffd8285677bd0bfdd16b4d1f780e3a9696ef3e27a077e8ff12a49 [2025-02-05 10:02:52,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:02:52,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:02:52,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:02:52,813 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:02:52,813 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:02:52,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/check_removal_from_set_after_insertion.c [2025-02-05 10:02:53,966 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cffe4e76b/59699e56be9e49518b088a11f4da0644/FLAG0f4abc073 [2025-02-05 10:02:54,254 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:02:54,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/check_removal_from_set_after_insertion.c [2025-02-05 10:02:54,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cffe4e76b/59699e56be9e49518b088a11f4da0644/FLAG0f4abc073 [2025-02-05 10:02:54,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cffe4e76b/59699e56be9e49518b088a11f4da0644 [2025-02-05 10:02:54,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:02:54,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:02:54,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:02:54,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:02:54,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:02:54,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:02:54" (1/1) ... [2025-02-05 10:02:54,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1cf0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54, skipping insertion in model container [2025-02-05 10:02:54,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:02:54" (1/1) ... [2025-02-05 10:02:54,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:02:54,652 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/array-industry-pattern/check_removal_from_set_after_insertion.c[342,355] [2025-02-05 10:02:54,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:02:54,675 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:02:54,682 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/array-industry-pattern/check_removal_from_set_after_insertion.c[342,355] [2025-02-05 10:02:54,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:02:54,697 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:02:54,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54 WrapperNode [2025-02-05 10:02:54,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:02:54,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:02:54,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:02:54,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:02:54,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 10:02:54,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 10:02:54,719 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2025-02-05 10:02:54,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:02:54,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:02:54,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:02:54,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:02:54,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 10:02:54,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 10:02:54,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 10:02:54,733 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 3, 7]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 1, 3]. [2025-02-05 10:02:54,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 10:02:54,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 10:02:54,737 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 10:02:54,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 10:02:54,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 10:02:54,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 10:02:54,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:02:54,741 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:02:54,741 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:02:54,741 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:02:54,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 10:02:54,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:02:54,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:02:54,780 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 10:02:54,787 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 10:02:54,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:02:54,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:02:54,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:02:54,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:02:54,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:02:54,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:02:54,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:02:54,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:02:54,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:02:54,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:02:54,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:02:54,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:02:54,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:02:54,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:02:54,867 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:02:54,869 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:02:55,077 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-05 10:02:55,077 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:02:55,086 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:02:55,087 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:02:55,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:02:55 BoogieIcfgContainer [2025-02-05 10:02:55,088 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:02:55,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:02:55,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:02:55,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:02:55,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:02:54" (1/3) ... [2025-02-05 10:02:55,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d6d539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:02:55, skipping insertion in model container [2025-02-05 10:02:55,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (2/3) ... [2025-02-05 10:02:55,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d6d539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:02:55, skipping insertion in model container [2025-02-05 10:02:55,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:02:55" (3/3) ... [2025-02-05 10:02:55,096 INFO L128 eAbstractionObserver]: Analyzing ICFG check_removal_from_set_after_insertion.c [2025-02-05 10:02:55,108 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:02:55,109 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG check_removal_from_set_after_insertion.c that has 1 procedures, 25 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-05 10:02:55,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:02:55,160 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;@6b7cb92f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:02:55,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:02:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 10:02:55,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:02:55,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:02:55,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:02:55,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:02:55,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1390811096, now seen corresponding path program 1 times [2025-02-05 10:02:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:02:55,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742755811] [2025-02-05 10:02:55,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:02:55,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:02:55,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 10:02:55,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 10:02:55,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:02:55,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:02:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:02:55,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:02:55,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742755811] [2025-02-05 10:02:55,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742755811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:02:55,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:02:55,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:02:55,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393010834] [2025-02-05 10:02:55,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:02:55,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:02:55,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:02:55,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:02:55,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:02:55,411 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:55,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:02:55,492 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2025-02-05 10:02:55,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:02:55,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-05 10:02:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:02:55,497 INFO L225 Difference]: With dead ends: 56 [2025-02-05 10:02:55,497 INFO L226 Difference]: Without dead ends: 30 [2025-02-05 10:02:55,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:02:55,501 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 42 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:02:55,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 38 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:02:55,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-05 10:02:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2025-02-05 10:02:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2025-02-05 10:02:55,520 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 10 [2025-02-05 10:02:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:02:55,520 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2025-02-05 10:02:55,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2025-02-05 10:02:55,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 10:02:55,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:02:55,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:02:55,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:02:55,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:02:55,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:02:55,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1177564685, now seen corresponding path program 1 times [2025-02-05 10:02:55,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:02:55,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450527147] [2025-02-05 10:02:55,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:02:55,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:02:55,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 10:02:55,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 10:02:55,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:02:55,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:02:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:02:55,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:02:55,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450527147] [2025-02-05 10:02:55,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450527147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:02:55,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:02:55,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:02:55,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933105850] [2025-02-05 10:02:55,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:02:55,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:02:55,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:02:55,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:02:55,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:02:55,609 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:02:55,657 INFO L93 Difference]: Finished difference Result 40 states and 57 transitions. [2025-02-05 10:02:55,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:02:55,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-05 10:02:55,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:02:55,658 INFO L225 Difference]: With dead ends: 40 [2025-02-05 10:02:55,658 INFO L226 Difference]: Without dead ends: 29 [2025-02-05 10:02:55,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:02:55,660 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:02:55,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 35 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:02:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-05 10:02:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2025-02-05 10:02:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2025-02-05 10:02:55,663 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 32 transitions. Word has length 11 [2025-02-05 10:02:55,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:02:55,663 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-02-05 10:02:55,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:55,666 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2025-02-05 10:02:55,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 10:02:55,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:02:55,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:02:55,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:02:55,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:02:55,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:02:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1660167538, now seen corresponding path program 1 times [2025-02-05 10:02:55,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:02:55,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359459161] [2025-02-05 10:02:55,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:02:55,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:02:55,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 10:02:55,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:02:55,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:02:55,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:02:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:02:55,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:02:55,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359459161] [2025-02-05 10:02:55,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359459161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:02:55,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:02:55,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:02:55,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890874505] [2025-02-05 10:02:55,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:02:55,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:02:55,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:02:55,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:02:55,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:02:55,785 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:02:55,798 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2025-02-05 10:02:55,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:02:55,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-05 10:02:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:02:55,799 INFO L225 Difference]: With dead ends: 43 [2025-02-05 10:02:55,799 INFO L226 Difference]: Without dead ends: 25 [2025-02-05 10:02:55,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:02:55,800 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:02:55,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:02:55,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-05 10:02:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-05 10:02:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-02-05 10:02:55,804 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 16 [2025-02-05 10:02:55,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:02:55,804 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-02-05 10:02:55,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:55,804 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-02-05 10:02:55,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:02:55,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:02:55,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:02:55,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:02:55,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:02:55,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:02:55,805 INFO L85 PathProgramCache]: Analyzing trace with hash 100862839, now seen corresponding path program 1 times [2025-02-05 10:02:55,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:02:55,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237274207] [2025-02-05 10:02:55,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:02:55,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:02:55,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:02:55,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:02:55,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:02:55,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:02:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:02:55,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:02:55,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237274207] [2025-02-05 10:02:55,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237274207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:02:55,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:02:55,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:02:55,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868442965] [2025-02-05 10:02:55,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:02:55,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:02:55,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:02:55,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:02:55,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:02:55,919 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:02:55,950 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2025-02-05 10:02:55,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:02:55,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 10:02:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:02:55,953 INFO L225 Difference]: With dead ends: 48 [2025-02-05 10:02:55,953 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 10:02:55,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:02:55,954 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:02:55,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:02:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 10:02:55,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-02-05 10:02:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-02-05 10:02:55,960 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 17 [2025-02-05 10:02:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:02:55,960 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-02-05 10:02:55,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:55,960 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-02-05 10:02:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:02:55,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:02:55,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:02:55,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:02:55,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:02:55,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:02:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1241611831, now seen corresponding path program 1 times [2025-02-05 10:02:55,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:02:55,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631902989] [2025-02-05 10:02:55,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:02:55,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:02:55,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:02:55,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:02:55,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:02:55,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:02:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:02:56,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:02:56,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631902989] [2025-02-05 10:02:56,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631902989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:02:56,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:02:56,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:02:56,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617407592] [2025-02-05 10:02:56,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:02:56,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:02:56,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:02:56,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:02:56,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:02:56,009 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:02:56,029 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2025-02-05 10:02:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:02:56,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 10:02:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:02:56,031 INFO L225 Difference]: With dead ends: 37 [2025-02-05 10:02:56,031 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 10:02:56,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:02:56,032 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:02:56,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 37 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:02:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 10:02:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-05 10:02:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-02-05 10:02:56,039 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2025-02-05 10:02:56,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:02:56,039 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-02-05 10:02:56,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:56,039 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2025-02-05 10:02:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:02:56,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:02:56,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:02:56,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:02:56,040 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:02:56,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:02:56,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2138669283, now seen corresponding path program 1 times [2025-02-05 10:02:56,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:02:56,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904113125] [2025-02-05 10:02:56,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:02:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:02:56,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 10:02:56,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:02:56,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:02:56,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:02:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:02:56,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:02:56,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904113125] [2025-02-05 10:02:56,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904113125] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:02:56,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457945978] [2025-02-05 10:02:56,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:02:56,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:02:56,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:02:56,191 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 10:02:56,194 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 10:02:56,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 10:02:56,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:02:56,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:02:56,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:02:56,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:02:56,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:02:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:02:56,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:02:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:02:56,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457945978] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:02:56,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:02:56,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-05 10:02:56,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300670577] [2025-02-05 10:02:56,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:02:56,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 10:02:56,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:02:56,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 10:02:56,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:02:56,350 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:02:56,516 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2025-02-05 10:02:56,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 10:02:56,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-05 10:02:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:02:56,518 INFO L225 Difference]: With dead ends: 96 [2025-02-05 10:02:56,518 INFO L226 Difference]: Without dead ends: 72 [2025-02-05 10:02:56,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:02:56,520 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 86 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:02:56,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 54 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:02:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-05 10:02:56,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 39. [2025-02-05 10:02:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2025-02-05 10:02:56,525 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 21 [2025-02-05 10:02:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:02:56,526 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2025-02-05 10:02:56,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2025-02-05 10:02:56,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 10:02:56,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:02:56,526 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:02:56,532 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 10:02:56,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:02:56,727 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:02:56,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:02:56,728 INFO L85 PathProgramCache]: Analyzing trace with hash 105718869, now seen corresponding path program 2 times [2025-02-05 10:02:56,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:02:56,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94332121] [2025-02-05 10:02:56,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:02:56,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:02:56,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-05 10:02:56,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:02:56,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:02:56,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:02:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:02:56,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:02:56,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94332121] [2025-02-05 10:02:56,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94332121] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:02:56,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128875610] [2025-02-05 10:02:56,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:02:56,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:02:56,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:02:56,816 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 10:02:56,820 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 10:02:56,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-05 10:02:56,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:02:56,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:02:56,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:02:56,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:02:56,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:02:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 10:02:56,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:02:56,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128875610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:02:56,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:02:56,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:02:56,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47147126] [2025-02-05 10:02:56,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:02:56,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:02:56,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:02:56,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:02:56,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:02:56,903 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:02:56,911 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2025-02-05 10:02:56,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:02:56,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-05 10:02:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:02:56,912 INFO L225 Difference]: With dead ends: 52 [2025-02-05 10:02:56,912 INFO L226 Difference]: Without dead ends: 39 [2025-02-05 10:02:56,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:02:56,913 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:02:56,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 47 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:02:56,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-05 10:02:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-05 10:02:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-02-05 10:02:56,919 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 27 [2025-02-05 10:02:56,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:02:56,919 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-02-05 10:02:56,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2025-02-05 10:02:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 10:02:56,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:02:56,920 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:02:56,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:02:57,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:02:57,124 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:02:57,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:02:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash -207025745, now seen corresponding path program 1 times [2025-02-05 10:02:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:02:57,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157555652] [2025-02-05 10:02:57,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:02:57,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:02:57,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:02:57,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:02:57,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:02:57,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:02:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:02:57,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:02:57,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157555652] [2025-02-05 10:02:57,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157555652] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:02:57,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333000989] [2025-02-05 10:02:57,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:02:57,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:02:57,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:02:57,231 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 10:02:57,250 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 10:02:57,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:02:57,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:02:57,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:02:57,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:02:57,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 10:02:57,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:02:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:02:57,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:02:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:02:57,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333000989] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:02:57,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:02:57,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-02-05 10:02:57,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206568938] [2025-02-05 10:02:57,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:02:57,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 10:02:57,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:02:57,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 10:02:57,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:02:57,511 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:57,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:02:57,707 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2025-02-05 10:02:57,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:02:57,708 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-05 10:02:57,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:02:57,709 INFO L225 Difference]: With dead ends: 161 [2025-02-05 10:02:57,709 INFO L226 Difference]: Without dead ends: 129 [2025-02-05 10:02:57,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2025-02-05 10:02:57,710 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 266 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:02:57,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 79 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:02:57,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-05 10:02:57,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 45. [2025-02-05 10:02:57,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-02-05 10:02:57,719 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 27 [2025-02-05 10:02:57,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:02:57,719 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-02-05 10:02:57,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-02-05 10:02:57,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-05 10:02:57,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:02:57,720 INFO L218 NwaCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:02:57,727 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 10:02:57,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:02:57,921 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:02:57,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:02:57,922 INFO L85 PathProgramCache]: Analyzing trace with hash 333400015, now seen corresponding path program 2 times [2025-02-05 10:02:57,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:02:57,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904224061] [2025-02-05 10:02:57,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:02:57,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:02:57,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-05 10:02:57,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 10:02:57,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:02:57,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:02:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-05 10:02:58,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:02:58,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904224061] [2025-02-05 10:02:58,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904224061] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:02:58,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603670904] [2025-02-05 10:02:58,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:02:58,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:02:58,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:02:58,019 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 10:02:58,021 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 10:02:58,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-05 10:02:58,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 10:02:58,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:02:58,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:02:58,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 10:02:58,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:02:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:02:58,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:02:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:02:58,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603670904] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:02:58,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:02:58,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 27 [2025-02-05 10:02:58,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012449418] [2025-02-05 10:02:58,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:02:58,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 10:02:58,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:02:58,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 10:02:58,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=446, Unknown=0, NotChecked=0, Total=756 [2025-02-05 10:02:58,442 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:02:59,003 INFO L93 Difference]: Finished difference Result 306 states and 358 transitions. [2025-02-05 10:02:59,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-05 10:02:59,003 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-05 10:02:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:02:59,004 INFO L225 Difference]: With dead ends: 306 [2025-02-05 10:02:59,004 INFO L226 Difference]: Without dead ends: 274 [2025-02-05 10:02:59,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=602, Invalid=958, Unknown=0, NotChecked=0, Total=1560 [2025-02-05 10:02:59,005 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 675 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:02:59,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 136 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:02:59,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-05 10:02:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 62. [2025-02-05 10:02:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2025-02-05 10:02:59,026 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 33 [2025-02-05 10:02:59,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:02:59,027 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2025-02-05 10:02:59,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:02:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2025-02-05 10:02:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 10:02:59,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:02:59,027 INFO L218 NwaCegarLoop]: trace histogram [22, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:02:59,034 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 10:02:59,228 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,SelfDestructingSolverStorable8 [2025-02-05 10:02:59,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:02:59,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:02:59,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1437084891, now seen corresponding path program 1 times [2025-02-05 10:02:59,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:02:59,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862473570] [2025-02-05 10:02:59,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:02:59,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:02:59,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 10:02:59,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 10:02:59,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:02:59,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:02:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 10:02:59,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:02:59,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862473570] [2025-02-05 10:02:59,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862473570] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:02:59,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840095614] [2025-02-05 10:02:59,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:02:59,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:02:59,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:02:59,961 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 10:02:59,962 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 10:03:00,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 10:03:00,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 10:03:00,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:03:00,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:03:00,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 10:03:00,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:03:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 10:03:00,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:03:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 10:03:01,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840095614] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:03:01,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:03:01,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2025-02-05 10:03:01,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815383048] [2025-02-05 10:03:01,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:03:01,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-02-05 10:03:01,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:03:01,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-02-05 10:03:01,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=2949, Unknown=0, NotChecked=0, Total=5256 [2025-02-05 10:03:01,223 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 73 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 72 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:03:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:03:02,653 INFO L93 Difference]: Finished difference Result 567 states and 651 transitions. [2025-02-05 10:03:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-02-05 10:03:02,653 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 72 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-02-05 10:03:02,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:03:02,655 INFO L225 Difference]: With dead ends: 567 [2025-02-05 10:03:02,655 INFO L226 Difference]: Without dead ends: 530 [2025-02-05 10:03:02,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3480, Invalid=5640, Unknown=0, NotChecked=0, Total=9120 [2025-02-05 10:03:02,658 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 2115 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2115 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:03:02,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2115 Valid, 265 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:03:02,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-02-05 10:03:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 86. [2025-02-05 10:03:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 85 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:03:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2025-02-05 10:03:02,668 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 51 [2025-02-05 10:03:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:03:02,669 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2025-02-05 10:03:02,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 72 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:03:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2025-02-05 10:03:02,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 10:03:02,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:03:02,670 INFO L218 NwaCegarLoop]: trace histogram [46, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:03:02,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 10:03:02,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 10:03:02,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:03:02,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:03:02,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1907145637, now seen corresponding path program 2 times [2025-02-05 10:03:02,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:03:02,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229094996] [2025-02-05 10:03:02,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:03:02,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:03:02,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-05 10:03:02,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 10:03:02,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:03:02,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:03:04,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 10:03:04,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:03:04,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229094996] [2025-02-05 10:03:04,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229094996] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:03:04,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061443515] [2025-02-05 10:03:04,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:03:04,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:03:04,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:03:04,679 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 10:03:04,680 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 10:03:04,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-05 10:03:04,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 10:03:04,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:03:04,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:03:04,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-05 10:03:04,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:03:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 10:03:06,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:03:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 10:03:08,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061443515] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:03:08,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:03:08,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 144 [2025-02-05 10:03:08,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771500215] [2025-02-05 10:03:08,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:03:08,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 145 states [2025-02-05 10:03:08,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:03:08,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2025-02-05 10:03:08,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9219, Invalid=11661, Unknown=0, NotChecked=0, Total=20880 [2025-02-05 10:03:08,134 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 145 states, 145 states have (on average 1.1517241379310346) internal successors, (167), 144 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:03:13,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:03:13,936 INFO L93 Difference]: Finished difference Result 1095 states and 1251 transitions. [2025-02-05 10:03:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-02-05 10:03:13,936 INFO L78 Accepts]: Start accepts. Automaton has has 145 states, 145 states have (on average 1.1517241379310346) internal successors, (167), 144 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 10:03:13,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:03:13,939 INFO L225 Difference]: With dead ends: 1095 [2025-02-05 10:03:13,939 INFO L226 Difference]: Without dead ends: 1058 [2025-02-05 10:03:13,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13345 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=13872, Invalid=22800, Unknown=0, NotChecked=0, Total=36672 [2025-02-05 10:03:13,944 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4789 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 1024 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4789 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1024 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 10:03:13,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4789 Valid, 555 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1024 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 10:03:13,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-02-05 10:03:13,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 134. [2025-02-05 10:03:13,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.0676691729323309) internal successors, (142), 133 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:03:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2025-02-05 10:03:13,960 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 75 [2025-02-05 10:03:13,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:03:13,960 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2025-02-05 10:03:13,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 145 states, 145 states have (on average 1.1517241379310346) internal successors, (167), 144 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:03:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2025-02-05 10:03:13,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 10:03:13,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:03:13,962 INFO L218 NwaCegarLoop]: trace histogram [94, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:03:13,969 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 10:03:14,166 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,SelfDestructingSolverStorable10 [2025-02-05 10:03:14,166 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:03:14,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:03:14,167 INFO L85 PathProgramCache]: Analyzing trace with hash 581045413, now seen corresponding path program 3 times [2025-02-05 10:03:14,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:03:14,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731265059] [2025-02-05 10:03:14,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:03:14,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:03:14,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 123 statements into 48 equivalence classes. [2025-02-05 10:03:14,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 123 statements. [2025-02-05 10:03:14,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:03:14,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:03:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4479 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4472 trivial. 0 not checked. [2025-02-05 10:03:14,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:03:14,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731265059] [2025-02-05 10:03:14,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731265059] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:03:14,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893818214] [2025-02-05 10:03:14,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:03:14,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:03:14,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:03:14,272 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 10:03:14,274 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 10:03:14,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 123 statements into 48 equivalence classes. [2025-02-05 10:03:14,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 123 statements. [2025-02-05 10:03:14,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:03:14,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:03:14,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:03:14,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:03:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4479 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4472 trivial. 0 not checked. [2025-02-05 10:03:14,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:03:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4479 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4472 trivial. 0 not checked. [2025-02-05 10:03:14,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893818214] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:03:14,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:03:14,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2025-02-05 10:03:14,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419819527] [2025-02-05 10:03:14,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:03:14,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 10:03:14,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:03:14,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 10:03:14,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-02-05 10:03:14,784 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:03:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:03:15,051 INFO L93 Difference]: Finished difference Result 249 states and 279 transitions. [2025-02-05 10:03:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 10:03:15,051 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2025-02-05 10:03:15,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:03:15,054 INFO L225 Difference]: With dead ends: 249 [2025-02-05 10:03:15,054 INFO L226 Difference]: Without dead ends: 228 [2025-02-05 10:03:15,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=654, Unknown=0, NotChecked=0, Total=930 [2025-02-05 10:03:15,055 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 196 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:03:15,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 120 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:03:15,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-05 10:03:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 163. [2025-02-05 10:03:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.0987654320987654) internal successors, (178), 162 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:03:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2025-02-05 10:03:15,085 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 123 [2025-02-05 10:03:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:03:15,085 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2025-02-05 10:03:15,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:03:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2025-02-05 10:03:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 10:03:15,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:03:15,086 INFO L218 NwaCegarLoop]: trace histogram [94, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:03:15,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 10:03:15,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:03:15,287 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:03:15,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:03:15,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2083318528, now seen corresponding path program 1 times [2025-02-05 10:03:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:03:15,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506938433] [2025-02-05 10:03:15,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:03:15,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:03:15,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 10:03:15,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 10:03:15,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:03:15,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:03:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4499 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 10:03:20,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:03:20,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506938433] [2025-02-05 10:03:20,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506938433] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:03:20,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18098338] [2025-02-05 10:03:20,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:03:20,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:03:20,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:03:20,278 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 10:03:20,279 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 10:03:20,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 10:03:20,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 10:03:20,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:03:20,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:03:20,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 1667 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-02-05 10:03:20,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:03:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4499 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 10:03:24,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:03:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4499 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 10:03:32,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18098338] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:03:32,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:03:32,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 288 [2025-02-05 10:03:32,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025271682] [2025-02-05 10:03:32,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:03:32,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 289 states [2025-02-05 10:03:32,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:03:32,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 289 interpolants. [2025-02-05 10:03:32,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36867, Invalid=46365, Unknown=0, NotChecked=0, Total=83232 [2025-02-05 10:03:32,150 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 289 states, 289 states have (on average 1.0795847750865053) internal successors, (312), 288 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:04:22,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:04:22,817 INFO L93 Difference]: Finished difference Result 2196 states and 2506 transitions. [2025-02-05 10:04:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2025-02-05 10:04:22,818 INFO L78 Accepts]: Start accepts. Automaton has has 289 states, 289 states have (on average 1.0795847750865053) internal successors, (312), 288 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-02-05 10:04:22,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:04:22,823 INFO L225 Difference]: With dead ends: 2196 [2025-02-05 10:04:22,823 INFO L226 Difference]: Without dead ends: 2130 [2025-02-05 10:04:22,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54337 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=55392, Invalid=91680, Unknown=0, NotChecked=0, Total=147072 [2025-02-05 10:04:22,828 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 9067 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 2260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9067 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 3775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2260 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 10:04:22,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9067 Valid, 1031 Invalid, 3775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2260 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 10:04:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2025-02-05 10:04:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 259. [2025-02-05 10:04:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.062015503875969) internal successors, (274), 258 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:04:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 274 transitions. [2025-02-05 10:04:22,860 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 274 transitions. Word has length 133 [2025-02-05 10:04:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:04:22,861 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 274 transitions. [2025-02-05 10:04:22,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 289 states, 289 states have (on average 1.0795847750865053) internal successors, (312), 288 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:04:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 274 transitions. [2025-02-05 10:04:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-05 10:04:22,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:04:22,863 INFO L218 NwaCegarLoop]: trace histogram [190, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:04:22,871 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 10:04:23,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:04:23,067 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:04:23,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:04:23,068 INFO L85 PathProgramCache]: Analyzing trace with hash -938920192, now seen corresponding path program 2 times [2025-02-05 10:04:23,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:04:23,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407753492] [2025-02-05 10:04:23,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:04:23,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:04:23,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 229 statements into 2 equivalence classes. [2025-02-05 10:04:23,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 229 of 229 statements. [2025-02-05 10:04:23,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:04:23,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat