./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label26.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/eca-rers2012/Problem13_label26.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 f7d9d441800fd040181450c0920264f1b228689c17b8db097e43b17ec5ad46cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:44:05,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:44:05,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:44:05,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:44:05,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:44:05,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:44:05,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:44:05,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:44:05,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:44:05,944 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:44:05,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:44:05,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:44:05,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:44:05,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:44:05,946 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:44:05,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:44:05,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:44:05,946 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:44:05,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:44:05,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:44:05,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:44:05,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:44:05,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:44:05,947 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:44:05,947 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:44:05,947 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:44:05,947 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:44:05,947 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:44:05,947 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:44:05,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:44:05,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:44:05,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:44:05,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:44:05,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:44:05,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:44:05,948 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:44:05,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:44:05,948 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:44:05,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:44:05,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:44:05,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:44:05,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:44:05,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:44:05,949 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 -> f7d9d441800fd040181450c0920264f1b228689c17b8db097e43b17ec5ad46cc [2025-02-05 11:44:06,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:44:06,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:44:06,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:44:06,212 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:44:06,212 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:44:06,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label26.c [2025-02-05 11:44:07,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22a10cc41/3b3a329df14849a9891e3114846896e3/FLAG7869c1b2f [2025-02-05 11:44:08,046 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:44:08,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label26.c [2025-02-05 11:44:08,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22a10cc41/3b3a329df14849a9891e3114846896e3/FLAG7869c1b2f [2025-02-05 11:44:08,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22a10cc41/3b3a329df14849a9891e3114846896e3 [2025-02-05 11:44:08,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:44:08,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:44:08,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:44:08,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:44:08,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:44:08,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:44:08" (1/1) ... [2025-02-05 11:44:08,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1451765b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:08, skipping insertion in model container [2025-02-05 11:44:08,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:44:08" (1/1) ... [2025-02-05 11:44:08,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:44:08,662 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/eca-rers2012/Problem13_label26.c[5554,5567] [2025-02-05 11:44:09,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:44:09,191 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:44:09,206 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/eca-rers2012/Problem13_label26.c[5554,5567] [2025-02-05 11:44:09,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:44:09,524 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:44:09,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:09 WrapperNode [2025-02-05 11:44:09,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:44:09,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:44:09,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:44:09,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:44:09,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:09" (1/1) ... [2025-02-05 11:44:09,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:09" (1/1) ... [2025-02-05 11:44:09,989 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-02-05 11:44:09,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:44:09,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:44:09,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:44:09,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:44:09,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:09" (1/1) ... [2025-02-05 11:44:09,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:09" (1/1) ... [2025-02-05 11:44:10,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:09" (1/1) ... [2025-02-05 11:44:10,282 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 11:44:10,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:09" (1/1) ... [2025-02-05 11:44:10,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:09" (1/1) ... [2025-02-05 11:44:10,442 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:09" (1/1) ... [2025-02-05 11:44:10,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:09" (1/1) ... [2025-02-05 11:44:10,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:09" (1/1) ... [2025-02-05 11:44:10,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:09" (1/1) ... [2025-02-05 11:44:10,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:44:10,642 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:44:10,642 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:44:10,642 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:44:10,643 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:09" (1/1) ... [2025-02-05 11:44:10,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:44:10,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:44:10,665 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 11:44:10,672 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 11:44:10,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:44:10,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:44:10,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:44:10,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:44:10,739 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:44:10,740 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:44:15,080 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-02-05 11:44:15,080 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:44:15,080 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:44:15,282 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-02-05 11:44:15,283 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:44:15,318 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:44:15,318 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:44:15,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:44:15 BoogieIcfgContainer [2025-02-05 11:44:15,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:44:15,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:44:15,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:44:15,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:44:15,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:44:08" (1/3) ... [2025-02-05 11:44:15,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@927709c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:44:15, skipping insertion in model container [2025-02-05 11:44:15,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:09" (2/3) ... [2025-02-05 11:44:15,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@927709c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:44:15, skipping insertion in model container [2025-02-05 11:44:15,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:44:15" (3/3) ... [2025-02-05 11:44:15,333 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label26.c [2025-02-05 11:44:15,360 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:44:15,361 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label26.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:44:15,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:44:15,473 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;@3e6d0fd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:44:15,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:44:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 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 11:44:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 11:44:15,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:15,484 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] [2025-02-05 11:44:15,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:15,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:15,490 INFO L85 PathProgramCache]: Analyzing trace with hash -83525906, now seen corresponding path program 1 times [2025-02-05 11:44:15,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:15,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790352006] [2025-02-05 11:44:15,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:15,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:15,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 11:44:15,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 11:44:15,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:15,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:15,806 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 11:44:15,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:15,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790352006] [2025-02-05 11:44:15,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790352006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:15,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:15,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:15,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787280143] [2025-02-05 11:44:15,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:15,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:15,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:15,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:15,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:15,835 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:19,991 INFO L93 Difference]: Finished difference Result 3082 states and 5686 transitions. [2025-02-05 11:44:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:19,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-05 11:44:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:20,016 INFO L225 Difference]: With dead ends: 3082 [2025-02-05 11:44:20,016 INFO L226 Difference]: Without dead ends: 1899 [2025-02-05 11:44:20,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:44:20,031 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1001 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:20,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 646 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-05 11:44:20,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-02-05 11:44:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1894. [2025-02-05 11:44:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.7374537770734284) internal successors, (3289), 1893 states have internal predecessors, (3289), 0 states have call successors, (0), 0 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 11:44:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3289 transitions. [2025-02-05 11:44:20,198 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3289 transitions. Word has length 38 [2025-02-05 11:44:20,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:20,199 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 3289 transitions. [2025-02-05 11:44:20,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:20,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3289 transitions. [2025-02-05 11:44:20,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 11:44:20,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:20,202 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-02-05 11:44:20,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:44:20,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:20,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:20,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2002936697, now seen corresponding path program 1 times [2025-02-05 11:44:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:20,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714800113] [2025-02-05 11:44:20,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:20,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:20,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 11:44:20,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 11:44:20,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:20,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:20,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:20,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714800113] [2025-02-05 11:44:20,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714800113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:20,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:20,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:20,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169638487] [2025-02-05 11:44:20,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:20,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:20,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:20,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:20,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:20,638 INFO L87 Difference]: Start difference. First operand 1894 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 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 11:44:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:24,103 INFO L93 Difference]: Finished difference Result 5437 states and 9566 transitions. [2025-02-05 11:44:24,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:24,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2025-02-05 11:44:24,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:24,124 INFO L225 Difference]: With dead ends: 5437 [2025-02-05 11:44:24,125 INFO L226 Difference]: Without dead ends: 3545 [2025-02-05 11:44:24,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:44:24,130 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3127 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 3127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:24,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 881 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 3127 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 11:44:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2025-02-05 11:44:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 3484. [2025-02-05 11:44:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 3483 states have (on average 1.5865633074935401) internal successors, (5526), 3483 states have internal predecessors, (5526), 0 states have call successors, (0), 0 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 11:44:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 5526 transitions. [2025-02-05 11:44:24,228 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 5526 transitions. Word has length 103 [2025-02-05 11:44:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:24,228 INFO L471 AbstractCegarLoop]: Abstraction has 3484 states and 5526 transitions. [2025-02-05 11:44:24,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 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 11:44:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 5526 transitions. [2025-02-05 11:44:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 11:44:24,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:24,230 INFO L218 NwaCegarLoop]: trace histogram [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, 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 11:44:24,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:44:24,231 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:24,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1540328853, now seen corresponding path program 1 times [2025-02-05 11:44:24,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:24,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172429667] [2025-02-05 11:44:24,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:24,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:24,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 11:44:24,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 11:44:24,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:24,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:24,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:24,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172429667] [2025-02-05 11:44:24,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172429667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:24,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:24,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317034051] [2025-02-05 11:44:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:24,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:24,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:24,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:24,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:24,466 INFO L87 Difference]: Start difference. First operand 3484 states and 5526 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:27,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:27,611 INFO L93 Difference]: Finished difference Result 10138 states and 16134 transitions. [2025-02-05 11:44:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:27,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-02-05 11:44:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:27,628 INFO L225 Difference]: With dead ends: 10138 [2025-02-05 11:44:27,628 INFO L226 Difference]: Without dead ends: 6656 [2025-02-05 11:44:27,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:44:27,633 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 871 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:27,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1136 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:44:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6656 states. [2025-02-05 11:44:27,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6656 to 6655. [2025-02-05 11:44:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6655 states, 6654 states have (on average 1.4171926660655245) internal successors, (9430), 6654 states have internal predecessors, (9430), 0 states have call successors, (0), 0 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 11:44:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6655 states to 6655 states and 9430 transitions. [2025-02-05 11:44:27,717 INFO L78 Accepts]: Start accepts. Automaton has 6655 states and 9430 transitions. Word has length 104 [2025-02-05 11:44:27,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:27,717 INFO L471 AbstractCegarLoop]: Abstraction has 6655 states and 9430 transitions. [2025-02-05 11:44:27,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:27,718 INFO L276 IsEmpty]: Start isEmpty. Operand 6655 states and 9430 transitions. [2025-02-05 11:44:27,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 11:44:27,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:27,719 INFO L218 NwaCegarLoop]: trace histogram [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, 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 11:44:27,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:44:27,719 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:27,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash 380306173, now seen corresponding path program 1 times [2025-02-05 11:44:27,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:27,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972341247] [2025-02-05 11:44:27,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:27,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:27,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 11:44:27,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 11:44:27,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:27,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:27,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:27,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972341247] [2025-02-05 11:44:27,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972341247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:27,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:27,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:27,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868888879] [2025-02-05 11:44:27,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:27,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:27,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:27,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:27,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:27,828 INFO L87 Difference]: Start difference. First operand 6655 states and 9430 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 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 11:44:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:31,067 INFO L93 Difference]: Finished difference Result 14120 states and 20673 transitions. [2025-02-05 11:44:31,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:31,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-02-05 11:44:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:31,092 INFO L225 Difference]: With dead ends: 14120 [2025-02-05 11:44:31,092 INFO L226 Difference]: Without dead ends: 7467 [2025-02-05 11:44:31,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:44:31,113 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 872 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:31,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1176 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:44:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2025-02-05 11:44:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7456. [2025-02-05 11:44:31,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 1.3389671361502347) internal successors, (9982), 7455 states have internal predecessors, (9982), 0 states have call successors, (0), 0 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 11:44:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 9982 transitions. [2025-02-05 11:44:31,386 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 9982 transitions. Word has length 107 [2025-02-05 11:44:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:31,386 INFO L471 AbstractCegarLoop]: Abstraction has 7456 states and 9982 transitions. [2025-02-05 11:44:31,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 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 11:44:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 9982 transitions. [2025-02-05 11:44:31,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 11:44:31,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:31,389 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:31,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:44:31,389 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:31,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:31,390 INFO L85 PathProgramCache]: Analyzing trace with hash -351682772, now seen corresponding path program 1 times [2025-02-05 11:44:31,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:31,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154735237] [2025-02-05 11:44:31,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:31,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:31,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 11:44:31,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 11:44:31,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:31,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:31,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:31,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154735237] [2025-02-05 11:44:31,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154735237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:31,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:31,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:31,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342722176] [2025-02-05 11:44:31,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:31,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:31,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:31,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:31,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:31,832 INFO L87 Difference]: Start difference. First operand 7456 states and 9982 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 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 11:44:34,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:34,645 INFO L93 Difference]: Finished difference Result 14123 states and 19150 transitions. [2025-02-05 11:44:34,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:34,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-02-05 11:44:34,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:34,668 INFO L225 Difference]: With dead ends: 14123 [2025-02-05 11:44:34,670 INFO L226 Difference]: Without dead ends: 7456 [2025-02-05 11:44:34,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:44:34,677 INFO L435 NwaCegarLoop]: 1086 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 2542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:34,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1215 Invalid, 2542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2523 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:44:34,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7456 states. [2025-02-05 11:44:34,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7456 to 7456. [2025-02-05 11:44:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 1.3362843729040912) internal successors, (9962), 7455 states have internal predecessors, (9962), 0 states have call successors, (0), 0 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 11:44:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 9962 transitions. [2025-02-05 11:44:34,766 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 9962 transitions. Word has length 149 [2025-02-05 11:44:34,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:34,766 INFO L471 AbstractCegarLoop]: Abstraction has 7456 states and 9962 transitions. [2025-02-05 11:44:34,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 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 11:44:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 9962 transitions. [2025-02-05 11:44:34,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 11:44:34,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:34,768 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:44:34,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:44:34,768 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:34,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:34,768 INFO L85 PathProgramCache]: Analyzing trace with hash -572090366, now seen corresponding path program 1 times [2025-02-05 11:44:34,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:34,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181362130] [2025-02-05 11:44:34,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:34,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:34,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 11:44:34,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 11:44:34,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:34,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 11:44:34,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:34,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181362130] [2025-02-05 11:44:34,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181362130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:34,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:34,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:34,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273589971] [2025-02-05 11:44:34,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:34,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:34,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:34,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:34,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:34,908 INFO L87 Difference]: Start difference. First operand 7456 states and 9962 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 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 11:44:38,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:38,164 INFO L93 Difference]: Finished difference Result 19656 states and 26991 transitions. [2025-02-05 11:44:38,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:38,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 163 [2025-02-05 11:44:38,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:38,196 INFO L225 Difference]: With dead ends: 19656 [2025-02-05 11:44:38,196 INFO L226 Difference]: Without dead ends: 12989 [2025-02-05 11:44:38,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:44:38,207 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 743 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 3293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 780 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:38,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1203 Invalid, 3293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [780 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:44:38,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12989 states. [2025-02-05 11:44:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12989 to 12972. [2025-02-05 11:44:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12972 states, 12971 states have (on average 1.235910878112713) internal successors, (16031), 12971 states have internal predecessors, (16031), 0 states have call successors, (0), 0 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 11:44:38,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 16031 transitions. [2025-02-05 11:44:38,342 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 16031 transitions. Word has length 163 [2025-02-05 11:44:38,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:38,343 INFO L471 AbstractCegarLoop]: Abstraction has 12972 states and 16031 transitions. [2025-02-05 11:44:38,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 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 11:44:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 16031 transitions. [2025-02-05 11:44:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-02-05 11:44:38,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:38,346 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1] [2025-02-05 11:44:38,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:44:38,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:38,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:38,347 INFO L85 PathProgramCache]: Analyzing trace with hash 552139599, now seen corresponding path program 1 times [2025-02-05 11:44:38,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:38,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032390635] [2025-02-05 11:44:38,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:38,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:38,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-05 11:44:38,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-05 11:44:38,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:38,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:38,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:38,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032390635] [2025-02-05 11:44:38,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032390635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:38,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:38,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:38,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790780441] [2025-02-05 11:44:38,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:38,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:38,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:38,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:38,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:38,560 INFO L87 Difference]: Start difference. First operand 12972 states and 16031 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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 11:44:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:42,053 INFO L93 Difference]: Finished difference Result 31480 states and 39986 transitions. [2025-02-05 11:44:42,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:42,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2025-02-05 11:44:42,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:42,101 INFO L225 Difference]: With dead ends: 31480 [2025-02-05 11:44:42,101 INFO L226 Difference]: Without dead ends: 19297 [2025-02-05 11:44:42,124 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 11:44:42,124 INFO L435 NwaCegarLoop]: 1777 mSDtfsCounter, 775 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 3268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:42,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1919 Invalid, 3268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:44:42,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19297 states. [2025-02-05 11:44:42,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19297 to 19273. [2025-02-05 11:44:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19273 states, 19272 states have (on average 1.1921959319219593) internal successors, (22976), 19272 states have internal predecessors, (22976), 0 states have call successors, (0), 0 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 11:44:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19273 states to 19273 states and 22976 transitions. [2025-02-05 11:44:42,381 INFO L78 Accepts]: Start accepts. Automaton has 19273 states and 22976 transitions. Word has length 250 [2025-02-05 11:44:42,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:42,381 INFO L471 AbstractCegarLoop]: Abstraction has 19273 states and 22976 transitions. [2025-02-05 11:44:42,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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 11:44:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 19273 states and 22976 transitions. [2025-02-05 11:44:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 11:44:42,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:42,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:42,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:44:42,384 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:42,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:42,385 INFO L85 PathProgramCache]: Analyzing trace with hash 502209105, now seen corresponding path program 1 times [2025-02-05 11:44:42,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:42,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678996213] [2025-02-05 11:44:42,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:42,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:42,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 11:44:42,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 11:44:42,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:42,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:42,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:42,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678996213] [2025-02-05 11:44:42,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678996213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:42,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:42,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:42,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982738732] [2025-02-05 11:44:42,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:42,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:42,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:42,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:42,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:42,492 INFO L87 Difference]: Start difference. First operand 19273 states and 22976 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 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 11:44:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:45,859 INFO L93 Difference]: Finished difference Result 53487 states and 64327 transitions. [2025-02-05 11:44:45,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:45,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2025-02-05 11:44:45,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:45,901 INFO L225 Difference]: With dead ends: 53487 [2025-02-05 11:44:45,901 INFO L226 Difference]: Without dead ends: 33425 [2025-02-05 11:44:45,919 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 11:44:45,919 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 953 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 3225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:45,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 1810 Invalid, 3225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:44:45,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33425 states. [2025-02-05 11:44:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33425 to 31844. [2025-02-05 11:44:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31844 states, 31843 states have (on average 1.1619508212165939) internal successors, (37000), 31843 states have internal predecessors, (37000), 0 states have call successors, (0), 0 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 11:44:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31844 states to 31844 states and 37000 transitions. [2025-02-05 11:44:46,227 INFO L78 Accepts]: Start accepts. Automaton has 31844 states and 37000 transitions. Word has length 252 [2025-02-05 11:44:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:46,227 INFO L471 AbstractCegarLoop]: Abstraction has 31844 states and 37000 transitions. [2025-02-05 11:44:46,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 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 11:44:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 31844 states and 37000 transitions. [2025-02-05 11:44:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-02-05 11:44:46,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:46,233 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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 11:44:46,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:44:46,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:46,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:46,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1946898800, now seen corresponding path program 1 times [2025-02-05 11:44:46,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:46,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328935635] [2025-02-05 11:44:46,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:46,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:46,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-02-05 11:44:46,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-02-05 11:44:46,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:46,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 74 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:47,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:47,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328935635] [2025-02-05 11:44:47,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328935635] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:44:47,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906828759] [2025-02-05 11:44:47,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:47,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:44:47,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:44:47,045 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 11:44:47,046 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 11:44:47,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-02-05 11:44:47,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-02-05 11:44:47,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:47,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:47,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:44:47,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:44:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-05 11:44:47,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:44:47,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906828759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:47,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:44:47,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:44:47,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347825296] [2025-02-05 11:44:47,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:47,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:47,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:47,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:47,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:44:47,240 INFO L87 Difference]: Start difference. First operand 31844 states and 37000 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:50,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:50,193 INFO L93 Difference]: Finished difference Result 62897 states and 73205 transitions. [2025-02-05 11:44:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:50,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 279 [2025-02-05 11:44:50,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:50,395 INFO L225 Difference]: With dead ends: 62897 [2025-02-05 11:44:50,396 INFO L226 Difference]: Without dead ends: 31842 [2025-02-05 11:44:50,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:44:50,408 INFO L435 NwaCegarLoop]: 1358 mSDtfsCounter, 1169 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:50,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 1439 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2458 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:44:50,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31842 states. [2025-02-05 11:44:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31842 to 31841. [2025-02-05 11:44:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31841 states, 31840 states have (on average 1.1251570351758795) internal successors, (35825), 31840 states have internal predecessors, (35825), 0 states have call successors, (0), 0 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 11:44:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31841 states to 31841 states and 35825 transitions. [2025-02-05 11:44:50,654 INFO L78 Accepts]: Start accepts. Automaton has 31841 states and 35825 transitions. Word has length 279 [2025-02-05 11:44:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:50,654 INFO L471 AbstractCegarLoop]: Abstraction has 31841 states and 35825 transitions. [2025-02-05 11:44:50,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:50,655 INFO L276 IsEmpty]: Start isEmpty. Operand 31841 states and 35825 transitions. [2025-02-05 11:44:50,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-05 11:44:50,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:50,658 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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 11:44:50,665 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 11:44:50,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:44:50,859 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:50,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1532362119, now seen corresponding path program 1 times [2025-02-05 11:44:50,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:50,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10842079] [2025-02-05 11:44:50,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:50,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:50,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-05 11:44:50,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-05 11:44:50,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:50,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 11:44:51,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:51,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10842079] [2025-02-05 11:44:51,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10842079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:51,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:51,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:51,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358399279] [2025-02-05 11:44:51,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:51,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:51,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:51,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:51,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:51,018 INFO L87 Difference]: Start difference. First operand 31841 states and 35825 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 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 11:44:54,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:54,728 INFO L93 Difference]: Finished difference Result 74706 states and 85293 transitions. [2025-02-05 11:44:54,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:54,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 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 329 [2025-02-05 11:44:54,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:54,785 INFO L225 Difference]: With dead ends: 74706 [2025-02-05 11:44:54,785 INFO L226 Difference]: Without dead ends: 43654 [2025-02-05 11:44:54,800 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 11:44:54,801 INFO L435 NwaCegarLoop]: 1799 mSDtfsCounter, 825 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2540 mSolverCounterSat, 720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 3260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 720 IncrementalHoareTripleChecker+Valid, 2540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:54,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1942 Invalid, 3260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [720 Valid, 2540 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 11:44:54,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43654 states. [2025-02-05 11:44:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43654 to 42863. [2025-02-05 11:44:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42863 states, 42862 states have (on average 1.1091642947132658) internal successors, (47541), 42862 states have internal predecessors, (47541), 0 states have call successors, (0), 0 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 11:44:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42863 states to 42863 states and 47541 transitions. [2025-02-05 11:44:55,201 INFO L78 Accepts]: Start accepts. Automaton has 42863 states and 47541 transitions. Word has length 329 [2025-02-05 11:44:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:55,202 INFO L471 AbstractCegarLoop]: Abstraction has 42863 states and 47541 transitions. [2025-02-05 11:44:55,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 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 11:44:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 42863 states and 47541 transitions. [2025-02-05 11:44:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-02-05 11:44:55,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:55,205 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2025-02-05 11:44:55,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:44:55,206 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:55,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1039848891, now seen corresponding path program 1 times [2025-02-05 11:44:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:55,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402149245] [2025-02-05 11:44:55,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:55,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:55,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-02-05 11:44:55,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-02-05 11:44:55,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:55,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 203 proven. 110 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 11:44:55,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:55,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402149245] [2025-02-05 11:44:55,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402149245] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:44:55,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993667536] [2025-02-05 11:44:55,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:55,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:44:55,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:44:55,846 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 11:44:55,851 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 11:44:55,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-02-05 11:44:55,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-02-05 11:44:55,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:55,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:55,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:44:55,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:44:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-05 11:44:56,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:44:56,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993667536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:56,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:44:56,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:44:56,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259666998] [2025-02-05 11:44:56,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:56,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:56,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:56,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:56,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:44:56,110 INFO L87 Difference]: Start difference. First operand 42863 states and 47541 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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 11:44:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:58,604 INFO L93 Difference]: Finished difference Result 84928 states and 94280 transitions. [2025-02-05 11:44:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:58,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 344 [2025-02-05 11:44:58,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:58,647 INFO L225 Difference]: With dead ends: 84928 [2025-02-05 11:44:58,647 INFO L226 Difference]: Without dead ends: 42854 [2025-02-05 11:44:58,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:44:58,672 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 1074 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:58,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 798 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:44:58,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42854 states. [2025-02-05 11:44:59,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42854 to 42853. [2025-02-05 11:44:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42853 states, 42852 states have (on average 1.0797162326145804) internal successors, (46268), 42852 states have internal predecessors, (46268), 0 states have call successors, (0), 0 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 11:44:59,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42853 states to 42853 states and 46268 transitions. [2025-02-05 11:44:59,168 INFO L78 Accepts]: Start accepts. Automaton has 42853 states and 46268 transitions. Word has length 344 [2025-02-05 11:44:59,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:59,169 INFO L471 AbstractCegarLoop]: Abstraction has 42853 states and 46268 transitions. [2025-02-05 11:44:59,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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 11:44:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 42853 states and 46268 transitions. [2025-02-05 11:44:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-02-05 11:44:59,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:59,181 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:59,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 11:44:59,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:44:59,382 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:59,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:59,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2031314307, now seen corresponding path program 1 times [2025-02-05 11:44:59,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:59,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632397635] [2025-02-05 11:44:59,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:59,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:59,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-02-05 11:44:59,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-02-05 11:44:59,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:59,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 462 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-02-05 11:44:59,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:59,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632397635] [2025-02-05 11:44:59,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632397635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:59,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:59,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:59,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408513873] [2025-02-05 11:44:59,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:59,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:44:59,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:59,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:44:59,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:44:59,741 INFO L87 Difference]: Start difference. First operand 42853 states and 46268 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 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 11:45:05,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:05,778 INFO L93 Difference]: Finished difference Result 147303 states and 159298 transitions. [2025-02-05 11:45:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:45:05,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 386 [2025-02-05 11:45:05,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:05,913 INFO L225 Difference]: With dead ends: 147303 [2025-02-05 11:45:05,913 INFO L226 Difference]: Without dead ends: 105239 [2025-02-05 11:45:05,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:45:05,954 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 1712 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 5977 mSolverCounterSat, 1088 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 7065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1088 IncrementalHoareTripleChecker+Valid, 5977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:05,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 738 Invalid, 7065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1088 Valid, 5977 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-02-05 11:45:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105239 states. [2025-02-05 11:45:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105239 to 102743. [2025-02-05 11:45:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102743 states, 102742 states have (on average 1.072424130345915) internal successors, (110183), 102742 states have internal predecessors, (110183), 0 states have call successors, (0), 0 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 11:45:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102743 states to 102743 states and 110183 transitions. [2025-02-05 11:45:07,328 INFO L78 Accepts]: Start accepts. Automaton has 102743 states and 110183 transitions. Word has length 386 [2025-02-05 11:45:07,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:07,329 INFO L471 AbstractCegarLoop]: Abstraction has 102743 states and 110183 transitions. [2025-02-05 11:45:07,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 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 11:45:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 102743 states and 110183 transitions. [2025-02-05 11:45:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-02-05 11:45:07,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:07,344 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:07,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:45:07,344 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:07,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:07,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1232382312, now seen corresponding path program 1 times [2025-02-05 11:45:07,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:07,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045585690] [2025-02-05 11:45:07,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:07,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:07,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-05 11:45:07,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-05 11:45:07,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:07,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 369 proven. 113 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-02-05 11:45:08,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:08,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045585690] [2025-02-05 11:45:08,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045585690] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:45:08,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565612877] [2025-02-05 11:45:08,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:08,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:45:08,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:45:08,630 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 11:45:08,638 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 11:45:08,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-05 11:45:08,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-05 11:45:08,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:08,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:08,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:45:08,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:45:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2025-02-05 11:45:08,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:45:08,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565612877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:08,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:45:08,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:45:08,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103906003] [2025-02-05 11:45:08,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:08,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:08,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:08,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:08,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:45:08,953 INFO L87 Difference]: Start difference. First operand 102743 states and 110183 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:12,123 INFO L93 Difference]: Finished difference Result 206272 states and 221159 transitions. [2025-02-05 11:45:12,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:12,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 429 [2025-02-05 11:45:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:12,245 INFO L225 Difference]: With dead ends: 206272 [2025-02-05 11:45:12,245 INFO L226 Difference]: Without dead ends: 104318 [2025-02-05 11:45:12,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:45:12,301 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 1001 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2476 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 3082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:12,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 1467 Invalid, 3082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2476 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:45:12,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104318 states. [2025-02-05 11:45:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104318 to 102730. [2025-02-05 11:45:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102730 states, 102729 states have (on average 1.0600998744268901) internal successors, (108903), 102729 states have internal predecessors, (108903), 0 states have call successors, (0), 0 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 11:45:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102730 states to 102730 states and 108903 transitions. [2025-02-05 11:45:13,593 INFO L78 Accepts]: Start accepts. Automaton has 102730 states and 108903 transitions. Word has length 429 [2025-02-05 11:45:13,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:13,599 INFO L471 AbstractCegarLoop]: Abstraction has 102730 states and 108903 transitions. [2025-02-05 11:45:13,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 102730 states and 108903 transitions. [2025-02-05 11:45:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-05 11:45:13,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:13,614 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:13,629 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 11:45:13,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:45:13,815 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:13,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash 98106263, now seen corresponding path program 1 times [2025-02-05 11:45:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:13,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319928058] [2025-02-05 11:45:13,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:13,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:13,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-05 11:45:13,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-05 11:45:13,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:13,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 408 proven. 110 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-02-05 11:45:15,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:15,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319928058] [2025-02-05 11:45:15,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319928058] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:45:15,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901042358] [2025-02-05 11:45:15,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:15,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:45:15,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:45:15,121 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 11:45:15,123 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 11:45:15,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-05 11:45:15,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-05 11:45:15,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:15,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:15,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:45:15,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:45:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-02-05 11:45:15,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:45:15,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901042358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:15,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:45:15,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:45:15,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956771004] [2025-02-05 11:45:15,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:15,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:15,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:15,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:15,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:45:15,363 INFO L87 Difference]: Start difference. First operand 102730 states and 108903 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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 11:45:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:18,898 INFO L93 Difference]: Finished difference Result 229867 states and 244829 transitions. [2025-02-05 11:45:18,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:18,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 447 [2025-02-05 11:45:18,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:19,044 INFO L225 Difference]: With dead ends: 229867 [2025-02-05 11:45:19,044 INFO L226 Difference]: Without dead ends: 127926 [2025-02-05 11:45:19,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:45:19,091 INFO L435 NwaCegarLoop]: 1625 mSDtfsCounter, 859 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:19,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1745 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 11:45:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127926 states. [2025-02-05 11:45:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127926 to 125552. [2025-02-05 11:45:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125552 states, 125551 states have (on average 1.0629863561421256) internal successors, (133459), 125551 states have internal predecessors, (133459), 0 states have call successors, (0), 0 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 11:45:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125552 states to 125552 states and 133459 transitions. [2025-02-05 11:45:20,289 INFO L78 Accepts]: Start accepts. Automaton has 125552 states and 133459 transitions. Word has length 447 [2025-02-05 11:45:20,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:20,290 INFO L471 AbstractCegarLoop]: Abstraction has 125552 states and 133459 transitions. [2025-02-05 11:45:20,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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 11:45:20,290 INFO L276 IsEmpty]: Start isEmpty. Operand 125552 states and 133459 transitions. [2025-02-05 11:45:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-02-05 11:45:20,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:20,299 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 11:45:20,308 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 11:45:20,503 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,SelfDestructingSolverStorable13 [2025-02-05 11:45:20,503 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:20,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:20,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1348200039, now seen corresponding path program 1 times [2025-02-05 11:45:20,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:20,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504322318] [2025-02-05 11:45:20,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:20,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:20,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-02-05 11:45:20,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-02-05 11:45:20,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:20,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 475 proven. 113 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-05 11:45:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504322318] [2025-02-05 11:45:21,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504322318] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:45:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178363165] [2025-02-05 11:45:21,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:21,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:45:21,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:45:21,865 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 11:45:21,866 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 11:45:21,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-02-05 11:45:22,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-02-05 11:45:22,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:22,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:22,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:45:22,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:45:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2025-02-05 11:45:22,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:45:22,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178363165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:22,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:45:22,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:45:22,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87224715] [2025-02-05 11:45:22,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:22,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:22,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:22,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:22,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:45:22,115 INFO L87 Difference]: Start difference. First operand 125552 states and 133459 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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 11:45:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:25,448 INFO L93 Difference]: Finished difference Result 251872 states and 268080 transitions. [2025-02-05 11:45:25,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:25,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 482 [2025-02-05 11:45:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:25,626 INFO L225 Difference]: With dead ends: 251872 [2025-02-05 11:45:25,626 INFO L226 Difference]: Without dead ends: 142072 [2025-02-05 11:45:25,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:45:25,690 INFO L435 NwaCegarLoop]: 1698 mSDtfsCounter, 804 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:25,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1825 Invalid, 2828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 2368 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:45:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142072 states. [2025-02-05 11:45:26,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142072 to 133413. [2025-02-05 11:45:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133413 states, 133412 states have (on average 1.0600095943393397) internal successors, (141418), 133412 states have internal predecessors, (141418), 0 states have call successors, (0), 0 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 11:45:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133413 states to 133413 states and 141418 transitions. [2025-02-05 11:45:27,129 INFO L78 Accepts]: Start accepts. Automaton has 133413 states and 141418 transitions. Word has length 482 [2025-02-05 11:45:27,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:27,129 INFO L471 AbstractCegarLoop]: Abstraction has 133413 states and 141418 transitions. [2025-02-05 11:45:27,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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 11:45:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 133413 states and 141418 transitions. [2025-02-05 11:45:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-02-05 11:45:27,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:27,139 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:27,145 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 11:45:27,339 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,SelfDestructingSolverStorable14 [2025-02-05 11:45:27,340 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:27,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash 154212217, now seen corresponding path program 1 times [2025-02-05 11:45:27,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:27,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220622706] [2025-02-05 11:45:27,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:27,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:27,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-05 11:45:27,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-05 11:45:27,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:27,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 473 proven. 113 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-02-05 11:45:28,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:28,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220622706] [2025-02-05 11:45:28,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220622706] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:45:28,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799561097] [2025-02-05 11:45:28,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:28,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:45:28,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:45:28,788 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:45:28,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 11:45:28,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-05 11:45:28,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-05 11:45:28,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:28,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:28,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:45:28,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:45:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-02-05 11:45:29,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:45:29,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799561097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:29,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:45:29,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:45:29,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652552702] [2025-02-05 11:45:29,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:29,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:29,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:29,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:29,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:45:29,088 INFO L87 Difference]: Start difference. First operand 133413 states and 141418 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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 11:45:32,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:32,282 INFO L93 Difference]: Finished difference Result 264464 states and 280346 transitions. [2025-02-05 11:45:32,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:32,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 484 [2025-02-05 11:45:32,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:32,444 INFO L225 Difference]: With dead ends: 264464 [2025-02-05 11:45:32,445 INFO L226 Difference]: Without dead ends: 135776 [2025-02-05 11:45:32,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:45:32,510 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 978 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 677 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 677 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:32,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 483 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [677 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:45:32,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135776 states. [2025-02-05 11:45:33,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135776 to 133398. [2025-02-05 11:45:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133398 states, 133397 states have (on average 1.0510656161682796) internal successors, (140209), 133397 states have internal predecessors, (140209), 0 states have call successors, (0), 0 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 11:45:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133398 states to 133398 states and 140209 transitions. [2025-02-05 11:45:34,069 INFO L78 Accepts]: Start accepts. Automaton has 133398 states and 140209 transitions. Word has length 484 [2025-02-05 11:45:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:34,069 INFO L471 AbstractCegarLoop]: Abstraction has 133398 states and 140209 transitions. [2025-02-05 11:45:34,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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 11:45:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 133398 states and 140209 transitions. [2025-02-05 11:45:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-02-05 11:45:34,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:34,079 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:34,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 11:45:34,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 11:45:34,280 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:34,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash -789568096, now seen corresponding path program 1 times [2025-02-05 11:45:34,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:34,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984003542] [2025-02-05 11:45:34,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:34,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:34,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-05 11:45:34,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-05 11:45:34,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:34,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:34,816 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-02-05 11:45:34,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:34,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984003542] [2025-02-05 11:45:34,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984003542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:34,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:34,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:34,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145880674] [2025-02-05 11:45:34,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:34,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:34,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:34,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:34,818 INFO L87 Difference]: Start difference. First operand 133398 states and 140209 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)