./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ffdd9c6c8ed32275119d4b9d2dc66b9f80986fea1a039186a702d6c803e62485 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:38:21,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:38:21,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:38:21,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:38:21,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:38:21,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:38:21,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:38:21,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:38:21,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:38:21,120 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:38:21,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:38:21,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:38:21,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:38:21,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:38:21,122 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:38:21,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:38:21,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:38:21,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:38:21,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:38:21,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:38:21,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:38:21,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:38:21,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:38:21,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:38:21,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:38:21,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:38:21,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:38:21,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:38:21,123 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:38:21,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:38:21,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:38:21,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:38:21,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:38:21,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:38:21,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:38:21,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:38:21,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:38:21,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:38:21,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:38:21,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:38:21,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:38:21,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:38:21,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:38:21,125 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 -> ffdd9c6c8ed32275119d4b9d2dc66b9f80986fea1a039186a702d6c803e62485 [2025-02-05 10:38:21,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:38:21,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:38:21,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:38:21,368 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:38:21,368 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:38:21,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2025-02-05 10:38:22,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/200af4fc2/6bbe19a2c9054535ae647d46c31e2900/FLAG253827053 [2025-02-05 10:38:22,806 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:38:22,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2025-02-05 10:38:22,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/200af4fc2/6bbe19a2c9054535ae647d46c31e2900/FLAG253827053 [2025-02-05 10:38:22,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/200af4fc2/6bbe19a2c9054535ae647d46c31e2900 [2025-02-05 10:38:22,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:38:22,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:38:22,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:38:22,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:38:22,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:38:22,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:38:22" (1/1) ... [2025-02-05 10:38:22,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b9cecc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:22, skipping insertion in model container [2025-02-05 10:38:22,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:38:22" (1/1) ... [2025-02-05 10:38:22,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:38:23,069 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/s3_srvr_2a_alt.BV.c.cil.c[44811,44824] [2025-02-05 10:38:23,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:38:23,084 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:38:23,117 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/s3_srvr_2a_alt.BV.c.cil.c[44811,44824] [2025-02-05 10:38:23,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:38:23,136 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:38:23,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:23 WrapperNode [2025-02-05 10:38:23,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:38:23,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:38:23,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:38:23,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:38:23,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:23" (1/1) ... [2025-02-05 10:38:23,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:23" (1/1) ... [2025-02-05 10:38:23,171 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 566 [2025-02-05 10:38:23,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:38:23,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:38:23,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:38:23,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:38:23,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:23" (1/1) ... [2025-02-05 10:38:23,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:23" (1/1) ... [2025-02-05 10:38:23,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:23" (1/1) ... [2025-02-05 10:38:23,193 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 10:38:23,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:23" (1/1) ... [2025-02-05 10:38:23,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:23" (1/1) ... [2025-02-05 10:38:23,198 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:23" (1/1) ... [2025-02-05 10:38:23,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:23" (1/1) ... [2025-02-05 10:38:23,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:23" (1/1) ... [2025-02-05 10:38:23,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:23" (1/1) ... [2025-02-05 10:38:23,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:38:23,208 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:38:23,208 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:38:23,208 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:38:23,211 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:23" (1/1) ... [2025-02-05 10:38:23,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:38:23,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:23,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:38:23,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:38:23,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:38:23,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:38:23,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:38:23,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:38:23,339 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:38:23,340 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:38:23,755 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L221: assume false; [2025-02-05 10:38:23,755 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L221: assume !false; [2025-02-05 10:38:23,779 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-02-05 10:38:23,779 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:38:23,793 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:38:23,794 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:38:23,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:23 BoogieIcfgContainer [2025-02-05 10:38:23,794 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:38:23,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:38:23,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:38:23,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:38:23,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:38:22" (1/3) ... [2025-02-05 10:38:23,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e724363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:38:23, skipping insertion in model container [2025-02-05 10:38:23,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:23" (2/3) ... [2025-02-05 10:38:23,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e724363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:38:23, skipping insertion in model container [2025-02-05 10:38:23,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:23" (3/3) ... [2025-02-05 10:38:23,806 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a_alt.BV.c.cil.c [2025-02-05 10:38:23,820 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:38:23,821 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_srvr_2a_alt.BV.c.cil.c that has 1 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:38:23,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:38:23,889 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;@5ed9a607, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:38:23,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:38:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7352941176470589) internal successors, (236), 137 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:23,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:38:23,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:23,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:23,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:23,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:23,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1367127213, now seen corresponding path program 1 times [2025-02-05 10:38:23,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:23,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752476456] [2025-02-05 10:38:23,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:23,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:23,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:38:24,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:38:24,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:24,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:38:24,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:24,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752476456] [2025-02-05 10:38:24,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752476456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:24,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:24,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795579539] [2025-02-05 10:38:24,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:24,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:24,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:24,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:24,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:24,307 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7352941176470589) internal successors, (236), 137 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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-02-05 10:38:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:24,480 INFO L93 Difference]: Finished difference Result 309 states and 535 transitions. [2025-02-05 10:38:24,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:24,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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 44 [2025-02-05 10:38:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:24,487 INFO L225 Difference]: With dead ends: 309 [2025-02-05 10:38:24,487 INFO L226 Difference]: Without dead ends: 156 [2025-02-05 10:38:24,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:24,490 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 41 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:24,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 257 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-05 10:38:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-02-05 10:38:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.6) internal successors, (248), 155 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 248 transitions. [2025-02-05 10:38:24,514 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 248 transitions. Word has length 44 [2025-02-05 10:38:24,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:24,515 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 248 transitions. [2025-02-05 10:38:24,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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-02-05 10:38:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 248 transitions. [2025-02-05 10:38:24,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 10:38:24,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:24,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:24,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:38:24,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:24,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:24,517 INFO L85 PathProgramCache]: Analyzing trace with hash 575228017, now seen corresponding path program 1 times [2025-02-05 10:38:24,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:24,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329331262] [2025-02-05 10:38:24,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:24,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:24,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 10:38:24,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 10:38:24,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:24,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:24,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:38:24,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:24,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329331262] [2025-02-05 10:38:24,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329331262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:24,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:24,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:24,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950807466] [2025-02-05 10:38:24,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:24,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:24,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:24,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:24,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:24,602 INFO L87 Difference]: Start difference. First operand 156 states and 248 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:24,719 INFO L93 Difference]: Finished difference Result 347 states and 560 transitions. [2025-02-05 10:38:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:24,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-02-05 10:38:24,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:24,721 INFO L225 Difference]: With dead ends: 347 [2025-02-05 10:38:24,721 INFO L226 Difference]: Without dead ends: 197 [2025-02-05 10:38:24,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:24,726 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 23 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:24,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 181 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:24,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-05 10:38:24,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-02-05 10:38:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.6326530612244898) internal successors, (320), 196 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 320 transitions. [2025-02-05 10:38:24,734 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 320 transitions. Word has length 45 [2025-02-05 10:38:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:24,734 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 320 transitions. [2025-02-05 10:38:24,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:24,734 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 320 transitions. [2025-02-05 10:38:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 10:38:24,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:24,735 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:24,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:38:24,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:24,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:24,736 INFO L85 PathProgramCache]: Analyzing trace with hash 585947163, now seen corresponding path program 1 times [2025-02-05 10:38:24,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:24,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304722617] [2025-02-05 10:38:24,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:24,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:24,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 10:38:24,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 10:38:24,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:24,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:38:24,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:24,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304722617] [2025-02-05 10:38:24,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304722617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:24,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:24,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:24,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901080511] [2025-02-05 10:38:24,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:24,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:24,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:24,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:24,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:24,824 INFO L87 Difference]: Start difference. First operand 197 states and 320 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:24,847 INFO L93 Difference]: Finished difference Result 569 states and 929 transitions. [2025-02-05 10:38:24,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:24,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-02-05 10:38:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:24,849 INFO L225 Difference]: With dead ends: 569 [2025-02-05 10:38:24,849 INFO L226 Difference]: Without dead ends: 380 [2025-02-05 10:38:24,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:24,850 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 111 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:24,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 475 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:24,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-02-05 10:38:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-02-05 10:38:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 1.6279683377308707) internal successors, (617), 379 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 617 transitions. [2025-02-05 10:38:24,862 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 617 transitions. Word has length 60 [2025-02-05 10:38:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:24,862 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 617 transitions. [2025-02-05 10:38:24,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:24,863 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 617 transitions. [2025-02-05 10:38:24,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 10:38:24,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:24,864 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:24,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:38:24,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:24,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:24,865 INFO L85 PathProgramCache]: Analyzing trace with hash 710020410, now seen corresponding path program 1 times [2025-02-05 10:38:24,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:24,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222328947] [2025-02-05 10:38:24,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:24,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:24,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 10:38:24,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 10:38:24,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:24,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:38:24,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:24,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222328947] [2025-02-05 10:38:24,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222328947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:24,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:24,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:24,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434025513] [2025-02-05 10:38:24,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:24,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:24,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:24,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:24,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:24,904 INFO L87 Difference]: Start difference. First operand 380 states and 617 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:24,924 INFO L93 Difference]: Finished difference Result 938 states and 1528 transitions. [2025-02-05 10:38:24,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:24,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-02-05 10:38:24,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:24,926 INFO L225 Difference]: With dead ends: 938 [2025-02-05 10:38:24,926 INFO L226 Difference]: Without dead ends: 566 [2025-02-05 10:38:24,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:24,928 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 148 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:24,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 330 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-02-05 10:38:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-02-05 10:38:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.6247787610619469) internal successors, (918), 565 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 918 transitions. [2025-02-05 10:38:24,943 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 918 transitions. Word has length 60 [2025-02-05 10:38:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:24,944 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 918 transitions. [2025-02-05 10:38:24,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 918 transitions. [2025-02-05 10:38:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 10:38:24,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:24,947 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:24,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:38:24,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:24,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:24,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1503389872, now seen corresponding path program 1 times [2025-02-05 10:38:24,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:24,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843938724] [2025-02-05 10:38:24,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:24,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:24,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 10:38:24,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 10:38:24,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:24,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 10:38:25,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:25,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843938724] [2025-02-05 10:38:25,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843938724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:25,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:25,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:25,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023667421] [2025-02-05 10:38:25,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:25,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:25,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:25,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:25,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:25,009 INFO L87 Difference]: Start difference. First operand 566 states and 918 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:25,150 INFO L93 Difference]: Finished difference Result 1336 states and 2193 transitions. [2025-02-05 10:38:25,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:25,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 97 [2025-02-05 10:38:25,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:25,153 INFO L225 Difference]: With dead ends: 1336 [2025-02-05 10:38:25,153 INFO L226 Difference]: Without dead ends: 778 [2025-02-05 10:38:25,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:25,154 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 35 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:25,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 272 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-02-05 10:38:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 766. [2025-02-05 10:38:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 765 states have (on average 1.461437908496732) internal successors, (1118), 765 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1118 transitions. [2025-02-05 10:38:25,204 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1118 transitions. Word has length 97 [2025-02-05 10:38:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:25,204 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1118 transitions. [2025-02-05 10:38:25,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1118 transitions. [2025-02-05 10:38:25,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 10:38:25,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:25,206 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:25,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:38:25,207 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:25,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:25,207 INFO L85 PathProgramCache]: Analyzing trace with hash -427229233, now seen corresponding path program 1 times [2025-02-05 10:38:25,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:25,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388736192] [2025-02-05 10:38:25,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:25,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:25,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 10:38:25,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 10:38:25,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:25,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 10:38:25,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:25,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388736192] [2025-02-05 10:38:25,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388736192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:25,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:25,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:25,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350789982] [2025-02-05 10:38:25,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:25,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:25,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:25,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:25,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:25,259 INFO L87 Difference]: Start difference. First operand 766 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:25,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:25,383 INFO L93 Difference]: Finished difference Result 1653 states and 2450 transitions. [2025-02-05 10:38:25,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:25,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 97 [2025-02-05 10:38:25,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:25,386 INFO L225 Difference]: With dead ends: 1653 [2025-02-05 10:38:25,386 INFO L226 Difference]: Without dead ends: 895 [2025-02-05 10:38:25,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:25,387 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 35 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:25,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 271 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-02-05 10:38:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 859. [2025-02-05 10:38:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.456876456876457) internal successors, (1250), 858 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1250 transitions. [2025-02-05 10:38:25,405 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1250 transitions. Word has length 97 [2025-02-05 10:38:25,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:25,405 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1250 transitions. [2025-02-05 10:38:25,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1250 transitions. [2025-02-05 10:38:25,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 10:38:25,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:25,407 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:25,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:38:25,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:25,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:25,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1195337086, now seen corresponding path program 1 times [2025-02-05 10:38:25,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:25,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957939575] [2025-02-05 10:38:25,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:25,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:25,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 10:38:25,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 10:38:25,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:25,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 10:38:25,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:25,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957939575] [2025-02-05 10:38:25,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957939575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:25,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:25,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:25,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541585273] [2025-02-05 10:38:25,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:25,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:25,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:25,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:25,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:25,496 INFO L87 Difference]: Start difference. First operand 859 states and 1250 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:25,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:25,537 INFO L93 Difference]: Finished difference Result 1746 states and 2558 transitions. [2025-02-05 10:38:25,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:25,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 121 [2025-02-05 10:38:25,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:25,541 INFO L225 Difference]: With dead ends: 1746 [2025-02-05 10:38:25,542 INFO L226 Difference]: Without dead ends: 1153 [2025-02-05 10:38:25,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:25,544 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 111 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:25,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 484 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:25,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-02-05 10:38:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2025-02-05 10:38:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.4592013888888888) internal successors, (1681), 1152 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1681 transitions. [2025-02-05 10:38:25,580 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1681 transitions. Word has length 121 [2025-02-05 10:38:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:25,580 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1681 transitions. [2025-02-05 10:38:25,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1681 transitions. [2025-02-05 10:38:25,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 10:38:25,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:25,583 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:25,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:38:25,583 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:25,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1644033725, now seen corresponding path program 1 times [2025-02-05 10:38:25,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:25,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514706887] [2025-02-05 10:38:25,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:25,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 10:38:25,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 10:38:25,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:25,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 10:38:25,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514706887] [2025-02-05 10:38:25,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514706887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:25,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:25,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:25,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848589975] [2025-02-05 10:38:25,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:25,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:25,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:25,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:25,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:25,663 INFO L87 Difference]: Start difference. First operand 1153 states and 1681 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 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-02-05 10:38:25,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:25,707 INFO L93 Difference]: Finished difference Result 2297 states and 3379 transitions. [2025-02-05 10:38:25,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:25,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 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 121 [2025-02-05 10:38:25,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:25,712 INFO L225 Difference]: With dead ends: 2297 [2025-02-05 10:38:25,712 INFO L226 Difference]: Without dead ends: 1410 [2025-02-05 10:38:25,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:25,714 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 113 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:25,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 485 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:25,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2025-02-05 10:38:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2025-02-05 10:38:25,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1409 states have (on average 1.4698367636621719) internal successors, (2071), 1409 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2071 transitions. [2025-02-05 10:38:25,747 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2071 transitions. Word has length 121 [2025-02-05 10:38:25,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:25,747 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2071 transitions. [2025-02-05 10:38:25,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 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-02-05 10:38:25,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2071 transitions. [2025-02-05 10:38:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-05 10:38:25,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:25,754 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:25,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:38:25,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:25,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1042208562, now seen corresponding path program 1 times [2025-02-05 10:38:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:25,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851068312] [2025-02-05 10:38:25,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:25,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-05 10:38:25,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-05 10:38:25,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:25,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-02-05 10:38:25,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:25,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851068312] [2025-02-05 10:38:25,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851068312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:25,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:25,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:25,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126461144] [2025-02-05 10:38:25,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:25,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:25,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:25,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:25,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:25,869 INFO L87 Difference]: Start difference. First operand 1410 states and 2071 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:26,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:26,009 INFO L93 Difference]: Finished difference Result 3017 states and 4490 transitions. [2025-02-05 10:38:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:26,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 225 [2025-02-05 10:38:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:26,015 INFO L225 Difference]: With dead ends: 3017 [2025-02-05 10:38:26,015 INFO L226 Difference]: Without dead ends: 1565 [2025-02-05 10:38:26,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:26,020 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 31 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:26,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 257 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:26,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2025-02-05 10:38:26,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2025-02-05 10:38:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1564 states have (on average 1.4392583120204603) internal successors, (2251), 1564 states have internal predecessors, (2251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2251 transitions. [2025-02-05 10:38:26,054 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2251 transitions. Word has length 225 [2025-02-05 10:38:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:26,054 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 2251 transitions. [2025-02-05 10:38:26,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2251 transitions. [2025-02-05 10:38:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-05 10:38:26,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:26,059 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:26,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:38:26,059 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:26,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash -251669054, now seen corresponding path program 1 times [2025-02-05 10:38:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:26,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624024828] [2025-02-05 10:38:26,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:26,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:26,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-05 10:38:26,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-05 10:38:26,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:26,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-02-05 10:38:26,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:26,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624024828] [2025-02-05 10:38:26,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624024828] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:26,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729750949] [2025-02-05 10:38:26,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:26,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:26,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:26,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:26,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:38:26,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-05 10:38:26,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-05 10:38:26,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:26,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:26,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:38:26,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-02-05 10:38:26,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-02-05 10:38:26,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729750949] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:26,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:26,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 10:38:26,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733610535] [2025-02-05 10:38:26,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:26,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:38:26,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:26,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:38:26,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:38:26,540 INFO L87 Difference]: Start difference. First operand 1565 states and 2251 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:27,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:27,169 INFO L93 Difference]: Finished difference Result 6035 states and 8671 transitions. [2025-02-05 10:38:27,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:38:27,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 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 253 [2025-02-05 10:38:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:27,182 INFO L225 Difference]: With dead ends: 6035 [2025-02-05 10:38:27,182 INFO L226 Difference]: Without dead ends: 4478 [2025-02-05 10:38:27,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:38:27,185 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 274 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:27,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1335 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:38:27,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2025-02-05 10:38:27,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 3398. [2025-02-05 10:38:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3398 states, 3397 states have (on average 1.40270827200471) internal successors, (4765), 3397 states have internal predecessors, (4765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4765 transitions. [2025-02-05 10:38:27,255 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4765 transitions. Word has length 253 [2025-02-05 10:38:27,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:27,255 INFO L471 AbstractCegarLoop]: Abstraction has 3398 states and 4765 transitions. [2025-02-05 10:38:27,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4765 transitions. [2025-02-05 10:38:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-05 10:38:27,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:27,261 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:27,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:38:27,461 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,SelfDestructingSolverStorable9 [2025-02-05 10:38:27,462 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:27,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:27,462 INFO L85 PathProgramCache]: Analyzing trace with hash -107259359, now seen corresponding path program 1 times [2025-02-05 10:38:27,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:27,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881942354] [2025-02-05 10:38:27,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:27,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:27,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-05 10:38:27,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-05 10:38:27,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:27,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-02-05 10:38:27,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:27,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881942354] [2025-02-05 10:38:27,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881942354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:27,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:27,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:27,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159215398] [2025-02-05 10:38:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:27,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:27,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:27,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:27,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:27,543 INFO L87 Difference]: Start difference. First operand 3398 states and 4765 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:27,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:27,602 INFO L93 Difference]: Finished difference Result 9681 states and 13694 transitions. [2025-02-05 10:38:27,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:27,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 253 [2025-02-05 10:38:27,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:27,614 INFO L225 Difference]: With dead ends: 9681 [2025-02-05 10:38:27,615 INFO L226 Difference]: Without dead ends: 4220 [2025-02-05 10:38:27,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:27,622 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 109 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:27,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 491 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2025-02-05 10:38:27,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 3918. [2025-02-05 10:38:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 3917 states have (on average 1.4237937196834312) internal successors, (5577), 3917 states have internal predecessors, (5577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5577 transitions. [2025-02-05 10:38:27,715 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5577 transitions. Word has length 253 [2025-02-05 10:38:27,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:27,716 INFO L471 AbstractCegarLoop]: Abstraction has 3918 states and 5577 transitions. [2025-02-05 10:38:27,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5577 transitions. [2025-02-05 10:38:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-05 10:38:27,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:27,721 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:27,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 10:38:27,721 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:27,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:27,722 INFO L85 PathProgramCache]: Analyzing trace with hash -592204608, now seen corresponding path program 1 times [2025-02-05 10:38:27,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:27,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094750218] [2025-02-05 10:38:27,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:27,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:27,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-05 10:38:27,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-05 10:38:27,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:27,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2025-02-05 10:38:27,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:27,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094750218] [2025-02-05 10:38:27,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094750218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:27,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:27,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:27,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994559435] [2025-02-05 10:38:27,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:27,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:27,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:27,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:27,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:27,774 INFO L87 Difference]: Start difference. First operand 3918 states and 5577 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:27,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:27,885 INFO L93 Difference]: Finished difference Result 7966 states and 11316 transitions. [2025-02-05 10:38:27,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:27,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 253 [2025-02-05 10:38:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:27,897 INFO L225 Difference]: With dead ends: 7966 [2025-02-05 10:38:27,898 INFO L226 Difference]: Without dead ends: 4056 [2025-02-05 10:38:27,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:27,902 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:27,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 272 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2025-02-05 10:38:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 4056. [2025-02-05 10:38:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 4055 states have (on average 1.4167694204685573) internal successors, (5745), 4055 states have internal predecessors, (5745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 5745 transitions. [2025-02-05 10:38:27,975 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 5745 transitions. Word has length 253 [2025-02-05 10:38:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:27,975 INFO L471 AbstractCegarLoop]: Abstraction has 4056 states and 5745 transitions. [2025-02-05 10:38:27,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 5745 transitions. [2025-02-05 10:38:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 10:38:27,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:27,980 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:27,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 10:38:27,981 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:27,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash -273623518, now seen corresponding path program 1 times [2025-02-05 10:38:27,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:27,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121886772] [2025-02-05 10:38:27,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:27,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-05 10:38:27,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-05 10:38:27,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:27,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-02-05 10:38:28,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:28,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121886772] [2025-02-05 10:38:28,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121886772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:28,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:28,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:28,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390733765] [2025-02-05 10:38:28,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:28,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:28,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:28,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:28,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:28,039 INFO L87 Difference]: Start difference. First operand 4056 states and 5745 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:28,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:28,156 INFO L93 Difference]: Finished difference Result 8454 states and 11940 transitions. [2025-02-05 10:38:28,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:28,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2025-02-05 10:38:28,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:28,169 INFO L225 Difference]: With dead ends: 8454 [2025-02-05 10:38:28,169 INFO L226 Difference]: Without dead ends: 4406 [2025-02-05 10:38:28,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:28,174 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:28,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 272 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:28,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2025-02-05 10:38:28,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 4406. [2025-02-05 10:38:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4406 states, 4405 states have (on average 1.3995459704880817) internal successors, (6165), 4405 states have internal predecessors, (6165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4406 states to 4406 states and 6165 transitions. [2025-02-05 10:38:28,273 INFO L78 Accepts]: Start accepts. Automaton has 4406 states and 6165 transitions. Word has length 273 [2025-02-05 10:38:28,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:28,274 INFO L471 AbstractCegarLoop]: Abstraction has 4406 states and 6165 transitions. [2025-02-05 10:38:28,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4406 states and 6165 transitions. [2025-02-05 10:38:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-05 10:38:28,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:28,279 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:28,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 10:38:28,279 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:28,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:28,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1478551218, now seen corresponding path program 1 times [2025-02-05 10:38:28,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:28,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335339745] [2025-02-05 10:38:28,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:28,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:28,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-05 10:38:28,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-05 10:38:28,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:28,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 493 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-02-05 10:38:28,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:28,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335339745] [2025-02-05 10:38:28,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335339745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:28,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:28,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:28,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795097868] [2025-02-05 10:38:28,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:28,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:28,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:28,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:28,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:28,368 INFO L87 Difference]: Start difference. First operand 4406 states and 6165 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:28,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:28,480 INFO L93 Difference]: Finished difference Result 9182 states and 12836 transitions. [2025-02-05 10:38:28,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:28,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 299 [2025-02-05 10:38:28,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:28,492 INFO L225 Difference]: With dead ends: 9182 [2025-02-05 10:38:28,492 INFO L226 Difference]: Without dead ends: 4784 [2025-02-05 10:38:28,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:28,497 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:28,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 272 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:28,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4784 states. [2025-02-05 10:38:28,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4784 to 4784. [2025-02-05 10:38:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4784 states, 4783 states have (on average 1.382605059586034) internal successors, (6613), 4783 states have internal predecessors, (6613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4784 states to 4784 states and 6613 transitions. [2025-02-05 10:38:28,570 INFO L78 Accepts]: Start accepts. Automaton has 4784 states and 6613 transitions. Word has length 299 [2025-02-05 10:38:28,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:28,570 INFO L471 AbstractCegarLoop]: Abstraction has 4784 states and 6613 transitions. [2025-02-05 10:38:28,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4784 states and 6613 transitions. [2025-02-05 10:38:28,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-02-05 10:38:28,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:28,576 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:28,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 10:38:28,576 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:28,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:28,577 INFO L85 PathProgramCache]: Analyzing trace with hash 263313568, now seen corresponding path program 1 times [2025-02-05 10:38:28,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:28,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676562581] [2025-02-05 10:38:28,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:28,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:28,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-02-05 10:38:28,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-02-05 10:38:28,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:28,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-02-05 10:38:28,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:28,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676562581] [2025-02-05 10:38:28,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676562581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:28,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:28,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:28,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132486477] [2025-02-05 10:38:28,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:28,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:28,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:28,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:28,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:28,636 INFO L87 Difference]: Start difference. First operand 4784 states and 6613 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:28,784 INFO L93 Difference]: Finished difference Result 9966 states and 13788 transitions. [2025-02-05 10:38:28,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:28,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 322 [2025-02-05 10:38:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:28,800 INFO L225 Difference]: With dead ends: 9966 [2025-02-05 10:38:28,802 INFO L226 Difference]: Without dead ends: 5190 [2025-02-05 10:38:28,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:28,807 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:28,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 272 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:28,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2025-02-05 10:38:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 4391. [2025-02-05 10:38:28,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4391 states, 4390 states have (on average 1.3824601366742597) internal successors, (6069), 4390 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4391 states to 4391 states and 6069 transitions. [2025-02-05 10:38:28,899 INFO L78 Accepts]: Start accepts. Automaton has 4391 states and 6069 transitions. Word has length 322 [2025-02-05 10:38:28,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:28,899 INFO L471 AbstractCegarLoop]: Abstraction has 4391 states and 6069 transitions. [2025-02-05 10:38:28,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4391 states and 6069 transitions. [2025-02-05 10:38:28,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-02-05 10:38:28,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:28,905 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:28,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 10:38:28,906 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:28,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:28,906 INFO L85 PathProgramCache]: Analyzing trace with hash 534493074, now seen corresponding path program 1 times [2025-02-05 10:38:28,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:28,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617864200] [2025-02-05 10:38:28,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:28,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:28,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-05 10:38:28,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-05 10:38:28,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:28,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:29,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2025-02-05 10:38:29,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:29,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617864200] [2025-02-05 10:38:29,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617864200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:29,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:29,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:29,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513221665] [2025-02-05 10:38:29,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:29,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:29,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:29,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:29,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:29,042 INFO L87 Difference]: Start difference. First operand 4391 states and 6069 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:29,121 INFO L93 Difference]: Finished difference Result 13143 states and 18162 transitions. [2025-02-05 10:38:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:29,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 354 [2025-02-05 10:38:29,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:29,135 INFO L225 Difference]: With dead ends: 13143 [2025-02-05 10:38:29,135 INFO L226 Difference]: Without dead ends: 8760 [2025-02-05 10:38:29,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:29,140 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 125 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:29,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 486 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8760 states. [2025-02-05 10:38:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8760 to 8575. [2025-02-05 10:38:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8575 states, 8574 states have (on average 1.385117797993935) internal successors, (11876), 8574 states have internal predecessors, (11876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8575 states to 8575 states and 11876 transitions. [2025-02-05 10:38:29,276 INFO L78 Accepts]: Start accepts. Automaton has 8575 states and 11876 transitions. Word has length 354 [2025-02-05 10:38:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:29,276 INFO L471 AbstractCegarLoop]: Abstraction has 8575 states and 11876 transitions. [2025-02-05 10:38:29,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 8575 states and 11876 transitions. [2025-02-05 10:38:29,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-02-05 10:38:29,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:29,313 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:29,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 10:38:29,313 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:29,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1870920873, now seen corresponding path program 1 times [2025-02-05 10:38:29,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:29,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084262780] [2025-02-05 10:38:29,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:29,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:29,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-02-05 10:38:29,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-02-05 10:38:29,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:29,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 871 proven. 26 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2025-02-05 10:38:29,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:29,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084262780] [2025-02-05 10:38:29,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084262780] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:29,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333996576] [2025-02-05 10:38:29,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:29,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:29,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:29,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:29,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 10:38:29,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-02-05 10:38:29,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-02-05 10:38:29,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:29,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:29,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:38:29,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:29,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2025-02-05 10:38:29,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:29,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333996576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:29,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:29,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:38:29,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032124422] [2025-02-05 10:38:29,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:29,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:29,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:29,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:29,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:29,818 INFO L87 Difference]: Start difference. First operand 8575 states and 11876 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:29,878 INFO L93 Difference]: Finished difference Result 10751 states and 14913 transitions. [2025-02-05 10:38:29,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:29,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 355 [2025-02-05 10:38:29,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:29,890 INFO L225 Difference]: With dead ends: 10751 [2025-02-05 10:38:29,891 INFO L226 Difference]: Without dead ends: 8530 [2025-02-05 10:38:29,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:29,895 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 83 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:29,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 480 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:29,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8530 states. [2025-02-05 10:38:29,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8530 to 6140. [2025-02-05 10:38:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6140 states, 6139 states have (on average 1.3924091871640332) internal successors, (8548), 6139 states have internal predecessors, (8548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:30,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6140 states to 6140 states and 8548 transitions. [2025-02-05 10:38:30,004 INFO L78 Accepts]: Start accepts. Automaton has 6140 states and 8548 transitions. Word has length 355 [2025-02-05 10:38:30,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:30,005 INFO L471 AbstractCegarLoop]: Abstraction has 6140 states and 8548 transitions. [2025-02-05 10:38:30,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 6140 states and 8548 transitions. [2025-02-05 10:38:30,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-02-05 10:38:30,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:30,014 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:30,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:38:30,214 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,SelfDestructingSolverStorable16 [2025-02-05 10:38:30,215 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:30,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:30,215 INFO L85 PathProgramCache]: Analyzing trace with hash 893494291, now seen corresponding path program 1 times [2025-02-05 10:38:30,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:30,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909051090] [2025-02-05 10:38:30,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:30,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:30,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-02-05 10:38:30,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-02-05 10:38:30,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:30,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2025-02-05 10:38:30,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:30,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909051090] [2025-02-05 10:38:30,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909051090] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:30,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088838201] [2025-02-05 10:38:30,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:30,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:30,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:30,356 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:30,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 10:38:30,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-02-05 10:38:30,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-02-05 10:38:30,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:30,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:30,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:38:30,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2025-02-05 10:38:30,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2025-02-05 10:38:30,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088838201] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:30,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:30,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 10:38:30,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694708087] [2025-02-05 10:38:30,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:30,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:38:30,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:30,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:38:30,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:38:30,637 INFO L87 Difference]: Start difference. First operand 6140 states and 8548 transitions. Second operand has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:31,002 INFO L93 Difference]: Finished difference Result 13760 states and 19139 transitions. [2025-02-05 10:38:31,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:38:31,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 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 417 [2025-02-05 10:38:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:31,013 INFO L225 Difference]: With dead ends: 13760 [2025-02-05 10:38:31,013 INFO L226 Difference]: Without dead ends: 7326 [2025-02-05 10:38:31,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:38:31,021 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 243 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:31,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 586 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:38:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7326 states. [2025-02-05 10:38:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7326 to 6032. [2025-02-05 10:38:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6032 states, 6031 states have (on average 1.3669374896368762) internal successors, (8244), 6031 states have internal predecessors, (8244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6032 states to 6032 states and 8244 transitions. [2025-02-05 10:38:31,147 INFO L78 Accepts]: Start accepts. Automaton has 6032 states and 8244 transitions. Word has length 417 [2025-02-05 10:38:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:31,148 INFO L471 AbstractCegarLoop]: Abstraction has 6032 states and 8244 transitions. [2025-02-05 10:38:31,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 6032 states and 8244 transitions. [2025-02-05 10:38:31,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-02-05 10:38:31,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:31,158 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:31,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 10:38:31,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:31,359 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:31,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:31,359 INFO L85 PathProgramCache]: Analyzing trace with hash 286233163, now seen corresponding path program 1 times [2025-02-05 10:38:31,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:31,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540636893] [2025-02-05 10:38:31,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:31,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:31,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-02-05 10:38:31,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-02-05 10:38:31,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:31,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:31,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1671 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2025-02-05 10:38:31,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:31,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540636893] [2025-02-05 10:38:31,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540636893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:31,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:31,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:31,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410635815] [2025-02-05 10:38:31,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:31,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:31,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:31,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:31,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:31,601 INFO L87 Difference]: Start difference. First operand 6032 states and 8244 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:31,720 INFO L93 Difference]: Finished difference Result 11052 states and 15168 transitions. [2025-02-05 10:38:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:31,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 509 [2025-02-05 10:38:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:31,729 INFO L225 Difference]: With dead ends: 11052 [2025-02-05 10:38:31,729 INFO L226 Difference]: Without dead ends: 6223 [2025-02-05 10:38:31,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:31,734 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 38 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:31,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 202 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:31,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6223 states. [2025-02-05 10:38:31,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6223 to 6223. [2025-02-05 10:38:31,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6223 states, 6222 states have (on average 1.3672452587592414) internal successors, (8507), 6222 states have internal predecessors, (8507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 8507 transitions. [2025-02-05 10:38:31,861 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 8507 transitions. Word has length 509 [2025-02-05 10:38:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:31,862 INFO L471 AbstractCegarLoop]: Abstraction has 6223 states and 8507 transitions. [2025-02-05 10:38:31,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 8507 transitions. [2025-02-05 10:38:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2025-02-05 10:38:31,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:31,874 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:31,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 10:38:31,874 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:31,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:31,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1487574635, now seen corresponding path program 1 times [2025-02-05 10:38:31,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:31,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807474306] [2025-02-05 10:38:31,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:31,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:31,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-02-05 10:38:31,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-02-05 10:38:31,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:31,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3171 backedges. 1694 proven. 0 refuted. 0 times theorem prover too weak. 1477 trivial. 0 not checked. [2025-02-05 10:38:32,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:32,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807474306] [2025-02-05 10:38:32,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807474306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:32,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:32,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:32,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043047164] [2025-02-05 10:38:32,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:32,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:32,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:32,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:32,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:32,046 INFO L87 Difference]: Start difference. First operand 6223 states and 8507 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 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-02-05 10:38:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:32,173 INFO L93 Difference]: Finished difference Result 12325 states and 16786 transitions. [2025-02-05 10:38:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:32,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 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 511 [2025-02-05 10:38:32,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:32,182 INFO L225 Difference]: With dead ends: 12325 [2025-02-05 10:38:32,182 INFO L226 Difference]: Without dead ends: 6121 [2025-02-05 10:38:32,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:32,189 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:32,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 268 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6121 states. [2025-02-05 10:38:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6121 to 6121. [2025-02-05 10:38:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6121 states, 6120 states have (on average 1.3392156862745097) internal successors, (8196), 6120 states have internal predecessors, (8196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 8196 transitions. [2025-02-05 10:38:32,269 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 8196 transitions. Word has length 511 [2025-02-05 10:38:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:32,270 INFO L471 AbstractCegarLoop]: Abstraction has 6121 states and 8196 transitions. [2025-02-05 10:38:32,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 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-02-05 10:38:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 8196 transitions. [2025-02-05 10:38:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2025-02-05 10:38:32,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:32,278 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:32,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 10:38:32,279 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:32,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:32,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1999032655, now seen corresponding path program 1 times [2025-02-05 10:38:32,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:32,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906012572] [2025-02-05 10:38:32,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:32,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:32,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-02-05 10:38:32,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-02-05 10:38:32,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:32,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:32,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1744 proven. 206 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2025-02-05 10:38:32,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:32,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906012572] [2025-02-05 10:38:32,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906012572] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:32,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410787845] [2025-02-05 10:38:32,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:32,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:32,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:32,600 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:32,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 10:38:32,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-02-05 10:38:32,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-02-05 10:38:32,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:32,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:32,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:38:32,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1792 proven. 239 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2025-02-05 10:38:33,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1887 proven. 144 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2025-02-05 10:38:34,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410787845] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:34,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:34,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-05 10:38:34,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168367915] [2025-02-05 10:38:34,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:34,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 10:38:34,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:34,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 10:38:34,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:38:34,644 INFO L87 Difference]: Start difference. First operand 6121 states and 8196 transitions. Second operand has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:36,221 INFO L93 Difference]: Finished difference Result 24654 states and 32955 transitions. [2025-02-05 10:38:36,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 10:38:36,222 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 513 [2025-02-05 10:38:36,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:36,248 INFO L225 Difference]: With dead ends: 24654 [2025-02-05 10:38:36,249 INFO L226 Difference]: Without dead ends: 18487 [2025-02-05 10:38:36,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1055 GetRequests, 1033 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2025-02-05 10:38:36,258 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 856 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:36,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1550 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 10:38:36,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18487 states. [2025-02-05 10:38:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18487 to 17889. [2025-02-05 10:38:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17889 states, 17888 states have (on average 1.3000894454382828) internal successors, (23256), 17888 states have internal predecessors, (23256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17889 states to 17889 states and 23256 transitions. [2025-02-05 10:38:36,573 INFO L78 Accepts]: Start accepts. Automaton has 17889 states and 23256 transitions. Word has length 513 [2025-02-05 10:38:36,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:36,574 INFO L471 AbstractCegarLoop]: Abstraction has 17889 states and 23256 transitions. [2025-02-05 10:38:36,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 17889 states and 23256 transitions. [2025-02-05 10:38:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2025-02-05 10:38:36,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:36,597 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:36,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:36,798 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,SelfDestructingSolverStorable20 [2025-02-05 10:38:36,798 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:36,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:36,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1805231435, now seen corresponding path program 2 times [2025-02-05 10:38:36,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:36,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693326905] [2025-02-05 10:38:36,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:38:36,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:36,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 583 statements into 2 equivalence classes. [2025-02-05 10:38:36,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 583 of 583 statements. [2025-02-05 10:38:36,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:38:36,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2025-02-05 10:38:36,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:36,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693326905] [2025-02-05 10:38:36,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693326905] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:36,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353476048] [2025-02-05 10:38:36,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:38:36,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:36,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:36,971 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:36,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 10:38:37,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 583 statements into 2 equivalence classes. [2025-02-05 10:38:37,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 583 of 583 statements. [2025-02-05 10:38:37,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:38:37,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:37,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:38:37,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2025-02-05 10:38:37,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2025-02-05 10:38:37,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353476048] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:37,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:37,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-05 10:38:37,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400787836] [2025-02-05 10:38:37,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:37,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:38:37,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:37,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:38:37,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:38:37,255 INFO L87 Difference]: Start difference. First operand 17889 states and 23256 transitions. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:37,973 INFO L93 Difference]: Finished difference Result 26111 states and 33809 transitions. [2025-02-05 10:38:37,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:38:37,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 583 [2025-02-05 10:38:37,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:37,976 INFO L225 Difference]: With dead ends: 26111 [2025-02-05 10:38:37,976 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:38:37,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1176 GetRequests, 1166 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:38:37,989 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 224 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:37,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1136 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:38:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:38:37,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:38:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:37,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:38:37,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 583 [2025-02-05 10:38:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:37,992 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:38:37,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:38:37,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:38:37,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:38:38,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:38,195 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,SelfDestructingSolverStorable21 [2025-02-05 10:38:38,198 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, 1] [2025-02-05 10:38:38,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:38:44,912 WARN L286 SmtUtils]: Spent 6.70s on a formula simplification. DAG size of input: 702 DAG size of output: 517 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-02-05 10:38:47,957 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:38:47,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:38:47 BoogieIcfgContainer [2025-02-05 10:38:47,994 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:38:47,995 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:38:47,995 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:38:47,995 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:38:47,997 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:23" (3/4) ... [2025-02-05 10:38:47,999 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:38:48,014 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-05 10:38:48,015 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:38:48,015 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:38:48,016 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:38:48,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:38:48,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:38:48,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:38:48,110 INFO L158 Benchmark]: Toolchain (without parser) took 25235.85ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 105.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 467.7MB. Max. memory is 16.1GB. [2025-02-05 10:38:48,110 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:38:48,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.61ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 89.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 10:38:48,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.62ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:38:48,111 INFO L158 Benchmark]: Boogie Preprocessor took 35.23ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 84.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:38:48,111 INFO L158 Benchmark]: IcfgBuilder took 586.33ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 46.7MB in the end (delta: 37.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 10:38:48,112 INFO L158 Benchmark]: TraceAbstraction took 24198.82ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 46.7MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-02-05 10:38:48,112 INFO L158 Benchmark]: Witness Printer took 113.97ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:38:48,113 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.18ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.61ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 89.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.62ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.23ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 84.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 586.33ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 46.7MB in the end (delta: 37.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 24198.82ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 46.7MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 113.97ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 679]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 22, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2646 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2646 mSDsluCounter, 10634 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5398 mSDsCounter, 444 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5710 IncrementalHoareTripleChecker+Invalid, 6154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 444 mSolverCounterUnsat, 5236 mSDtfsCounter, 5710 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3996 GetRequests, 3931 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17889occurred in iteration=21, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 6696 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 7886 NumberOfCodeBlocks, 7886 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 9621 ConstructedInterpolants, 0 QuantifiedInterpolants, 19597 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3351 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 31 InterpolantComputations, 18 PerfectInterpolantSequences, 43653/44442 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 111]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (8466 == s__state)) && (2 == blastFlag)) && (8497 <= s__s3__tmp__next_state___0)) && (s__s3__tmp__next_state___0 <= 8576)) || ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (blastFlag == 1)) && (s__state <= 8448)) && (8497 <= s__s3__tmp__next_state___0)) && (s__s3__tmp__next_state___0 <= 8576))) || ((blastFlag == 1) && ((1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648))) || (((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4249)))) || ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (8673 != s__state)) && (3 == blastFlag)) && (s__s3__tmp__next_state___0 <= 8576)) && (8656 <= s__state))) || (((((2 == blastFlag) && (8497 <= s__s3__tmp__next_state___0)) && ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 4294967296) + s__state) + 4294967296) == (((long long) 2 * ag_X) + ((long long) 2 * ag_Y))) && (1073741824 <= ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) || (((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 4294967296) + s__state) == (((long long) 2 * ag_X) + ((long long) 2 * ag_Y))))) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8655))) || ((((3 == blastFlag) && (8640 <= s__s3__tmp__next_state___0)) && (8640 <= s__state)) && (0 != s__hit))) || ((((s__s3__tmp__next_state___0 <= 8495) && (s__state <= 8496)) && (2 == blastFlag)) && ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 4294967296) + s__state) + 4294967296) == (((long long) 2 * ag_X) + ((long long) 2 * ag_Y))) && (1073741824 <= ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) || (((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 4294967296) + s__state) == (((long long) 2 * ag_X) + ((long long) 2 * ag_Y)))))) || ((2 == blastFlag) && (0 != s__hit))) || ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (8640 <= s__state)) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8655))) || ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (s__state <= 8448)) && (8497 <= s__s3__tmp__next_state___0)) && (s__s3__tmp__next_state___0 <= 8576))) || ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (8544 == s__state))) || (((blastFlag == 1) && (s__state <= 8448)) && (3 == s__s3__tmp__next_state___0))) || ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (8466 == s__state)) && (blastFlag == 1))) || (((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (8497 <= s__s3__tmp__next_state___0)) && (8497 <= s__state)) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8576))) || ((((8673 != s__state) && (3 == blastFlag)) && (0 != s__hit)) && (8656 <= s__state))) || (((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (8497 <= s__s3__tmp__next_state___0)) && (8512 <= s__state)) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8655))) || (((s__state == 8528) && ((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648))))) && (2 == blastFlag))) || ((((s__s3__tmp__next_state___0 <= 8495) && (2 == blastFlag)) && (s__state <= 8495)) && ((1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648))) || (((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4249)))) || ((((3 == blastFlag) && (8640 <= s__s3__tmp__next_state___0)) && (s__state <= 8448)) && (0 != s__hit))) || (((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (8673 != s__state)) && (2 == blastFlag)) && (s__state != 8672)) && (s__s3__tmp__next_state___0 <= 8576)) && (8656 <= s__state))) || (((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (blastFlag == 1)) && (8512 <= s__state)) && (s__state <= 8655))) || ((blastFlag == 1) && (((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 4294967296) + s__state) == (((long long) 2 * ag_X) + ((long long) 2 * ag_Y))))) || ((blastFlag == 1) && (0 != s__hit))) || ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (8560 == s__state))) || ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (s__state == 8512))) || (blastFlag == 0)) || (((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (blastFlag == 1)) && (8497 <= s__s3__tmp__next_state___0)) && (8497 <= s__state)) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8576))) || (((8673 != s__state) && (blastFlag == 1)) && (8656 <= s__state))) || ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (3 == blastFlag)) && (s__state <= 8448)) && (3 == s__s3__tmp__next_state___0)) && (0 == s__hit))) RESULT: Ultimate proved your program to be correct! [2025-02-05 10:38:48,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE