./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/bitvector/byte_add_1-1.i -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 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:46:31,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:46:32,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:46:32,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:46:32,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:46:32,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:46:32,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:46:32,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:46:32,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:46:32,051 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:46:32,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:46:32,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:46:32,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:46:32,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:46:32,052 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:46:32,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:46:32,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:46:32,053 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:46:32,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:46:32,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:46:32,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:46:32,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:46:32,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:46:32,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:46:32,053 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:46:32,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:46:32,053 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:46:32,053 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:46:32,053 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:46:32,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:46:32,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:46:32,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:46:32,054 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 -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2025-01-08 22:46:32,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:46:32,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:46:32,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:46:32,257 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:46:32,258 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:46:32,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2025-01-08 22:46:33,357 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26d4995e0/45649c504f08464bb6335617e95d22f0/FLAG06dc49324 [2025-01-08 22:46:33,584 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:46:33,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2025-01-08 22:46:33,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26d4995e0/45649c504f08464bb6335617e95d22f0/FLAG06dc49324 [2025-01-08 22:46:33,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26d4995e0/45649c504f08464bb6335617e95d22f0 [2025-01-08 22:46:33,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:46:33,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:46:33,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:46:33,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:46:33,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:46:33,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:46:33" (1/1) ... [2025-01-08 22:46:33,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e777f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:33, skipping insertion in model container [2025-01-08 22:46:33,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:46:33" (1/1) ... [2025-01-08 22:46:33,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:46:34,058 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/bitvector/byte_add_1-1.i[1168,1181] [2025-01-08 22:46:34,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:46:34,113 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:46:34,123 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/bitvector/byte_add_1-1.i[1168,1181] [2025-01-08 22:46:34,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:46:34,157 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:46:34,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:34 WrapperNode [2025-01-08 22:46:34,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:46:34,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:46:34,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:46:34,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:46:34,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:34" (1/1) ... [2025-01-08 22:46:34,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:34" (1/1) ... [2025-01-08 22:46:34,206 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2025-01-08 22:46:34,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:46:34,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:46:34,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:46:34,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:46:34,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:34" (1/1) ... [2025-01-08 22:46:34,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:34" (1/1) ... [2025-01-08 22:46:34,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:34" (1/1) ... [2025-01-08 22:46:34,228 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 22:46:34,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:34" (1/1) ... [2025-01-08 22:46:34,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:34" (1/1) ... [2025-01-08 22:46:34,235 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:34" (1/1) ... [2025-01-08 22:46:34,236 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:34" (1/1) ... [2025-01-08 22:46:34,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:34" (1/1) ... [2025-01-08 22:46:34,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:34" (1/1) ... [2025-01-08 22:46:34,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:34" (1/1) ... [2025-01-08 22:46:34,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:46:34,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:46:34,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:46:34,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:46:34,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:34" (1/1) ... [2025-01-08 22:46:34,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:46:34,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:34,270 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-01-08 22:46:34,272 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-01-08 22:46:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:46:34,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:46:34,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:46:34,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:46:34,338 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:46:34,339 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:46:34,606 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-01-08 22:46:34,606 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:46:34,612 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:46:34,612 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:46:34,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:46:34 BoogieIcfgContainer [2025-01-08 22:46:34,613 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:46:34,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:46:34,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:46:34,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:46:34,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:46:33" (1/3) ... [2025-01-08 22:46:34,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b4d1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:46:34, skipping insertion in model container [2025-01-08 22:46:34,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:34" (2/3) ... [2025-01-08 22:46:34,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b4d1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:46:34, skipping insertion in model container [2025-01-08 22:46:34,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:46:34" (3/3) ... [2025-01-08 22:46:34,619 INFO L128 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2025-01-08 22:46:34,629 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:46:34,631 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG byte_add_1-1.i that has 1 procedures, 51 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-08 22:46:34,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:46:34,676 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;@e2250ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:46:34,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:46:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 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-01-08 22:46:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-08 22:46:34,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:34,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:34,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:34,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:34,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1570190741, now seen corresponding path program 1 times [2025-01-08 22:46:34,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:34,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831812742] [2025-01-08 22:46:34,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:34,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:34,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-08 22:46:34,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-08 22:46:34,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:34,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:46:34,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:34,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831812742] [2025-01-08 22:46:34,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831812742] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:34,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:34,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:46:34,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117420544] [2025-01-08 22:46:34,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:34,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:46:34,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:34,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:46:34,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:46:34,951 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-01-08 22:46:35,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:35,057 INFO L93 Difference]: Finished difference Result 115 states and 196 transitions. [2025-01-08 22:46:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:46:35,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-01-08 22:46:35,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:35,063 INFO L225 Difference]: With dead ends: 115 [2025-01-08 22:46:35,063 INFO L226 Difference]: Without dead ends: 70 [2025-01-08 22:46:35,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-08 22:46:35,066 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 24 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:35,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 96 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-08 22:46:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-01-08 22:46:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 67 states have internal predecessors, (104), 0 states have call successors, (0), 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-01-08 22:46:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2025-01-08 22:46:35,091 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 15 [2025-01-08 22:46:35,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:35,091 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2025-01-08 22:46:35,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-01-08 22:46:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2025-01-08 22:46:35,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:46:35,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:35,092 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-01-08 22:46:35,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:46:35,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:35,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:35,093 INFO L85 PathProgramCache]: Analyzing trace with hash 2007922496, now seen corresponding path program 1 times [2025-01-08 22:46:35,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:35,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327942321] [2025-01-08 22:46:35,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:35,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:35,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:46:35,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:46:35,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:35,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:46:35,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:35,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327942321] [2025-01-08 22:46:35,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327942321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:35,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:35,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:46:35,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821939593] [2025-01-08 22:46:35,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:35,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:46:35,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:35,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:46:35,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:46:35,303 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:35,512 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2025-01-08 22:46:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:46:35,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-08 22:46:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:35,514 INFO L225 Difference]: With dead ends: 164 [2025-01-08 22:46:35,514 INFO L226 Difference]: Without dead ends: 127 [2025-01-08 22:46:35,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:46:35,515 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 92 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:35,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 116 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:46:35,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-08 22:46:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2025-01-08 22:46:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 90 states have internal predecessors, (139), 0 states have call successors, (0), 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-01-08 22:46:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2025-01-08 22:46:35,530 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 21 [2025-01-08 22:46:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:35,530 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2025-01-08 22:46:35,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2025-01-08 22:46:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:46:35,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:35,534 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:35,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:46:35,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:35,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:35,535 INFO L85 PathProgramCache]: Analyzing trace with hash -50508049, now seen corresponding path program 1 times [2025-01-08 22:46:35,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:35,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297420706] [2025-01-08 22:46:35,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:35,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:35,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:46:35,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:46:35,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:35,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:35,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:46:35,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:35,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297420706] [2025-01-08 22:46:35,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297420706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:35,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:35,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:46:35,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311693888] [2025-01-08 22:46:35,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:35,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:46:35,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:35,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:46:35,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:46:35,686 INFO L87 Difference]: Start difference. First operand 91 states and 139 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-01-08 22:46:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:35,815 INFO L93 Difference]: Finished difference Result 234 states and 354 transitions. [2025-01-08 22:46:35,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:46:35,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-01-08 22:46:35,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:35,817 INFO L225 Difference]: With dead ends: 234 [2025-01-08 22:46:35,817 INFO L226 Difference]: Without dead ends: 156 [2025-01-08 22:46:35,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:46:35,820 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 70 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:35,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 180 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-08 22:46:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 99. [2025-01-08 22:46:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.510204081632653) internal successors, (148), 98 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 148 transitions. [2025-01-08 22:46:35,829 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 148 transitions. Word has length 27 [2025-01-08 22:46:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:35,830 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 148 transitions. [2025-01-08 22:46:35,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-01-08 22:46:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 148 transitions. [2025-01-08 22:46:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:46:35,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:35,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:35,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:46:35,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:35,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:35,833 INFO L85 PathProgramCache]: Analyzing trace with hash -446870146, now seen corresponding path program 1 times [2025-01-08 22:46:35,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:35,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457832301] [2025-01-08 22:46:35,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:35,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:35,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:46:35,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:46:35,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:35,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:46:35,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:35,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457832301] [2025-01-08 22:46:35,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457832301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:35,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:35,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:46:35,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611772592] [2025-01-08 22:46:35,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:35,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:46:35,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:35,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:46:35,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:46:35,938 INFO L87 Difference]: Start difference. First operand 99 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-01-08 22:46:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:36,051 INFO L93 Difference]: Finished difference Result 255 states and 380 transitions. [2025-01-08 22:46:36,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:46:36,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 28 [2025-01-08 22:46:36,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:36,053 INFO L225 Difference]: With dead ends: 255 [2025-01-08 22:46:36,054 INFO L226 Difference]: Without dead ends: 176 [2025-01-08 22:46:36,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:46:36,054 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 74 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:36,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 188 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:36,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-08 22:46:36,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 109. [2025-01-08 22:46:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 108 states have internal predecessors, (161), 0 states have call successors, (0), 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-01-08 22:46:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2025-01-08 22:46:36,066 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 28 [2025-01-08 22:46:36,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:36,067 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2025-01-08 22:46:36,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-01-08 22:46:36,067 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2025-01-08 22:46:36,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:46:36,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:36,068 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:36,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:46:36,068 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:36,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:36,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1153653824, now seen corresponding path program 1 times [2025-01-08 22:46:36,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:36,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442870873] [2025-01-08 22:46:36,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:36,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:36,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:46:36,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:46:36,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:36,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:46:36,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:36,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442870873] [2025-01-08 22:46:36,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442870873] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:36,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193300441] [2025-01-08 22:46:36,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:36,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:36,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:36,174 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-01-08 22:46:36,176 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-01-08 22:46:36,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:46:36,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:46:36,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:36,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:36,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:46:36,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 22:46:36,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:46:36,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193300441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:36,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:46:36,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-08 22:46:36,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918851429] [2025-01-08 22:46:36,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:36,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:46:36,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:36,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:46:36,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:46:36,274 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-01-08 22:46:36,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:36,467 INFO L93 Difference]: Finished difference Result 345 states and 536 transitions. [2025-01-08 22:46:36,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:46:36,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 29 [2025-01-08 22:46:36,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:36,469 INFO L225 Difference]: With dead ends: 345 [2025-01-08 22:46:36,469 INFO L226 Difference]: Without dead ends: 263 [2025-01-08 22:46:36,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:46:36,470 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 100 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:36,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 321 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:46:36,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-08 22:46:36,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 239. [2025-01-08 22:46:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.495798319327731) internal successors, (356), 238 states have internal predecessors, (356), 0 states have call successors, (0), 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-01-08 22:46:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 356 transitions. [2025-01-08 22:46:36,487 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 356 transitions. Word has length 29 [2025-01-08 22:46:36,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:36,487 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 356 transitions. [2025-01-08 22:46:36,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-01-08 22:46:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 356 transitions. [2025-01-08 22:46:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:46:36,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:36,489 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:36,496 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-01-08 22:46:36,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:36,693 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:36,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:36,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1613924412, now seen corresponding path program 1 times [2025-01-08 22:46:36,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:36,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621473958] [2025-01-08 22:46:36,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:36,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:36,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:46:36,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:46:36,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:36,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:46:36,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621473958] [2025-01-08 22:46:36,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621473958] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196085571] [2025-01-08 22:46:36,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:36,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:36,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:36,784 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-01-08 22:46:36,786 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-01-08 22:46:36,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:46:36,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:46:36,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:36,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:36,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 22:46:36,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:46:36,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:46:36,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196085571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:36,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:46:36,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-01-08 22:46:36,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727760973] [2025-01-08 22:46:36,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:36,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:46:36,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:36,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:46:36,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:46:36,877 INFO L87 Difference]: Start difference. First operand 239 states and 356 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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-01-08 22:46:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:37,014 INFO L93 Difference]: Finished difference Result 577 states and 908 transitions. [2025-01-08 22:46:37,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:46:37,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 30 [2025-01-08 22:46:37,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:37,015 INFO L225 Difference]: With dead ends: 577 [2025-01-08 22:46:37,015 INFO L226 Difference]: Without dead ends: 350 [2025-01-08 22:46:37,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:46:37,018 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 37 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:37,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 151 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-01-08 22:46:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 308. [2025-01-08 22:46:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.4039087947882736) internal successors, (431), 307 states have internal predecessors, (431), 0 states have call successors, (0), 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-01-08 22:46:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 431 transitions. [2025-01-08 22:46:37,040 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 431 transitions. Word has length 30 [2025-01-08 22:46:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:37,040 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 431 transitions. [2025-01-08 22:46:37,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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-01-08 22:46:37,040 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 431 transitions. [2025-01-08 22:46:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-08 22:46:37,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:37,041 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:37,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:46:37,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:37,242 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:37,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:37,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2116862383, now seen corresponding path program 1 times [2025-01-08 22:46:37,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:37,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132380861] [2025-01-08 22:46:37,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:37,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:37,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-08 22:46:37,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-08 22:46:37,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:37,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:46:37,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:37,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132380861] [2025-01-08 22:46:37,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132380861] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:37,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563538410] [2025-01-08 22:46:37,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:37,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:37,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:37,377 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-01-08 22:46:37,379 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-01-08 22:46:37,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-08 22:46:37,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-08 22:46:37,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:37,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:37,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 22:46:37,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:46:37,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:46:37,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563538410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:37,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:46:37,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-08 22:46:37,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908207082] [2025-01-08 22:46:37,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:37,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:46:37,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:37,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:46:37,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:46:37,495 INFO L87 Difference]: Start difference. First operand 308 states and 431 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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-01-08 22:46:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:37,633 INFO L93 Difference]: Finished difference Result 718 states and 1042 transitions. [2025-01-08 22:46:37,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:46:37,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 36 [2025-01-08 22:46:37,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:37,635 INFO L225 Difference]: With dead ends: 718 [2025-01-08 22:46:37,636 INFO L226 Difference]: Without dead ends: 438 [2025-01-08 22:46:37,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:46:37,637 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:37,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 151 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-01-08 22:46:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 366. [2025-01-08 22:46:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 1.3726027397260274) internal successors, (501), 365 states have internal predecessors, (501), 0 states have call successors, (0), 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-01-08 22:46:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 501 transitions. [2025-01-08 22:46:37,654 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 501 transitions. Word has length 36 [2025-01-08 22:46:37,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:37,654 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 501 transitions. [2025-01-08 22:46:37,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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-01-08 22:46:37,654 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 501 transitions. [2025-01-08 22:46:37,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-08 22:46:37,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:37,655 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:37,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:46:37,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:37,856 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:37,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:37,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1354773150, now seen corresponding path program 1 times [2025-01-08 22:46:37,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:37,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852525137] [2025-01-08 22:46:37,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:37,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:37,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-08 22:46:37,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-08 22:46:37,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:37,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-08 22:46:37,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:37,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852525137] [2025-01-08 22:46:37,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852525137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:37,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:37,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:46:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053069661] [2025-01-08 22:46:37,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:37,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:46:37,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:37,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:46:37,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:46:37,997 INFO L87 Difference]: Start difference. First operand 366 states and 501 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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-01-08 22:46:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:38,008 INFO L93 Difference]: Finished difference Result 699 states and 956 transitions. [2025-01-08 22:46:38,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:46:38,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 42 [2025-01-08 22:46:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:38,010 INFO L225 Difference]: With dead ends: 699 [2025-01-08 22:46:38,010 INFO L226 Difference]: Without dead ends: 349 [2025-01-08 22:46:38,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:46:38,011 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 69 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:38,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:46:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-01-08 22:46:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2025-01-08 22:46:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.3620689655172413) internal successors, (474), 348 states have internal predecessors, (474), 0 states have call successors, (0), 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-01-08 22:46:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 474 transitions. [2025-01-08 22:46:38,021 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 474 transitions. Word has length 42 [2025-01-08 22:46:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:38,021 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 474 transitions. [2025-01-08 22:46:38,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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-01-08 22:46:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 474 transitions. [2025-01-08 22:46:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-08 22:46:38,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:38,023 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:38,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:46:38,023 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:38,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:38,024 INFO L85 PathProgramCache]: Analyzing trace with hash -115215, now seen corresponding path program 1 times [2025-01-08 22:46:38,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:38,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116729583] [2025-01-08 22:46:38,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:38,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:38,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:46:38,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:46:38,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:38,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:46:38,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:38,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116729583] [2025-01-08 22:46:38,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116729583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:38,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:38,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:46:38,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928117700] [2025-01-08 22:46:38,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:38,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:46:38,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:38,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:46:38,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:46:38,111 INFO L87 Difference]: Start difference. First operand 349 states and 474 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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-01-08 22:46:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:38,124 INFO L93 Difference]: Finished difference Result 493 states and 655 transitions. [2025-01-08 22:46:38,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:46:38,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 48 [2025-01-08 22:46:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:38,126 INFO L225 Difference]: With dead ends: 493 [2025-01-08 22:46:38,126 INFO L226 Difference]: Without dead ends: 446 [2025-01-08 22:46:38,126 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-01-08 22:46:38,126 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:38,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:46:38,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-01-08 22:46:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 434. [2025-01-08 22:46:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 1.3233256351039262) internal successors, (573), 433 states have internal predecessors, (573), 0 states have call successors, (0), 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-01-08 22:46:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 573 transitions. [2025-01-08 22:46:38,137 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 573 transitions. Word has length 48 [2025-01-08 22:46:38,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:38,137 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 573 transitions. [2025-01-08 22:46:38,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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-01-08 22:46:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 573 transitions. [2025-01-08 22:46:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-08 22:46:38,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:38,138 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:38,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:46:38,138 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:38,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:38,139 INFO L85 PathProgramCache]: Analyzing trace with hash -72501773, now seen corresponding path program 1 times [2025-01-08 22:46:38,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:38,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144397529] [2025-01-08 22:46:38,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:38,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:38,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:46:38,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:46:38,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:38,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:46:38,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:38,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144397529] [2025-01-08 22:46:38,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144397529] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:38,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403546846] [2025-01-08 22:46:38,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:38,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:38,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:38,251 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-01-08 22:46:38,253 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-01-08 22:46:38,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:46:38,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:46:38,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:38,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:38,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-08 22:46:38,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:46:38,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:46:38,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403546846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:38,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:46:38,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2025-01-08 22:46:38,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114569877] [2025-01-08 22:46:38,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:38,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:46:38,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:38,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:46:38,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:46:38,330 INFO L87 Difference]: Start difference. First operand 434 states and 573 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-01-08 22:46:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:38,392 INFO L93 Difference]: Finished difference Result 977 states and 1300 transitions. [2025-01-08 22:46:38,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:46:38,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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 48 [2025-01-08 22:46:38,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:38,394 INFO L225 Difference]: With dead ends: 977 [2025-01-08 22:46:38,394 INFO L226 Difference]: Without dead ends: 476 [2025-01-08 22:46:38,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:46:38,395 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:38,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 107 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:46:38,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-01-08 22:46:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 386. [2025-01-08 22:46:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.2883116883116883) internal successors, (496), 385 states have internal predecessors, (496), 0 states have call successors, (0), 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-01-08 22:46:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 496 transitions. [2025-01-08 22:46:38,431 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 496 transitions. Word has length 48 [2025-01-08 22:46:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:38,431 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 496 transitions. [2025-01-08 22:46:38,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-01-08 22:46:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 496 transitions. [2025-01-08 22:46:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-08 22:46:38,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:38,432 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:38,437 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-01-08 22:46:38,632 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,SelfDestructingSolverStorable9 [2025-01-08 22:46:38,632 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:38,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:38,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2030666274, now seen corresponding path program 1 times [2025-01-08 22:46:38,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:38,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870186007] [2025-01-08 22:46:38,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:38,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:38,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-08 22:46:38,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-08 22:46:38,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:38,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-08 22:46:38,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:38,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870186007] [2025-01-08 22:46:38,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870186007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:38,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:38,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:46:38,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000482344] [2025-01-08 22:46:38,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:38,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:46:38,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:38,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:46:38,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:46:38,811 INFO L87 Difference]: Start difference. First operand 386 states and 496 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:38,895 INFO L93 Difference]: Finished difference Result 1208 states and 1537 transitions. [2025-01-08 22:46:38,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:46:38,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-08 22:46:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:38,898 INFO L225 Difference]: With dead ends: 1208 [2025-01-08 22:46:38,898 INFO L226 Difference]: Without dead ends: 841 [2025-01-08 22:46:38,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:46:38,899 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 155 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:38,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 211 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-01-08 22:46:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 584. [2025-01-08 22:46:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 583 states have (on average 1.2795883361921099) internal successors, (746), 583 states have internal predecessors, (746), 0 states have call successors, (0), 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-01-08 22:46:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 746 transitions. [2025-01-08 22:46:38,918 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 746 transitions. Word has length 69 [2025-01-08 22:46:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:38,918 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 746 transitions. [2025-01-08 22:46:38,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 746 transitions. [2025-01-08 22:46:38,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-08 22:46:38,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:38,919 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:38,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:46:38,919 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:38,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:38,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1240473636, now seen corresponding path program 1 times [2025-01-08 22:46:38,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:38,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53583243] [2025-01-08 22:46:38,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:38,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:38,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-08 22:46:38,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-08 22:46:38,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:38,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:39,082 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-08 22:46:39,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:39,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53583243] [2025-01-08 22:46:39,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53583243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:39,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:39,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:46:39,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326523764] [2025-01-08 22:46:39,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:39,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:46:39,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:39,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:46:39,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:46:39,083 INFO L87 Difference]: Start difference. First operand 584 states and 746 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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-01-08 22:46:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:39,346 INFO L93 Difference]: Finished difference Result 1060 states and 1347 transitions. [2025-01-08 22:46:39,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:46:39,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-08 22:46:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:39,349 INFO L225 Difference]: With dead ends: 1060 [2025-01-08 22:46:39,349 INFO L226 Difference]: Without dead ends: 845 [2025-01-08 22:46:39,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:46:39,350 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 188 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:39,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 349 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:46:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-01-08 22:46:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 592. [2025-01-08 22:46:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 1.27580372250423) internal successors, (754), 591 states have internal predecessors, (754), 0 states have call successors, (0), 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-01-08 22:46:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 754 transitions. [2025-01-08 22:46:39,367 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 754 transitions. Word has length 69 [2025-01-08 22:46:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:39,367 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 754 transitions. [2025-01-08 22:46:39,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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-01-08 22:46:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 754 transitions. [2025-01-08 22:46:39,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-08 22:46:39,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:39,368 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:39,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:46:39,368 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:39,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:39,369 INFO L85 PathProgramCache]: Analyzing trace with hash -823077030, now seen corresponding path program 1 times [2025-01-08 22:46:39,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:39,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523546028] [2025-01-08 22:46:39,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:39,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:39,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-08 22:46:39,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-08 22:46:39,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:39,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 22:46:39,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:39,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523546028] [2025-01-08 22:46:39,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523546028] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:39,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784590022] [2025-01-08 22:46:39,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:39,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:39,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:39,599 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-01-08 22:46:39,601 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-01-08 22:46:39,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-08 22:46:39,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-08 22:46:39,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:39,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:39,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-08 22:46:39,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-08 22:46:39,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:46:39,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784590022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:39,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:46:39,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-01-08 22:46:39,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676925233] [2025-01-08 22:46:39,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:39,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:46:39,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:39,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:46:39,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:46:39,772 INFO L87 Difference]: Start difference. First operand 592 states and 754 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 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-01-08 22:46:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:39,933 INFO L93 Difference]: Finished difference Result 992 states and 1269 transitions. [2025-01-08 22:46:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:46:39,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-08 22:46:39,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:39,935 INFO L225 Difference]: With dead ends: 992 [2025-01-08 22:46:39,935 INFO L226 Difference]: Without dead ends: 770 [2025-01-08 22:46:39,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:46:39,936 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 135 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:39,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 559 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:39,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-01-08 22:46:39,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 752. [2025-01-08 22:46:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 751 states have (on average 1.2663115845539281) internal successors, (951), 751 states have internal predecessors, (951), 0 states have call successors, (0), 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-01-08 22:46:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 951 transitions. [2025-01-08 22:46:39,953 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 951 transitions. Word has length 69 [2025-01-08 22:46:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:39,953 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 951 transitions. [2025-01-08 22:46:39,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 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-01-08 22:46:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 951 transitions. [2025-01-08 22:46:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-08 22:46:39,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:39,955 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:39,960 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-01-08 22:46:40,157 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,SelfDestructingSolverStorable12 [2025-01-08 22:46:40,157 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:40,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:40,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2053829486, now seen corresponding path program 1 times [2025-01-08 22:46:40,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:40,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424248410] [2025-01-08 22:46:40,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:40,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:40,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:46:40,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:46:40,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:40,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-08 22:46:40,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:40,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424248410] [2025-01-08 22:46:40,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424248410] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:40,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553383433] [2025-01-08 22:46:40,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:40,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:40,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:40,319 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-01-08 22:46:40,328 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-01-08 22:46:40,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:46:40,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:46:40,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:40,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:40,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-08 22:46:40,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:40,547 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-08 22:46:40,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:46:40,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553383433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:40,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:46:40,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2025-01-08 22:46:40,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709818952] [2025-01-08 22:46:40,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:40,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:46:40,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:40,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:46:40,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:46:40,551 INFO L87 Difference]: Start difference. First operand 752 states and 951 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-08 22:46:40,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:40,703 INFO L93 Difference]: Finished difference Result 967 states and 1229 transitions. [2025-01-08 22:46:40,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:46:40,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-08 22:46:40,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:40,706 INFO L225 Difference]: With dead ends: 967 [2025-01-08 22:46:40,706 INFO L226 Difference]: Without dead ends: 752 [2025-01-08 22:46:40,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:46:40,707 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 95 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:40,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 387 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:40,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-01-08 22:46:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 749. [2025-01-08 22:46:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 748 states have (on average 1.2647058823529411) internal successors, (946), 748 states have internal predecessors, (946), 0 states have call successors, (0), 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-01-08 22:46:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 946 transitions. [2025-01-08 22:46:40,725 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 946 transitions. Word has length 73 [2025-01-08 22:46:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:40,725 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 946 transitions. [2025-01-08 22:46:40,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-08 22:46:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 946 transitions. [2025-01-08 22:46:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-08 22:46:40,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:40,729 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:40,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-08 22:46:40,930 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,SelfDestructingSolverStorable13 [2025-01-08 22:46:40,930 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:40,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash -837675760, now seen corresponding path program 1 times [2025-01-08 22:46:40,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:40,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255411361] [2025-01-08 22:46:40,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:40,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:40,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:46:40,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:46:40,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:40,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:46:41,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:41,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255411361] [2025-01-08 22:46:41,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255411361] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:41,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463693362] [2025-01-08 22:46:41,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:41,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:41,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:41,181 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-01-08 22:46:41,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-08 22:46:41,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:46:41,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:46:41,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:41,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:41,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-08 22:46:41,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:46:41,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:46:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:46:41,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463693362] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:46:41,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:46:41,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-08 22:46:41,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769366134] [2025-01-08 22:46:41,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:46:41,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-08 22:46:41,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:41,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-08 22:46:41,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:46:41,629 INFO L87 Difference]: Start difference. First operand 749 states and 946 transitions. Second operand has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 0 states have call successors, (0), 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-01-08 22:46:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:42,018 INFO L93 Difference]: Finished difference Result 1655 states and 2072 transitions. [2025-01-08 22:46:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-08 22:46:42,022 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-08 22:46:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:42,025 INFO L225 Difference]: With dead ends: 1655 [2025-01-08 22:46:42,025 INFO L226 Difference]: Without dead ends: 933 [2025-01-08 22:46:42,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:46:42,028 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 390 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:42,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 568 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:46:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-01-08 22:46:42,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 637. [2025-01-08 22:46:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 636 states have (on average 1.251572327044025) internal successors, (796), 636 states have internal predecessors, (796), 0 states have call successors, (0), 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-01-08 22:46:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 796 transitions. [2025-01-08 22:46:42,047 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 796 transitions. Word has length 73 [2025-01-08 22:46:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:42,048 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 796 transitions. [2025-01-08 22:46:42,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 0 states have call successors, (0), 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-01-08 22:46:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 796 transitions. [2025-01-08 22:46:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-08 22:46:42,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:42,049 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:42,055 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-01-08 22:46:42,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:42,254 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:42,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash -923502128, now seen corresponding path program 2 times [2025-01-08 22:46:42,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:42,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431847776] [2025-01-08 22:46:42,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:46:42,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:42,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-01-08 22:46:42,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:46:42,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:46:42,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:46:42,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:42,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431847776] [2025-01-08 22:46:42,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431847776] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:42,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649367228] [2025-01-08 22:46:42,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:46:42,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:42,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:42,834 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-01-08 22:46:42,835 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-01-08 22:46:42,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-01-08 22:46:42,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:46:42,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:46:42,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:42,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-08 22:46:42,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:46:43,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:46:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:46:43,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649367228] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:46:43,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:46:43,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2025-01-08 22:46:43,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116081283] [2025-01-08 22:46:43,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:46:43,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-08 22:46:43,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:43,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-08 22:46:43,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-01-08 22:46:43,970 INFO L87 Difference]: Start difference. First operand 637 states and 796 transitions. Second operand has 22 states, 22 states have (on average 7.5) internal successors, (165), 22 states have internal predecessors, (165), 0 states have call successors, (0), 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-01-08 22:46:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:46,330 INFO L93 Difference]: Finished difference Result 2993 states and 3664 transitions. [2025-01-08 22:46:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-01-08 22:46:46,330 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.5) internal successors, (165), 22 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-08 22:46:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:46,339 INFO L225 Difference]: With dead ends: 2993 [2025-01-08 22:46:46,339 INFO L226 Difference]: Without dead ends: 2982 [2025-01-08 22:46:46,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=696, Invalid=3336, Unknown=0, NotChecked=0, Total=4032 [2025-01-08 22:46:46,342 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 326 mSDsluCounter, 2188 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:46,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 2417 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 22:46:46,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2025-01-08 22:46:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 1080. [2025-01-08 22:46:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1079 states have (on average 1.2715477293790547) internal successors, (1372), 1079 states have internal predecessors, (1372), 0 states have call successors, (0), 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-01-08 22:46:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1372 transitions. [2025-01-08 22:46:46,381 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1372 transitions. Word has length 73 [2025-01-08 22:46:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:46,381 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1372 transitions. [2025-01-08 22:46:46,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.5) internal successors, (165), 22 states have internal predecessors, (165), 0 states have call successors, (0), 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-01-08 22:46:46,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1372 transitions. [2025-01-08 22:46:46,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-08 22:46:46,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:46,383 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:46,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-08 22:46:46,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-08 22:46:46,584 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:46,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:46,585 INFO L85 PathProgramCache]: Analyzing trace with hash -47483122, now seen corresponding path program 1 times [2025-01-08 22:46:46,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:46,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728921875] [2025-01-08 22:46:46,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:46,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:46,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:46:46,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:46:46,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:46,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:46:47,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:47,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728921875] [2025-01-08 22:46:47,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728921875] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:47,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226357687] [2025-01-08 22:46:47,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:47,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:47,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:47,078 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:46:47,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-08 22:46:47,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:46:47,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:46:47,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:47,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:47,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-08 22:46:47,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:46:47,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:46:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:46:47,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226357687] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:46:47,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:46:47,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-01-08 22:46:47,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001385940] [2025-01-08 22:46:47,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:46:47,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-08 22:46:47,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:47,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-08 22:46:47,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-01-08 22:46:47,563 INFO L87 Difference]: Start difference. First operand 1080 states and 1372 transitions. Second operand has 20 states, 20 states have (on average 9.15) internal successors, (183), 20 states have internal predecessors, (183), 0 states have call successors, (0), 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-01-08 22:46:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:50,021 INFO L93 Difference]: Finished difference Result 2519 states and 3130 transitions. [2025-01-08 22:46:50,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-01-08 22:46:50,022 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.15) internal successors, (183), 20 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-08 22:46:50,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:50,030 INFO L225 Difference]: With dead ends: 2519 [2025-01-08 22:46:50,030 INFO L226 Difference]: Without dead ends: 2507 [2025-01-08 22:46:50,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2441 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1447, Invalid=6743, Unknown=0, NotChecked=0, Total=8190 [2025-01-08 22:46:50,035 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 521 mSDsluCounter, 1910 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:50,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2131 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 22:46:50,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2025-01-08 22:46:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1438. [2025-01-08 22:46:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1437 states have (on average 1.2881002087682671) internal successors, (1851), 1437 states have internal predecessors, (1851), 0 states have call successors, (0), 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-01-08 22:46:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1851 transitions. [2025-01-08 22:46:50,109 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1851 transitions. Word has length 73 [2025-01-08 22:46:50,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:50,110 INFO L471 AbstractCegarLoop]: Abstraction has 1438 states and 1851 transitions. [2025-01-08 22:46:50,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.15) internal successors, (183), 20 states have internal predecessors, (183), 0 states have call successors, (0), 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-01-08 22:46:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1851 transitions. [2025-01-08 22:46:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-08 22:46:50,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:50,111 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:50,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-08 22:46:50,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:50,312 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:50,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:50,313 INFO L85 PathProgramCache]: Analyzing trace with hash 249424875, now seen corresponding path program 1 times [2025-01-08 22:46:50,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:50,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588497898] [2025-01-08 22:46:50,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:50,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:50,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-08 22:46:50,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-08 22:46:50,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:50,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:46:50,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:50,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588497898] [2025-01-08 22:46:50,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588497898] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:50,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241182108] [2025-01-08 22:46:50,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:50,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:50,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:50,671 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:46:50,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-08 22:46:50,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-08 22:46:51,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-08 22:46:51,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:51,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:51,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:46:51,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-08 22:46:51,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:46:51,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241182108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:51,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:46:51,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-01-08 22:46:51,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823206167] [2025-01-08 22:46:51,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:51,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:46:51,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:51,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:46:51,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:46:51,360 INFO L87 Difference]: Start difference. First operand 1438 states and 1851 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:51,465 INFO L93 Difference]: Finished difference Result 1454 states and 1871 transitions. [2025-01-08 22:46:51,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:46:51,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-08 22:46:51,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:51,469 INFO L225 Difference]: With dead ends: 1454 [2025-01-08 22:46:51,469 INFO L226 Difference]: Without dead ends: 1449 [2025-01-08 22:46:51,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:46:51,470 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:51,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 212 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:46:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2025-01-08 22:46:51,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1440. [2025-01-08 22:46:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1439 states have (on average 1.2890896455872134) internal successors, (1855), 1439 states have internal predecessors, (1855), 0 states have call successors, (0), 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-01-08 22:46:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1855 transitions. [2025-01-08 22:46:51,514 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1855 transitions. Word has length 75 [2025-01-08 22:46:51,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:51,515 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 1855 transitions. [2025-01-08 22:46:51,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:51,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1855 transitions. [2025-01-08 22:46:51,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-08 22:46:51,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:51,517 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:51,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-08 22:46:51,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-08 22:46:51,718 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:51,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:51,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2066102335, now seen corresponding path program 1 times [2025-01-08 22:46:51,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:51,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79467057] [2025-01-08 22:46:51,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:51,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:51,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-08 22:46:51,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-08 22:46:51,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:51,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:46:51,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:51,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79467057] [2025-01-08 22:46:51,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79467057] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:51,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056864634] [2025-01-08 22:46:51,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:51,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:51,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:51,896 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:46:51,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-08 22:46:51,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-08 22:46:52,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-08 22:46:52,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:52,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:52,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-08 22:46:52,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:46:52,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:46:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:46:52,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056864634] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:46:52,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:46:52,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-01-08 22:46:52,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717912096] [2025-01-08 22:46:52,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:46:52,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-08 22:46:52,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:52,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-08 22:46:52,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:46:52,688 INFO L87 Difference]: Start difference. First operand 1440 states and 1855 transitions. Second operand has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 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-01-08 22:46:54,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:54,195 INFO L93 Difference]: Finished difference Result 7616 states and 9713 transitions. [2025-01-08 22:46:54,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-01-08 22:46:54,196 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 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 76 [2025-01-08 22:46:54,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:54,211 INFO L225 Difference]: With dead ends: 7616 [2025-01-08 22:46:54,211 INFO L226 Difference]: Without dead ends: 7611 [2025-01-08 22:46:54,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=799, Invalid=2861, Unknown=0, NotChecked=0, Total=3660 [2025-01-08 22:46:54,213 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 787 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:54,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1520 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:46:54,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7611 states. [2025-01-08 22:46:54,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7611 to 2307. [2025-01-08 22:46:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.357762359063313) internal successors, (3131), 2306 states have internal predecessors, (3131), 0 states have call successors, (0), 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-01-08 22:46:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3131 transitions. [2025-01-08 22:46:54,295 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3131 transitions. Word has length 76 [2025-01-08 22:46:54,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:54,295 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3131 transitions. [2025-01-08 22:46:54,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 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-01-08 22:46:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3131 transitions. [2025-01-08 22:46:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-08 22:46:54,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:54,297 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:54,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-08 22:46:54,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:54,501 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:54,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:54,502 INFO L85 PathProgramCache]: Analyzing trace with hash 886489506, now seen corresponding path program 1 times [2025-01-08 22:46:54,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:54,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390021465] [2025-01-08 22:46:54,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:54,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:54,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-08 22:46:54,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-08 22:46:54,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:54,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:46:54,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:54,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390021465] [2025-01-08 22:46:54,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390021465] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:54,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348216908] [2025-01-08 22:46:54,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:54,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:54,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:54,653 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:46:54,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-08 22:46:54,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-08 22:46:55,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-08 22:46:55,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:55,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:55,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-08 22:46:55,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:55,576 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-08 22:46:55,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:46:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:46:55,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348216908] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:46:55,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:46:55,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 10] total 17 [2025-01-08 22:46:55,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281374714] [2025-01-08 22:46:55,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:46:55,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-08 22:46:55,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:55,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-08 22:46:55,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:46:55,782 INFO L87 Difference]: Start difference. First operand 2307 states and 3131 transitions. Second operand has 17 states, 17 states have (on average 8.470588235294118) internal successors, (144), 17 states have internal predecessors, (144), 0 states have call successors, (0), 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-01-08 22:46:56,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:56,876 INFO L93 Difference]: Finished difference Result 6202 states and 8373 transitions. [2025-01-08 22:46:56,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-08 22:46:56,880 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.470588235294118) internal successors, (144), 17 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-08 22:46:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:56,888 INFO L225 Difference]: With dead ends: 6202 [2025-01-08 22:46:56,889 INFO L226 Difference]: Without dead ends: 4407 [2025-01-08 22:46:56,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=544, Invalid=1808, Unknown=0, NotChecked=0, Total=2352 [2025-01-08 22:46:56,892 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 500 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:56,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1102 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:46:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4407 states. [2025-01-08 22:46:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4407 to 2281. [2025-01-08 22:46:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 2280 states have (on average 1.374122807017544) internal successors, (3133), 2280 states have internal predecessors, (3133), 0 states have call successors, (0), 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-01-08 22:46:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3133 transitions. [2025-01-08 22:46:56,979 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3133 transitions. Word has length 77 [2025-01-08 22:46:56,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:56,980 INFO L471 AbstractCegarLoop]: Abstraction has 2281 states and 3133 transitions. [2025-01-08 22:46:56,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.470588235294118) internal successors, (144), 17 states have internal predecessors, (144), 0 states have call successors, (0), 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-01-08 22:46:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3133 transitions. [2025-01-08 22:46:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-08 22:46:56,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:56,981 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:56,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-08 22:46:57,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:57,183 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:57,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:57,183 INFO L85 PathProgramCache]: Analyzing trace with hash 430686000, now seen corresponding path program 1 times [2025-01-08 22:46:57,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:57,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285556397] [2025-01-08 22:46:57,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:57,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:57,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-08 22:46:57,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-08 22:46:57,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:57,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:46:57,219 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-08 22:46:57,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-08 22:46:57,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-08 22:46:57,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:57,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:46:57,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-08 22:46:57,278 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-08 22:46:57,279 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:46:57,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 22:46:57,282 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:57,337 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:46:57,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:46:57 BoogieIcfgContainer [2025-01-08 22:46:57,339 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:46:57,339 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:46:57,339 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:46:57,339 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:46:57,344 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:46:34" (3/4) ... [2025-01-08 22:46:57,345 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-08 22:46:57,346 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:46:57,346 INFO L158 Benchmark]: Toolchain (without parser) took 23412.58ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 123.2MB in the beginning and 536.7MB in the end (delta: -413.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2025-01-08 22:46:57,346 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:46:57,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.40ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 109.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:46:57,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.11ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 107.0MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:46:57,346 INFO L158 Benchmark]: Boogie Preprocessor took 34.98ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 104.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:46:57,347 INFO L158 Benchmark]: RCFGBuilder took 370.60ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 83.2MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:46:57,347 INFO L158 Benchmark]: TraceAbstraction took 22724.86ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 82.5MB in the beginning and 536.8MB in the end (delta: -454.3MB). Peak memory consumption was 302.4MB. Max. memory is 16.1GB. [2025-01-08 22:46:57,347 INFO L158 Benchmark]: Witness Printer took 6.32ms. Allocated memory is still 587.2MB. Free memory was 536.8MB in the beginning and 536.7MB in the end (delta: 123.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:46:57,348 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.78ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.40ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 109.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.11ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 107.0MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.98ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 104.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 370.60ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 83.2MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 22724.86ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 82.5MB in the beginning and 536.8MB in the end (delta: -454.3MB). Peak memory consumption was 302.4MB. Max. memory is 16.1GB. * Witness Printer took 6.32ms. Allocated memory is still 587.2MB. Free memory was 536.8MB in the beginning and 536.7MB in the end (delta: 123.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116, overapproximation of bitwiseOr at line 116. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4] [L68] nb = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=1, na=4, nb=1, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 [L85] partial_sum = partial_sum + a1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L89] COND FALSE !(i < nb) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L86] COND TRUE i == (unsigned char)2 [L86] partial_sum = partial_sum + a2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L89] COND FALSE !(i < nb) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L87] COND TRUE i == (unsigned char)3 [L87] partial_sum = partial_sum + a3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L89] COND FALSE !(i < nb) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, r0=0, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=4, na=4, nb=1, r0=0, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, i=4, r0=0, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\result=218103808, a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0] [L130] RET, EXPR mp_add(a, b) [L130] r = mp_add(a, b) [L132] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3641 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3641 mSDsluCounter, 10983 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8827 mSDsCounter, 240 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6428 IncrementalHoareTripleChecker+Invalid, 6668 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 240 mSolverCounterUnsat, 2156 mSDtfsCounter, 6428 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1443 GetRequests, 1081 SyntacticMatches, 7 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5108 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2307occurred in iteration=19, InterpolantAutomatonStates: 297, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 11639 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1860 NumberOfCodeBlocks, 1860 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2118 ConstructedInterpolants, 9 QuantifiedInterpolants, 11843 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2087 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 37 InterpolantComputations, 15 PerfectInterpolantSequences, 1377/2095 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-08 22:46:57,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/byte_add_1-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:46:59,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:46:59,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-08 22:46:59,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:46:59,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:46:59,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:46:59,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:46:59,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:46:59,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:46:59,482 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:46:59,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:46:59,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:46:59,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:46:59,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:46:59,483 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:46:59,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:46:59,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:46:59,483 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:46:59,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:46:59,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:46:59,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:46:59,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:46:59,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:46:59,484 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-08 22:46:59,484 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-08 22:46:59,484 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-08 22:46:59,484 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:46:59,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:46:59,485 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:46:59,485 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:46:59,485 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:46:59,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:46:59,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:46:59,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:46:59,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:46:59,486 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 -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2025-01-08 22:46:59,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:46:59,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:46:59,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:46:59,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:46:59,731 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:46:59,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2025-01-08 22:47:00,923 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b77797cb6/a95e5e6d6dcd4e99980b07f484acf356/FLAGadccfa35f [2025-01-08 22:47:01,132 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:47:01,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2025-01-08 22:47:01,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b77797cb6/a95e5e6d6dcd4e99980b07f484acf356/FLAGadccfa35f [2025-01-08 22:47:01,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b77797cb6/a95e5e6d6dcd4e99980b07f484acf356 [2025-01-08 22:47:01,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:47:01,491 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:47:01,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:47:01,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:47:01,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:47:01,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:47:01" (1/1) ... [2025-01-08 22:47:01,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6804fd5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01, skipping insertion in model container [2025-01-08 22:47:01,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:47:01" (1/1) ... [2025-01-08 22:47:01,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:47:01,593 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/bitvector/byte_add_1-1.i[1168,1181] [2025-01-08 22:47:01,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:47:01,629 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:47:01,637 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/bitvector/byte_add_1-1.i[1168,1181] [2025-01-08 22:47:01,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:47:01,673 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:47:01,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01 WrapperNode [2025-01-08 22:47:01,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:47:01,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:47:01,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:47:01,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:47:01,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01" (1/1) ... [2025-01-08 22:47:01,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01" (1/1) ... [2025-01-08 22:47:01,703 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2025-01-08 22:47:01,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:47:01,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:47:01,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:47:01,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:47:01,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01" (1/1) ... [2025-01-08 22:47:01,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01" (1/1) ... [2025-01-08 22:47:01,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01" (1/1) ... [2025-01-08 22:47:01,723 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 22:47:01,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01" (1/1) ... [2025-01-08 22:47:01,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01" (1/1) ... [2025-01-08 22:47:01,729 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01" (1/1) ... [2025-01-08 22:47:01,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01" (1/1) ... [2025-01-08 22:47:01,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01" (1/1) ... [2025-01-08 22:47:01,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01" (1/1) ... [2025-01-08 22:47:01,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01" (1/1) ... [2025-01-08 22:47:01,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:47:01,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:47:01,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:47:01,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:47:01,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01" (1/1) ... [2025-01-08 22:47:01,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:47:01,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:01,774 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-01-08 22:47:01,782 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-01-08 22:47:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:47:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-08 22:47:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:47:01,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:47:01,851 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:47:01,852 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:47:02,074 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-08 22:47:02,075 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:47:02,083 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:47:02,083 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:47:02,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:47:02 BoogieIcfgContainer [2025-01-08 22:47:02,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:47:02,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:47:02,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:47:02,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:47:02,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:47:01" (1/3) ... [2025-01-08 22:47:02,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b535ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:47:02, skipping insertion in model container [2025-01-08 22:47:02,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:01" (2/3) ... [2025-01-08 22:47:02,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b535ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:47:02, skipping insertion in model container [2025-01-08 22:47:02,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:47:02" (3/3) ... [2025-01-08 22:47:02,093 INFO L128 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2025-01-08 22:47:02,102 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:47:02,103 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG byte_add_1-1.i that has 1 procedures, 41 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-08 22:47:02,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:47:02,145 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;@359a1d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:47:02,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:47:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 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-01-08 22:47:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-08 22:47:02,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:02,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:02,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:02,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:02,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1659265626, now seen corresponding path program 1 times [2025-01-08 22:47:02,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:02,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [480042592] [2025-01-08 22:47:02,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:02,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:02,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:02,174 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-01-08 22:47:02,175 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-01-08 22:47:02,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-08 22:47:02,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-08 22:47:02,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:02,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:02,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:47:02,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:02,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:02,284 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:02,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480042592] [2025-01-08 22:47:02,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480042592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:02,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:02,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:47:02,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868320466] [2025-01-08 22:47:02,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:02,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:47:02,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:02,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:47:02,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:47:02,304 INFO L87 Difference]: Start difference. First operand has 41 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) 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-01-08 22:47:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:02,412 INFO L93 Difference]: Finished difference Result 95 states and 164 transitions. [2025-01-08 22:47:02,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:47:02,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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-01-08 22:47:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:02,419 INFO L225 Difference]: With dead ends: 95 [2025-01-08 22:47:02,419 INFO L226 Difference]: Without dead ends: 60 [2025-01-08 22:47:02,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-01-08 22:47:02,423 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:02,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 64 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-08 22:47:02,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-01-08 22:47:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.543859649122807) internal successors, (88), 57 states have internal predecessors, (88), 0 states have call successors, (0), 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-01-08 22:47:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2025-01-08 22:47:02,464 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 88 transitions. Word has length 11 [2025-01-08 22:47:02,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:02,464 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 88 transitions. [2025-01-08 22:47:02,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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-01-08 22:47:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 88 transitions. [2025-01-08 22:47:02,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-08 22:47:02,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:02,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:02,471 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-01-08 22:47:02,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:02,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:02,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:02,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1808952529, now seen corresponding path program 1 times [2025-01-08 22:47:02,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:02,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [728543376] [2025-01-08 22:47:02,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:02,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:02,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:02,674 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-01-08 22:47:02,675 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-01-08 22:47:02,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-08 22:47:02,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-08 22:47:02,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:02,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:02,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:47:02,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:02,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:02,757 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:02,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728543376] [2025-01-08 22:47:02,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728543376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:02,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:02,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:47:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335741740] [2025-01-08 22:47:02,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:02,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:02,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:02,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:02,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:47:02,758 INFO L87 Difference]: Start difference. First operand 58 states and 88 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-01-08 22:47:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:02,875 INFO L93 Difference]: Finished difference Result 157 states and 245 transitions. [2025-01-08 22:47:02,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:02,875 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-01-08 22:47:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:02,876 INFO L225 Difference]: With dead ends: 157 [2025-01-08 22:47:02,876 INFO L226 Difference]: Without dead ends: 108 [2025-01-08 22:47:02,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-01-08 22:47:02,877 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 55 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:02,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 147 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-08 22:47:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2025-01-08 22:47:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.5242718446601942) internal successors, (157), 103 states have internal predecessors, (157), 0 states have call successors, (0), 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-01-08 22:47:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions. [2025-01-08 22:47:02,884 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 157 transitions. Word has length 17 [2025-01-08 22:47:02,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:02,884 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 157 transitions. [2025-01-08 22:47:02,885 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-01-08 22:47:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 157 transitions. [2025-01-08 22:47:02,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-08 22:47:02,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:02,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:02,893 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-01-08 22:47:03,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:03,086 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:03,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:03,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1386085553, now seen corresponding path program 1 times [2025-01-08 22:47:03,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:03,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [404436716] [2025-01-08 22:47:03,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:03,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:03,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:03,092 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-01-08 22:47:03,093 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-01-08 22:47:03,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-08 22:47:03,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-08 22:47:03,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:03,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:03,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 22:47:03,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:47:03,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:03,147 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:03,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404436716] [2025-01-08 22:47:03,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404436716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:03,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:03,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:47:03,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721140750] [2025-01-08 22:47:03,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:03,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:47:03,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:03,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:47:03,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:47:03,148 INFO L87 Difference]: Start difference. First operand 104 states and 157 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-01-08 22:47:03,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:03,155 INFO L93 Difference]: Finished difference Result 108 states and 160 transitions. [2025-01-08 22:47:03,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:47:03,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-01-08 22:47:03,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:03,156 INFO L225 Difference]: With dead ends: 108 [2025-01-08 22:47:03,156 INFO L226 Difference]: Without dead ends: 53 [2025-01-08 22:47:03,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-01-08 22:47:03,157 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 43 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:03,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:47:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-08 22:47:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-08 22:47:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 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-01-08 22:47:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2025-01-08 22:47:03,162 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 18 [2025-01-08 22:47:03,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:03,162 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2025-01-08 22:47:03,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-01-08 22:47:03,163 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2025-01-08 22:47:03,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:47:03,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:03,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:03,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:47:03,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:03,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:03,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:03,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2100609168, now seen corresponding path program 1 times [2025-01-08 22:47:03,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:03,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [387210187] [2025-01-08 22:47:03,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:03,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:03,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:03,374 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-01-08 22:47:03,376 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-01-08 22:47:03,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:47:03,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:47:03,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:03,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:03,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:47:03,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:03,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:03,433 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:03,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387210187] [2025-01-08 22:47:03,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387210187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:03,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:03,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:47:03,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098213229] [2025-01-08 22:47:03,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:03,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:47:03,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:03,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:47:03,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:47:03,434 INFO L87 Difference]: Start difference. First operand 53 states and 75 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-01-08 22:47:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:03,446 INFO L93 Difference]: Finished difference Result 69 states and 95 transitions. [2025-01-08 22:47:03,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:47:03,449 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 24 [2025-01-08 22:47:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:03,450 INFO L225 Difference]: With dead ends: 69 [2025-01-08 22:47:03,450 INFO L226 Difference]: Without dead ends: 64 [2025-01-08 22:47:03,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-01-08 22:47:03,451 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:03,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:47:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-08 22:47:03,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-08 22:47:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 63 states have internal predecessors, (90), 0 states have call successors, (0), 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-01-08 22:47:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2025-01-08 22:47:03,460 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 24 [2025-01-08 22:47:03,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:03,461 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2025-01-08 22:47:03,461 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-01-08 22:47:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2025-01-08 22:47:03,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:47:03,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:03,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:03,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 22:47:03,663 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 [2025-01-08 22:47:03,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:03,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:03,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1399544590, now seen corresponding path program 1 times [2025-01-08 22:47:03,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:03,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569034541] [2025-01-08 22:47:03,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:03,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:03,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:03,666 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-01-08 22:47:03,667 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-01-08 22:47:03,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:47:03,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:47:03,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:03,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:03,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:47:03,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:03,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:03,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:03,742 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:03,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569034541] [2025-01-08 22:47:03,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569034541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:03,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:03,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:47:03,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18028993] [2025-01-08 22:47:03,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:03,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:03,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:03,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:03,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:47:03,743 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-01-08 22:47:03,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:03,805 INFO L93 Difference]: Finished difference Result 177 states and 250 transitions. [2025-01-08 22:47:03,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:47:03,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 24 [2025-01-08 22:47:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:03,806 INFO L225 Difference]: With dead ends: 177 [2025-01-08 22:47:03,806 INFO L226 Difference]: Without dead ends: 124 [2025-01-08 22:47:03,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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-01-08 22:47:03,806 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 55 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:03,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 91 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:03,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-08 22:47:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2025-01-08 22:47:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.434782608695652) internal successors, (165), 115 states have internal predecessors, (165), 0 states have call successors, (0), 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-01-08 22:47:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2025-01-08 22:47:03,816 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 24 [2025-01-08 22:47:03,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:03,816 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2025-01-08 22:47:03,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-01-08 22:47:03,816 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2025-01-08 22:47:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:47:03,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:03,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:03,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 22:47:04,021 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 [2025-01-08 22:47:04,021 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:04,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:04,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1954756413, now seen corresponding path program 1 times [2025-01-08 22:47:04,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:04,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [925977178] [2025-01-08 22:47:04,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:04,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:04,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:04,024 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-01-08 22:47:04,026 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-01-08 22:47:04,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:47:04,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:47:04,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:04,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:04,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:47:04,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:04,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:04,140 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:04,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925977178] [2025-01-08 22:47:04,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925977178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:04,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:04,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:47:04,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113715957] [2025-01-08 22:47:04,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:04,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:47:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:04,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:47:04,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:47:04,141 INFO L87 Difference]: Start difference. First operand 116 states and 165 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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-01-08 22:47:04,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:04,256 INFO L93 Difference]: Finished difference Result 229 states and 325 transitions. [2025-01-08 22:47:04,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:04,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-01-08 22:47:04,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:04,257 INFO L225 Difference]: With dead ends: 229 [2025-01-08 22:47:04,257 INFO L226 Difference]: Without dead ends: 176 [2025-01-08 22:47:04,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:47:04,258 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 75 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:04,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 193 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:04,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-08 22:47:04,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 116. [2025-01-08 22:47:04,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.434782608695652) internal successors, (165), 115 states have internal predecessors, (165), 0 states have call successors, (0), 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-01-08 22:47:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2025-01-08 22:47:04,264 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 25 [2025-01-08 22:47:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:04,264 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2025-01-08 22:47:04,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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-01-08 22:47:04,264 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2025-01-08 22:47:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:47:04,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:04,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:04,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-08 22:47:04,465 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 [2025-01-08 22:47:04,466 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:04,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:04,466 INFO L85 PathProgramCache]: Analyzing trace with hash 508124411, now seen corresponding path program 1 times [2025-01-08 22:47:04,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:04,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781045197] [2025-01-08 22:47:04,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:04,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:04,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:04,468 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-01-08 22:47:04,469 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-01-08 22:47:04,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:47:04,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:47:04,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:04,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:04,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 22:47:04,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:04,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:04,567 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:04,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781045197] [2025-01-08 22:47:04,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781045197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:04,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:04,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:47:04,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766908042] [2025-01-08 22:47:04,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:04,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:47:04,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:04,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:47:04,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:47:04,569 INFO L87 Difference]: Start difference. First operand 116 states and 165 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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-01-08 22:47:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:04,674 INFO L93 Difference]: Finished difference Result 281 states and 400 transitions. [2025-01-08 22:47:04,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:47:04,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-01-08 22:47:04,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:04,676 INFO L225 Difference]: With dead ends: 281 [2025-01-08 22:47:04,676 INFO L226 Difference]: Without dead ends: 228 [2025-01-08 22:47:04,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:47:04,677 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 123 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:04,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 345 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:04,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-08 22:47:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 116. [2025-01-08 22:47:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.434782608695652) internal successors, (165), 115 states have internal predecessors, (165), 0 states have call successors, (0), 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-01-08 22:47:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2025-01-08 22:47:04,688 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 26 [2025-01-08 22:47:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:04,688 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2025-01-08 22:47:04,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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-01-08 22:47:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2025-01-08 22:47:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:47:04,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:04,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:04,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-08 22:47:04,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:04,890 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:04,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:04,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1325772861, now seen corresponding path program 1 times [2025-01-08 22:47:04,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:04,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [340935107] [2025-01-08 22:47:04,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:04,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:04,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:04,894 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-01-08 22:47:04,895 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-01-08 22:47:04,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:47:04,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:47:04,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:04,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:04,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:47:04,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:04,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:04,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:04,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340935107] [2025-01-08 22:47:04,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340935107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:04,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:04,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-08 22:47:04,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561338909] [2025-01-08 22:47:04,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:04,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:47:04,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:04,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:47:04,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:47:04,987 INFO L87 Difference]: Start difference. First operand 116 states and 165 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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-01-08 22:47:05,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:05,168 INFO L93 Difference]: Finished difference Result 275 states and 390 transitions. [2025-01-08 22:47:05,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:47:05,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-01-08 22:47:05,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:05,170 INFO L225 Difference]: With dead ends: 275 [2025-01-08 22:47:05,170 INFO L226 Difference]: Without dead ends: 221 [2025-01-08 22:47:05,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:47:05,171 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 135 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:05,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 463 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:47:05,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-01-08 22:47:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 108. [2025-01-08 22:47:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.411214953271028) internal successors, (151), 107 states have internal predecessors, (151), 0 states have call successors, (0), 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-01-08 22:47:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 151 transitions. [2025-01-08 22:47:05,181 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 151 transitions. Word has length 26 [2025-01-08 22:47:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:05,181 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 151 transitions. [2025-01-08 22:47:05,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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-01-08 22:47:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 151 transitions. [2025-01-08 22:47:05,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:47:05,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:05,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:05,187 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-01-08 22:47:05,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:05,382 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:05,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:05,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1997773630, now seen corresponding path program 1 times [2025-01-08 22:47:05,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:05,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1807695431] [2025-01-08 22:47:05,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:05,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:05,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:05,385 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:05,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-08 22:47:05,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:47:05,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:47:05,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:05,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:05,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:47:05,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:05,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:05,492 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:05,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807695431] [2025-01-08 22:47:05,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807695431] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:05,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:05,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-01-08 22:47:05,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148938233] [2025-01-08 22:47:05,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:05,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:47:05,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:05,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:47:05,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:47:05,493 INFO L87 Difference]: Start difference. First operand 108 states and 151 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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-01-08 22:47:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:05,652 INFO L93 Difference]: Finished difference Result 412 states and 612 transitions. [2025-01-08 22:47:05,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:47:05,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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 28 [2025-01-08 22:47:05,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:05,653 INFO L225 Difference]: With dead ends: 412 [2025-01-08 22:47:05,653 INFO L226 Difference]: Without dead ends: 301 [2025-01-08 22:47:05,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:47:05,654 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 77 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:05,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 71 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:05,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-08 22:47:05,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 224. [2025-01-08 22:47:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.4708520179372198) internal successors, (328), 223 states have internal predecessors, (328), 0 states have call successors, (0), 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-01-08 22:47:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 328 transitions. [2025-01-08 22:47:05,664 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 328 transitions. Word has length 28 [2025-01-08 22:47:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:05,664 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 328 transitions. [2025-01-08 22:47:05,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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-01-08 22:47:05,664 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 328 transitions. [2025-01-08 22:47:05,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-08 22:47:05,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:05,665 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:05,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-08 22:47:05,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:05,866 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:05,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:05,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1214706430, now seen corresponding path program 1 times [2025-01-08 22:47:05,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:05,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100470869] [2025-01-08 22:47:05,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:05,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:05,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:05,869 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:05,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-08 22:47:05,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-08 22:47:05,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-08 22:47:05,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:05,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:05,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:47:05,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:47:05,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:05,941 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:05,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100470869] [2025-01-08 22:47:05,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100470869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:05,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:05,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:47:05,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950649739] [2025-01-08 22:47:05,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:05,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:05,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:05,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:05,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:47:05,942 INFO L87 Difference]: Start difference. First operand 224 states and 328 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-01-08 22:47:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:06,018 INFO L93 Difference]: Finished difference Result 602 states and 878 transitions. [2025-01-08 22:47:06,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:47:06,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 63 [2025-01-08 22:47:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:06,019 INFO L225 Difference]: With dead ends: 602 [2025-01-08 22:47:06,019 INFO L226 Difference]: Without dead ends: 393 [2025-01-08 22:47:06,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 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-01-08 22:47:06,020 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 25 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:06,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 149 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-01-08 22:47:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 316. [2025-01-08 22:47:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.4825396825396826) internal successors, (467), 315 states have internal predecessors, (467), 0 states have call successors, (0), 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-01-08 22:47:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 467 transitions. [2025-01-08 22:47:06,032 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 467 transitions. Word has length 63 [2025-01-08 22:47:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:06,032 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 467 transitions. [2025-01-08 22:47:06,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-01-08 22:47:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 467 transitions. [2025-01-08 22:47:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-08 22:47:06,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:06,033 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:06,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-08 22:47:06,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:06,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:06,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1348719936, now seen corresponding path program 2 times [2025-01-08 22:47:06,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:06,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314119691] [2025-01-08 22:47:06,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:47:06,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:06,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:06,241 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:06,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-08 22:47:06,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-01-08 22:47:06,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-01-08 22:47:06,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:47:06,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:06,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:47:06,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-08 22:47:06,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:06,335 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:06,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314119691] [2025-01-08 22:47:06,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314119691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:06,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:06,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:47:06,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913323496] [2025-01-08 22:47:06,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:06,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:06,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:06,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:06,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:47:06,337 INFO L87 Difference]: Start difference. First operand 316 states and 467 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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-01-08 22:47:06,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:06,399 INFO L93 Difference]: Finished difference Result 661 states and 983 transitions. [2025-01-08 22:47:06,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:47:06,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 63 [2025-01-08 22:47:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:06,401 INFO L225 Difference]: With dead ends: 661 [2025-01-08 22:47:06,401 INFO L226 Difference]: Without dead ends: 488 [2025-01-08 22:47:06,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 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-01-08 22:47:06,402 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 28 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:06,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 92 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:47:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-01-08 22:47:06,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-01-08 22:47:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.486652977412731) internal successors, (724), 487 states have internal predecessors, (724), 0 states have call successors, (0), 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-01-08 22:47:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 724 transitions. [2025-01-08 22:47:06,421 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 724 transitions. Word has length 63 [2025-01-08 22:47:06,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:06,421 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 724 transitions. [2025-01-08 22:47:06,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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-01-08 22:47:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 724 transitions. [2025-01-08 22:47:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-08 22:47:06,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:06,422 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:06,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-08 22:47:06,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:06,623 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:06,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:06,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1827385905, now seen corresponding path program 1 times [2025-01-08 22:47:06,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:06,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649810099] [2025-01-08 22:47:06,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:06,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:06,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:06,627 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:06,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-08 22:47:06,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-08 22:47:06,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-08 22:47:06,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:06,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:06,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:47:06,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:47:06,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 25 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:06,999 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:06,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649810099] [2025-01-08 22:47:06,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649810099] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:06,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:06,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2025-01-08 22:47:06,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889421718] [2025-01-08 22:47:06,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:07,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 22:47:07,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:07,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 22:47:07,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:47:07,000 INFO L87 Difference]: Start difference. First operand 488 states and 724 transitions. Second operand has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 0 states have call successors, (0), 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-01-08 22:47:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:07,197 INFO L93 Difference]: Finished difference Result 1043 states and 1572 transitions. [2025-01-08 22:47:07,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-08 22:47:07,198 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-08 22:47:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:07,200 INFO L225 Difference]: With dead ends: 1043 [2025-01-08 22:47:07,200 INFO L226 Difference]: Without dead ends: 573 [2025-01-08 22:47:07,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:47:07,201 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 247 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:07,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 67 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-01-08 22:47:07,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 517. [2025-01-08 22:47:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.372093023255814) internal successors, (708), 516 states have internal predecessors, (708), 0 states have call successors, (0), 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-01-08 22:47:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 708 transitions. [2025-01-08 22:47:07,231 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 708 transitions. Word has length 64 [2025-01-08 22:47:07,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:07,232 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 708 transitions. [2025-01-08 22:47:07,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 0 states have call successors, (0), 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-01-08 22:47:07,232 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 708 transitions. [2025-01-08 22:47:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-08 22:47:07,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:07,233 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:07,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-08 22:47:07,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:07,437 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:07,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:07,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1452704347, now seen corresponding path program 1 times [2025-01-08 22:47:07,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:07,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046965551] [2025-01-08 22:47:07,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:07,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:07,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:07,443 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:07,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-08 22:47:07,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-08 22:47:07,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-08 22:47:07,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:07,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:07,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:47:07,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-08 22:47:07,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:07,562 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:07,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046965551] [2025-01-08 22:47:07,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046965551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:07,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:07,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:47:07,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117737387] [2025-01-08 22:47:07,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:07,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:47:07,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:07,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:47:07,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:47:07,563 INFO L87 Difference]: Start difference. First operand 517 states and 708 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-01-08 22:47:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:07,697 INFO L93 Difference]: Finished difference Result 884 states and 1212 transitions. [2025-01-08 22:47:07,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:07,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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) Word has length 68 [2025-01-08 22:47:07,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:07,700 INFO L225 Difference]: With dead ends: 884 [2025-01-08 22:47:07,700 INFO L226 Difference]: Without dead ends: 700 [2025-01-08 22:47:07,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:47:07,700 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 62 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:07,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 174 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-01-08 22:47:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 517. [2025-01-08 22:47:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.372093023255814) internal successors, (708), 516 states have internal predecessors, (708), 0 states have call successors, (0), 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-01-08 22:47:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 708 transitions. [2025-01-08 22:47:07,717 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 708 transitions. Word has length 68 [2025-01-08 22:47:07,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:07,723 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 708 transitions. [2025-01-08 22:47:07,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-01-08 22:47:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 708 transitions. [2025-01-08 22:47:07,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-08 22:47:07,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:07,724 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:07,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-08 22:47:07,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:07,925 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:07,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:07,925 INFO L85 PathProgramCache]: Analyzing trace with hash -856917213, now seen corresponding path program 1 times [2025-01-08 22:47:07,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:07,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [946811719] [2025-01-08 22:47:07,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:07,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:07,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:07,927 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:07,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-08 22:47:07,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-08 22:47:07,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-08 22:47:07,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:07,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:07,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:47:07,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-08 22:47:08,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:08,023 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:08,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946811719] [2025-01-08 22:47:08,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946811719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:08,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:08,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:47:08,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98908055] [2025-01-08 22:47:08,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:08,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:47:08,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:08,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:47:08,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:47:08,024 INFO L87 Difference]: Start difference. First operand 517 states and 708 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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-01-08 22:47:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:08,116 INFO L93 Difference]: Finished difference Result 884 states and 1211 transitions. [2025-01-08 22:47:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:47:08,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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 69 [2025-01-08 22:47:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:08,119 INFO L225 Difference]: With dead ends: 884 [2025-01-08 22:47:08,119 INFO L226 Difference]: Without dead ends: 700 [2025-01-08 22:47:08,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:47:08,120 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 96 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:08,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 329 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-01-08 22:47:08,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 334. [2025-01-08 22:47:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.3693693693693694) internal successors, (456), 333 states have internal predecessors, (456), 0 states have call successors, (0), 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-01-08 22:47:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 456 transitions. [2025-01-08 22:47:08,131 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 456 transitions. Word has length 69 [2025-01-08 22:47:08,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:08,131 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 456 transitions. [2025-01-08 22:47:08,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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-01-08 22:47:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 456 transitions. [2025-01-08 22:47:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-08 22:47:08,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:08,132 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:08,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-08 22:47:08,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:08,333 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:08,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash -439520607, now seen corresponding path program 1 times [2025-01-08 22:47:08,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:08,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1562753596] [2025-01-08 22:47:08,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:08,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:08,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:08,336 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:08,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-08 22:47:08,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-08 22:47:08,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-08 22:47:08,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:08,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:08,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:47:08,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:47:08,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:08,526 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:47:08,527 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:08,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562753596] [2025-01-08 22:47:08,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562753596] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:08,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:08,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-08 22:47:08,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634275252] [2025-01-08 22:47:08,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:08,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:47:08,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:08,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:47:08,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:47:08,528 INFO L87 Difference]: Start difference. First operand 334 states and 456 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:08,721 INFO L93 Difference]: Finished difference Result 616 states and 805 transitions. [2025-01-08 22:47:08,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:47:08,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-08 22:47:08,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:08,723 INFO L225 Difference]: With dead ends: 616 [2025-01-08 22:47:08,723 INFO L226 Difference]: Without dead ends: 476 [2025-01-08 22:47:08,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:47:08,725 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 162 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:08,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 262 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-01-08 22:47:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 334. [2025-01-08 22:47:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.3663663663663663) internal successors, (455), 333 states have internal predecessors, (455), 0 states have call successors, (0), 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-01-08 22:47:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 455 transitions. [2025-01-08 22:47:08,747 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 455 transitions. Word has length 69 [2025-01-08 22:47:08,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:08,748 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 455 transitions. [2025-01-08 22:47:08,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 455 transitions. [2025-01-08 22:47:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-08 22:47:08,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:08,749 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:08,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-08 22:47:08,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:08,953 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:08,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:08,954 INFO L85 PathProgramCache]: Analyzing trace with hash 220010915, now seen corresponding path program 2 times [2025-01-08 22:47:08,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:08,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233383332] [2025-01-08 22:47:08,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:47:08,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:08,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:08,956 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:08,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-08 22:47:08,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-01-08 22:47:09,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-01-08 22:47:09,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:47:09,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:09,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:47:09,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:47:09,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:47:09,173 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:09,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233383332] [2025-01-08 22:47:09,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233383332] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:09,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:09,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2025-01-08 22:47:09,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655623638] [2025-01-08 22:47:09,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:09,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-08 22:47:09,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:09,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-08 22:47:09,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:47:09,175 INFO L87 Difference]: Start difference. First operand 334 states and 455 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 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-01-08 22:47:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:09,352 INFO L93 Difference]: Finished difference Result 730 states and 968 transitions. [2025-01-08 22:47:09,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:47:09,353 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-08 22:47:09,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:09,354 INFO L225 Difference]: With dead ends: 730 [2025-01-08 22:47:09,354 INFO L226 Difference]: Without dead ends: 411 [2025-01-08 22:47:09,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:47:09,356 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 122 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:09,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 291 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-01-08 22:47:09,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 279. [2025-01-08 22:47:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.330935251798561) internal successors, (370), 278 states have internal predecessors, (370), 0 states have call successors, (0), 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-01-08 22:47:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 370 transitions. [2025-01-08 22:47:09,366 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 370 transitions. Word has length 69 [2025-01-08 22:47:09,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:09,367 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 370 transitions. [2025-01-08 22:47:09,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 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-01-08 22:47:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 370 transitions. [2025-01-08 22:47:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-08 22:47:09,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:09,370 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:09,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-08 22:47:09,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:09,571 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:09,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:09,571 INFO L85 PathProgramCache]: Analyzing trace with hash 85997409, now seen corresponding path program 3 times [2025-01-08 22:47:09,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:09,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887052962] [2025-01-08 22:47:09,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:47:09,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:09,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:09,576 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:09,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-08 22:47:09,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 5 equivalence classes. [2025-01-08 22:47:09,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 69 of 69 statements. [2025-01-08 22:47:09,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-08 22:47:09,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:09,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-08 22:47:09,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:11,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:13,587 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:13,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887052962] [2025-01-08 22:47:13,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887052962] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:13,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:13,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2025-01-08 22:47:13,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496590475] [2025-01-08 22:47:13,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:13,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-08 22:47:13,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:13,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-08 22:47:13,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1831, Unknown=0, NotChecked=0, Total=1980 [2025-01-08 22:47:13,589 INFO L87 Difference]: Start difference. First operand 279 states and 370 transitions. Second operand has 45 states, 45 states have (on average 3.022222222222222) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 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-01-08 22:47:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:24,097 INFO L93 Difference]: Finished difference Result 1313 states and 1674 transitions. [2025-01-08 22:47:24,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-01-08 22:47:24,099 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.022222222222222) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-08 22:47:24,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:24,102 INFO L225 Difference]: With dead ends: 1313 [2025-01-08 22:47:24,102 INFO L226 Difference]: Without dead ends: 1208 [2025-01-08 22:47:24,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3235 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=2508, Invalid=13242, Unknown=0, NotChecked=0, Total=15750 [2025-01-08 22:47:24,105 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 1299 mSDsluCounter, 5550 mSDsCounter, 0 mSdLazyCounter, 3746 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 5830 SdHoareTripleChecker+Invalid, 3840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:24,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 5830 Invalid, 3840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3746 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 22:47:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2025-01-08 22:47:24,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 484. [2025-01-08 22:47:24,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.3022774327122153) internal successors, (629), 483 states have internal predecessors, (629), 0 states have call successors, (0), 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-01-08 22:47:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 629 transitions. [2025-01-08 22:47:24,130 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 629 transitions. Word has length 69 [2025-01-08 22:47:24,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:24,130 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 629 transitions. [2025-01-08 22:47:24,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.022222222222222) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 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-01-08 22:47:24,130 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 629 transitions. [2025-01-08 22:47:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-08 22:47:24,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:24,132 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:24,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-08 22:47:24,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:24,336 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:24,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:24,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1833804518, now seen corresponding path program 1 times [2025-01-08 22:47:24,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:24,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299524258] [2025-01-08 22:47:24,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:24,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:24,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:24,339 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:24,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-08 22:47:24,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-08 22:47:24,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-08 22:47:24,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:24,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:24,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:47:24,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 22:47:24,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:24,470 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:24,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299524258] [2025-01-08 22:47:24,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299524258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:24,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:24,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:47:24,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728516494] [2025-01-08 22:47:24,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:24,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:24,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:24,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:24,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:47:24,471 INFO L87 Difference]: Start difference. First operand 484 states and 629 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-01-08 22:47:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:24,538 INFO L93 Difference]: Finished difference Result 828 states and 1102 transitions. [2025-01-08 22:47:24,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:47:24,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-08 22:47:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:24,539 INFO L225 Difference]: With dead ends: 828 [2025-01-08 22:47:24,539 INFO L226 Difference]: Without dead ends: 655 [2025-01-08 22:47:24,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 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-01-08 22:47:24,540 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 17 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:24,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 99 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:47:24,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-01-08 22:47:24,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2025-01-08 22:47:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 654 states have (on average 1.3211009174311927) internal successors, (864), 654 states have internal predecessors, (864), 0 states have call successors, (0), 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-01-08 22:47:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 864 transitions. [2025-01-08 22:47:24,566 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 864 transitions. Word has length 71 [2025-01-08 22:47:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:24,566 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 864 transitions. [2025-01-08 22:47:24,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-01-08 22:47:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 864 transitions. [2025-01-08 22:47:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-08 22:47:24,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:24,567 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:24,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-08 22:47:24,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:24,767 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:24,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1990590167, now seen corresponding path program 1 times [2025-01-08 22:47:24,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:24,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1678980709] [2025-01-08 22:47:24,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:24,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:24,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:24,770 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:24,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-08 22:47:24,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-08 22:47:24,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-08 22:47:24,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:24,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:24,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:47:24,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 48 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:47:24,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 48 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:47:25,078 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:25,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678980709] [2025-01-08 22:47:25,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678980709] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:25,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:25,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2025-01-08 22:47:25,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148442339] [2025-01-08 22:47:25,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:25,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-08 22:47:25,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:25,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-08 22:47:25,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:47:25,079 INFO L87 Difference]: Start difference. First operand 655 states and 864 transitions. Second operand has 14 states, 14 states have (on average 8.071428571428571) internal successors, (113), 14 states have internal predecessors, (113), 0 states have call successors, (0), 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-01-08 22:47:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:25,675 INFO L93 Difference]: Finished difference Result 1589 states and 2093 transitions. [2025-01-08 22:47:25,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-08 22:47:25,676 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.071428571428571) internal successors, (113), 14 states have internal predecessors, (113), 0 states have call successors, (0), 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 72 [2025-01-08 22:47:25,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:25,678 INFO L225 Difference]: With dead ends: 1589 [2025-01-08 22:47:25,678 INFO L226 Difference]: Without dead ends: 929 [2025-01-08 22:47:25,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=754, Unknown=0, NotChecked=0, Total=1056 [2025-01-08 22:47:25,678 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 505 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:25,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 121 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:47:25,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-01-08 22:47:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 844. [2025-01-08 22:47:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 1.309608540925267) internal successors, (1104), 843 states have internal predecessors, (1104), 0 states have call successors, (0), 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-01-08 22:47:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1104 transitions. [2025-01-08 22:47:25,728 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1104 transitions. Word has length 72 [2025-01-08 22:47:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:25,728 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1104 transitions. [2025-01-08 22:47:25,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.071428571428571) internal successors, (113), 14 states have internal predecessors, (113), 0 states have call successors, (0), 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-01-08 22:47:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1104 transitions. [2025-01-08 22:47:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-08 22:47:25,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:25,729 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:25,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-01-08 22:47:25,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:25,930 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:25,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:25,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2130073073, now seen corresponding path program 1 times [2025-01-08 22:47:25,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:25,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [616075685] [2025-01-08 22:47:25,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:25,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:25,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:25,933 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:25,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-08 22:47:25,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:47:25,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:47:25,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:25,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:25,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-08 22:47:25,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:28,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:30,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:30,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616075685] [2025-01-08 22:47:30,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616075685] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:30,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:30,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2025-01-08 22:47:30,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721444636] [2025-01-08 22:47:30,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:30,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-08 22:47:30,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:30,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-08 22:47:30,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2004, Unknown=0, NotChecked=0, Total=2162 [2025-01-08 22:47:30,420 INFO L87 Difference]: Start difference. First operand 844 states and 1104 transitions. Second operand has 47 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)