./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label01.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/Problem17_label01.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 a4e6e263a6fe01660f2ecabfa1a654296517a773a2b8a9b458da8809aa3aafd8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:01:00,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:01:00,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:01:00,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:01:00,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:01:00,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:01:00,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:01:00,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:01:00,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:01:00,466 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:01:00,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:01:00,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:01:00,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:01:00,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:01:00,467 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:01:00,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:01:00,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:01:00,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:01:00,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:01:00,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:01:00,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:01:00,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:01:00,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:01:00,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:01:00,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:01:00,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:01:00,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:01:00,469 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 -> a4e6e263a6fe01660f2ecabfa1a654296517a773a2b8a9b458da8809aa3aafd8 [2025-02-05 12:01:00,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:01:00,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:01:00,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:01:00,691 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:01:00,691 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:01:00,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label01.c [2025-02-05 12:01:01,896 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cdeff5051/43378d6c799245af8fbecf6a93e12eaf/FLAG5f9fd7cbd [2025-02-05 12:01:02,388 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:01:02,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label01.c [2025-02-05 12:01:02,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cdeff5051/43378d6c799245af8fbecf6a93e12eaf/FLAG5f9fd7cbd [2025-02-05 12:01:02,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cdeff5051/43378d6c799245af8fbecf6a93e12eaf [2025-02-05 12:01:02,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:01:02,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:01:02,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:01:02,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:01:02,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:01:02,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:01:02" (1/1) ... [2025-02-05 12:01:02,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b53348a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:02, skipping insertion in model container [2025-02-05 12:01:02,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:01:02" (1/1) ... [2025-02-05 12:01:02,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:01:02,732 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/Problem17_label01.c[6877,6890] [2025-02-05 12:01:03,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:01:03,143 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:01:03,185 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/Problem17_label01.c[6877,6890] [2025-02-05 12:01:03,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:01:03,374 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:01:03,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:03 WrapperNode [2025-02-05 12:01:03,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:01:03,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:01:03,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:01:03,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:01:03,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:03" (1/1) ... [2025-02-05 12:01:03,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:03" (1/1) ... [2025-02-05 12:01:03,586 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-02-05 12:01:03,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:01:03,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:01:03,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:01:03,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:01:03,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:03" (1/1) ... [2025-02-05 12:01:03,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:03" (1/1) ... [2025-02-05 12:01:03,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:03" (1/1) ... [2025-02-05 12:01:03,799 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 12:01:03,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:03" (1/1) ... [2025-02-05 12:01:03,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:03" (1/1) ... [2025-02-05 12:01:03,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:03" (1/1) ... [2025-02-05 12:01:03,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:03" (1/1) ... [2025-02-05 12:01:03,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:03" (1/1) ... [2025-02-05 12:01:03,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:03" (1/1) ... [2025-02-05 12:01:03,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:01:03,987 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:01:03,988 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:01:03,988 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:01:03,989 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:03" (1/1) ... [2025-02-05 12:01:03,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:01:04,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:01:04,018 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 12:01:04,027 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 12:01:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:01:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:01:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:01:04,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:01:04,099 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:01:04,101 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:01:06,880 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-02-05 12:01:07,114 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-02-05 12:01:07,114 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:01:07,153 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:01:07,158 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:01:07,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:01:07 BoogieIcfgContainer [2025-02-05 12:01:07,158 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:01:07,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:01:07,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:01:07,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:01:07,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:01:02" (1/3) ... [2025-02-05 12:01:07,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eadcabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:01:07, skipping insertion in model container [2025-02-05 12:01:07,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:03" (2/3) ... [2025-02-05 12:01:07,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eadcabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:01:07, skipping insertion in model container [2025-02-05 12:01:07,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:01:07" (3/3) ... [2025-02-05 12:01:07,169 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label01.c [2025-02-05 12:01:07,180 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:01:07,182 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label01.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:01:07,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:01:07,234 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;@2d629488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:01:07,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:01:07,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 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 12:01:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 12:01:07,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:07,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:07,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:07,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:07,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1054675202, now seen corresponding path program 1 times [2025-02-05 12:01:07,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:07,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886152953] [2025-02-05 12:01:07,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:07,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:07,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 12:01:07,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 12:01:07,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:07,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:07,485 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 12:01:07,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:07,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886152953] [2025-02-05 12:01:07,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886152953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:07,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:07,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:01:07,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160999539] [2025-02-05 12:01:07,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:07,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:07,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:07,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:07,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:07,507 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:09,548 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-02-05 12:01:09,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:09,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-05 12:01:09,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:09,561 INFO L225 Difference]: With dead ends: 1644 [2025-02-05 12:01:09,562 INFO L226 Difference]: Without dead ends: 977 [2025-02-05 12:01:09,566 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 12:01:09,568 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 442 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:09,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:01:09,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-05 12:01:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-02-05 12:01:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 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 12:01:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-02-05 12:01:09,670 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 46 [2025-02-05 12:01:09,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:09,671 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-02-05 12:01:09,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-02-05 12:01:09,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 12:01:09,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:09,673 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:09,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:01:09,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:09,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash 929911908, now seen corresponding path program 1 times [2025-02-05 12:01:09,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:09,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712645559] [2025-02-05 12:01:09,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:09,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:09,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 12:01:09,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 12:01:09,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:09,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:09,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:09,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712645559] [2025-02-05 12:01:09,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712645559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:09,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:09,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:01:09,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919821940] [2025-02-05 12:01:09,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:09,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:09,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:09,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:09,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:09,966 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:11,848 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2025-02-05 12:01:11,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:11,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-02-05 12:01:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:11,855 INFO L225 Difference]: With dead ends: 2813 [2025-02-05 12:01:11,856 INFO L226 Difference]: Without dead ends: 1844 [2025-02-05 12:01:11,857 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 12:01:11,858 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:11,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:01:11,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-02-05 12:01:11,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2025-02-05 12:01:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 0 states have call successors, (0), 0 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 12:01:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2025-02-05 12:01:11,902 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 113 [2025-02-05 12:01:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:11,904 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2025-02-05 12:01:11,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2025-02-05 12:01:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 12:01:11,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:11,907 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, 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] [2025-02-05 12:01:11,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:01:11,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:11,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:11,909 INFO L85 PathProgramCache]: Analyzing trace with hash -883938230, now seen corresponding path program 1 times [2025-02-05 12:01:11,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:11,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866208330] [2025-02-05 12:01:11,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:11,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:11,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 12:01:11,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 12:01:11,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:11,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:12,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:12,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866208330] [2025-02-05 12:01:12,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866208330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:12,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:12,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:12,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643970597] [2025-02-05 12:01:12,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:12,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:01:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:12,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:01:12,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:01:12,354 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 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 12:01:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:15,251 INFO L93 Difference]: Finished difference Result 6765 states and 9258 transitions. [2025-02-05 12:01:15,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:01:15,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-02-05 12:01:15,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:15,291 INFO L225 Difference]: With dead ends: 6765 [2025-02-05 12:01:15,292 INFO L226 Difference]: Without dead ends: 4926 [2025-02-05 12:01:15,302 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 12:01:15,308 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 866 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:15,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 328 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 12:01:15,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4926 states. [2025-02-05 12:01:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4926 to 4875. [2025-02-05 12:01:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.286417726713172) internal successors, (6270), 4874 states have internal predecessors, (6270), 0 states have call successors, (0), 0 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 12:01:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6270 transitions. [2025-02-05 12:01:15,428 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6270 transitions. Word has length 116 [2025-02-05 12:01:15,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:15,429 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 6270 transitions. [2025-02-05 12:01:15,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 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 12:01:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6270 transitions. [2025-02-05 12:01:15,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 12:01:15,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:15,432 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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:15,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:01:15,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:15,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:15,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1679394862, now seen corresponding path program 1 times [2025-02-05 12:01:15,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:15,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133648778] [2025-02-05 12:01:15,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:15,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:15,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 12:01:15,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 12:01:15,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:15,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-05 12:01:15,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:15,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133648778] [2025-02-05 12:01:15,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133648778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:15,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:15,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:01:15,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368651097] [2025-02-05 12:01:15,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:15,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:15,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:15,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:15,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:15,671 INFO L87 Difference]: Start difference. First operand 4875 states and 6270 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 12:01:17,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:17,642 INFO L93 Difference]: Finished difference Result 14436 states and 18541 transitions. [2025-02-05 12:01:17,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:17,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 187 [2025-02-05 12:01:17,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:17,693 INFO L225 Difference]: With dead ends: 14436 [2025-02-05 12:01:17,694 INFO L226 Difference]: Without dead ends: 8277 [2025-02-05 12:01:17,701 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 12:01:17,703 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:17,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:01:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2025-02-05 12:01:17,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 6147. [2025-02-05 12:01:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6147 states, 6146 states have (on average 1.1906931337455255) internal successors, (7318), 6146 states have internal predecessors, (7318), 0 states have call successors, (0), 0 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 12:01:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 7318 transitions. [2025-02-05 12:01:17,807 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 7318 transitions. Word has length 187 [2025-02-05 12:01:17,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:17,808 INFO L471 AbstractCegarLoop]: Abstraction has 6147 states and 7318 transitions. [2025-02-05 12:01:17,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 12:01:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 7318 transitions. [2025-02-05 12:01:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 12:01:17,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:17,812 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:17,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:01:17,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:17,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:17,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1290857474, now seen corresponding path program 1 times [2025-02-05 12:01:17,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:17,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951611056] [2025-02-05 12:01:17,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:17,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:17,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 12:01:17,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 12:01:17,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:17,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 12:01:18,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:18,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951611056] [2025-02-05 12:01:18,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951611056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:18,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:18,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:18,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379181505] [2025-02-05 12:01:18,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:18,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:18,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:18,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:18,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:18,015 INFO L87 Difference]: Start difference. First operand 6147 states and 7318 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:19,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:19,863 INFO L93 Difference]: Finished difference Result 15692 states and 18897 transitions. [2025-02-05 12:01:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:19,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-02-05 12:01:19,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:19,887 INFO L225 Difference]: With dead ends: 15692 [2025-02-05 12:01:19,887 INFO L226 Difference]: Without dead ends: 9547 [2025-02-05 12:01:19,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:19,902 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 414 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:19,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 477 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:01:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9547 states. [2025-02-05 12:01:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9547 to 6124. [2025-02-05 12:01:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6124 states, 6123 states have (on average 1.1894496162012085) internal successors, (7283), 6123 states have internal predecessors, (7283), 0 states have call successors, (0), 0 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 12:01:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6124 states to 6124 states and 7283 transitions. [2025-02-05 12:01:20,088 INFO L78 Accepts]: Start accepts. Automaton has 6124 states and 7283 transitions. Word has length 200 [2025-02-05 12:01:20,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:20,088 INFO L471 AbstractCegarLoop]: Abstraction has 6124 states and 7283 transitions. [2025-02-05 12:01:20,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 6124 states and 7283 transitions. [2025-02-05 12:01:20,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 12:01:20,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:20,093 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:20,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:01:20,093 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:20,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:20,093 INFO L85 PathProgramCache]: Analyzing trace with hash -378424464, now seen corresponding path program 1 times [2025-02-05 12:01:20,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:20,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968208491] [2025-02-05 12:01:20,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:20,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:20,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 12:01:20,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 12:01:20,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:20,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:20,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:20,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968208491] [2025-02-05 12:01:20,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968208491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:20,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:20,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:20,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666521495] [2025-02-05 12:01:20,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:20,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:20,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:20,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:20,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:20,262 INFO L87 Difference]: Start difference. First operand 6124 states and 7283 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 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 12:01:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:21,802 INFO L93 Difference]: Finished difference Result 16078 states and 19444 transitions. [2025-02-05 12:01:21,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:21,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-02-05 12:01:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:21,821 INFO L225 Difference]: With dead ends: 16078 [2025-02-05 12:01:21,821 INFO L226 Difference]: Without dead ends: 9956 [2025-02-05 12:01:21,826 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 12:01:21,826 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 487 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:21,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 788 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:01:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9956 states. [2025-02-05 12:01:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9956 to 9956. [2025-02-05 12:01:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9956 states, 9955 states have (on average 1.171672526368659) internal successors, (11664), 9955 states have internal predecessors, (11664), 0 states have call successors, (0), 0 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 12:01:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9956 states to 9956 states and 11664 transitions. [2025-02-05 12:01:21,921 INFO L78 Accepts]: Start accepts. Automaton has 9956 states and 11664 transitions. Word has length 207 [2025-02-05 12:01:21,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:21,921 INFO L471 AbstractCegarLoop]: Abstraction has 9956 states and 11664 transitions. [2025-02-05 12:01:21,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 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 12:01:21,922 INFO L276 IsEmpty]: Start isEmpty. Operand 9956 states and 11664 transitions. [2025-02-05 12:01:21,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-05 12:01:21,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:21,924 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:21,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:01:21,925 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:21,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:21,925 INFO L85 PathProgramCache]: Analyzing trace with hash 159106890, now seen corresponding path program 1 times [2025-02-05 12:01:21,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:21,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424143923] [2025-02-05 12:01:21,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:21,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:21,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-05 12:01:21,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-05 12:01:21,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:21,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:22,288 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 226 proven. 70 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 12:01:22,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424143923] [2025-02-05 12:01:22,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424143923] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:01:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470171250] [2025-02-05 12:01:22,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:22,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:01:22,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:01:22,296 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 12:01:22,300 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 12:01:22,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-05 12:01:22,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-05 12:01:22,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:22,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:22,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:01:22,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:01:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 226 proven. 70 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 12:01:22,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:01:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 12:01:22,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470171250] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:01:22,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:01:22,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:01:22,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222355795] [2025-02-05 12:01:22,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:22,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:01:22,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:22,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:01:22,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:01:22,872 INFO L87 Difference]: Start difference. First operand 9956 states and 11664 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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 12:01:25,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:25,741 INFO L93 Difference]: Finished difference Result 30575 states and 36167 transitions. [2025-02-05 12:01:25,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:01:25,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 270 [2025-02-05 12:01:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:25,802 INFO L225 Difference]: With dead ends: 30575 [2025-02-05 12:01:25,802 INFO L226 Difference]: Without dead ends: 19763 [2025-02-05 12:01:25,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:01:25,826 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 889 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:25,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 161 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 12:01:25,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19763 states. [2025-02-05 12:01:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19763 to 19760. [2025-02-05 12:01:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19760 states, 19759 states have (on average 1.1599777316665822) internal successors, (22920), 19759 states have internal predecessors, (22920), 0 states have call successors, (0), 0 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 12:01:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19760 states to 19760 states and 22920 transitions. [2025-02-05 12:01:26,335 INFO L78 Accepts]: Start accepts. Automaton has 19760 states and 22920 transitions. Word has length 270 [2025-02-05 12:01:26,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:26,335 INFO L471 AbstractCegarLoop]: Abstraction has 19760 states and 22920 transitions. [2025-02-05 12:01:26,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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 12:01:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 19760 states and 22920 transitions. [2025-02-05 12:01:26,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-02-05 12:01:26,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:26,343 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:26,354 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 12:01:26,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:01:26,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:26,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:26,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1340128700, now seen corresponding path program 1 times [2025-02-05 12:01:26,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:26,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963541994] [2025-02-05 12:01:26,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:26,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:26,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-02-05 12:01:26,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-02-05 12:01:26,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:26,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 12:01:26,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:26,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963541994] [2025-02-05 12:01:26,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963541994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:26,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:26,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:26,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774938632] [2025-02-05 12:01:26,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:26,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:26,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:26,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:26,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:26,707 INFO L87 Difference]: Start difference. First operand 19760 states and 22920 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 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 12:01:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:28,402 INFO L93 Difference]: Finished difference Result 42909 states and 49989 transitions. [2025-02-05 12:01:28,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:28,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 283 [2025-02-05 12:01:28,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:28,449 INFO L225 Difference]: With dead ends: 42909 [2025-02-05 12:01:28,449 INFO L226 Difference]: Without dead ends: 23151 [2025-02-05 12:01:28,469 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 12:01:28,470 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 374 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:28,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 896 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:01:28,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23151 states. [2025-02-05 12:01:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23151 to 22725. [2025-02-05 12:01:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22725 states, 22724 states have (on average 1.1456169688435134) internal successors, (26033), 22724 states have internal predecessors, (26033), 0 states have call successors, (0), 0 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 12:01:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 26033 transitions. [2025-02-05 12:01:28,725 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 26033 transitions. Word has length 283 [2025-02-05 12:01:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:28,725 INFO L471 AbstractCegarLoop]: Abstraction has 22725 states and 26033 transitions. [2025-02-05 12:01:28,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 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 12:01:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 26033 transitions. [2025-02-05 12:01:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-02-05 12:01:28,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:28,730 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:28,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:01:28,730 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:28,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:28,731 INFO L85 PathProgramCache]: Analyzing trace with hash 821627049, now seen corresponding path program 1 times [2025-02-05 12:01:28,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:28,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291673611] [2025-02-05 12:01:28,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:28,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:28,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-05 12:01:28,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-05 12:01:28,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:28,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:01:29,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:29,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291673611] [2025-02-05 12:01:29,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291673611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:29,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:29,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:01:29,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112665161] [2025-02-05 12:01:29,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:29,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:01:29,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:29,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:01:29,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:01:29,093 INFO L87 Difference]: Start difference. First operand 22725 states and 26033 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 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 12:01:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:32,266 INFO L93 Difference]: Finished difference Result 64239 states and 73655 transitions. [2025-02-05 12:01:32,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:01:32,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 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 306 [2025-02-05 12:01:32,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:32,409 INFO L225 Difference]: With dead ends: 64239 [2025-02-05 12:01:32,412 INFO L226 Difference]: Without dead ends: 38537 [2025-02-05 12:01:32,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 12:01:32,457 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 874 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 3196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:32,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 342 Invalid, 3196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [520 Valid, 2676 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 12:01:32,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38537 states. [2025-02-05 12:01:32,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38537 to 38056. [2025-02-05 12:01:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38056 states, 38055 states have (on average 1.1408750492707922) internal successors, (43416), 38055 states have internal predecessors, (43416), 0 states have call successors, (0), 0 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 12:01:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38056 states to 38056 states and 43416 transitions. [2025-02-05 12:01:33,080 INFO L78 Accepts]: Start accepts. Automaton has 38056 states and 43416 transitions. Word has length 306 [2025-02-05 12:01:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:33,081 INFO L471 AbstractCegarLoop]: Abstraction has 38056 states and 43416 transitions. [2025-02-05 12:01:33,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 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 12:01:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 38056 states and 43416 transitions. [2025-02-05 12:01:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-02-05 12:01:33,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:33,094 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:33,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:01:33,094 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:33,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:33,100 INFO L85 PathProgramCache]: Analyzing trace with hash -214522136, now seen corresponding path program 1 times [2025-02-05 12:01:33,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:33,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241351066] [2025-02-05 12:01:33,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:33,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:33,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-02-05 12:01:33,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-02-05 12:01:33,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:33,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-02-05 12:01:33,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:33,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241351066] [2025-02-05 12:01:33,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241351066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:33,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:33,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:33,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155581200] [2025-02-05 12:01:33,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:33,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:33,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:33,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:33,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:33,244 INFO L87 Difference]: Start difference. First operand 38056 states and 43416 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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 12:01:35,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:35,079 INFO L93 Difference]: Finished difference Result 91844 states and 104584 transitions. [2025-02-05 12:01:35,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:35,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 318 [2025-02-05 12:01:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:35,149 INFO L225 Difference]: With dead ends: 91844 [2025-02-05 12:01:35,149 INFO L226 Difference]: Without dead ends: 53358 [2025-02-05 12:01:35,179 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 12:01:35,180 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 424 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:35,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 431 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:01:35,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53358 states. [2025-02-05 12:01:35,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53358 to 49524. [2025-02-05 12:01:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49524 states, 49523 states have (on average 1.1243866486279102) internal successors, (55683), 49523 states have internal predecessors, (55683), 0 states have call successors, (0), 0 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 12:01:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49524 states to 49524 states and 55683 transitions. [2025-02-05 12:01:36,026 INFO L78 Accepts]: Start accepts. Automaton has 49524 states and 55683 transitions. Word has length 318 [2025-02-05 12:01:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:36,026 INFO L471 AbstractCegarLoop]: Abstraction has 49524 states and 55683 transitions. [2025-02-05 12:01:36,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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 12:01:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 49524 states and 55683 transitions. [2025-02-05 12:01:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-02-05 12:01:36,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:36,033 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, 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, 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] [2025-02-05 12:01:36,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:01:36,033 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:36,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:36,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1209653014, now seen corresponding path program 1 times [2025-02-05 12:01:36,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:36,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909669869] [2025-02-05 12:01:36,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:36,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:36,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-02-05 12:01:36,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-02-05 12:01:36,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:36,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:36,444 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 12:01:36,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:36,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909669869] [2025-02-05 12:01:36,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909669869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:36,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:36,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:36,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103004327] [2025-02-05 12:01:36,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:36,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:36,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:36,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:36,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:36,447 INFO L87 Difference]: Start difference. First operand 49524 states and 55683 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 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 12:01:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:38,228 INFO L93 Difference]: Finished difference Result 114397 states and 129047 transitions. [2025-02-05 12:01:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:38,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 321 [2025-02-05 12:01:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:38,307 INFO L225 Difference]: With dead ends: 114397 [2025-02-05 12:01:38,307 INFO L226 Difference]: Without dead ends: 63173 [2025-02-05 12:01:38,345 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 12:01:38,346 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 364 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:38,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 816 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:01:38,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63173 states. [2025-02-05 12:01:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63173 to 61886. [2025-02-05 12:01:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61886 states, 61885 states have (on average 1.1074089036115375) internal successors, (68532), 61885 states have internal predecessors, (68532), 0 states have call successors, (0), 0 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 12:01:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61886 states to 61886 states and 68532 transitions. [2025-02-05 12:01:39,400 INFO L78 Accepts]: Start accepts. Automaton has 61886 states and 68532 transitions. Word has length 321 [2025-02-05 12:01:39,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:39,400 INFO L471 AbstractCegarLoop]: Abstraction has 61886 states and 68532 transitions. [2025-02-05 12:01:39,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 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 12:01:39,400 INFO L276 IsEmpty]: Start isEmpty. Operand 61886 states and 68532 transitions. [2025-02-05 12:01:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-02-05 12:01:39,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:39,406 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, 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, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:39,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 12:01:39,407 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:39,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:39,408 INFO L85 PathProgramCache]: Analyzing trace with hash 823242188, now seen corresponding path program 1 times [2025-02-05 12:01:39,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:39,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621728414] [2025-02-05 12:01:39,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:39,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:39,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-02-05 12:01:39,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-02-05 12:01:39,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:39,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 340 proven. 214 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 12:01:39,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:39,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621728414] [2025-02-05 12:01:39,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621728414] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:01:39,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962927191] [2025-02-05 12:01:39,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:39,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:01:39,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:01:39,875 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 12:01:39,877 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 12:01:39,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-02-05 12:01:40,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-02-05 12:01:40,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:40,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:40,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:01:40,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:01:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 367 proven. 73 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-02-05 12:01:40,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:01:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-02-05 12:01:40,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962927191] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:01:40,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:01:40,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2025-02-05 12:01:40,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549380482] [2025-02-05 12:01:40,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:40,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:01:40,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:40,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:01:40,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:01:40,365 INFO L87 Difference]: Start difference. First operand 61886 states and 68532 transitions. Second operand has 4 states, 4 states have (on average 58.0) 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 12:01:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:43,096 INFO L93 Difference]: Finished difference Result 144217 states and 159922 transitions. [2025-02-05 12:01:43,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:01:43,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) 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 12:01:43,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:43,177 INFO L225 Difference]: With dead ends: 144217 [2025-02-05 12:01:43,178 INFO L226 Difference]: Without dead ends: 82333 [2025-02-05 12:01:43,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 685 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:01:43,208 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 849 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2355 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 2910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 2355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:43,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 189 Invalid, 2910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 2355 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 12:01:43,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82333 states. [2025-02-05 12:01:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82333 to 77653. [2025-02-05 12:01:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77653 states, 77652 states have (on average 1.1105702364394994) internal successors, (86238), 77652 states have internal predecessors, (86238), 0 states have call successors, (0), 0 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 12:01:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77653 states to 77653 states and 86238 transitions. [2025-02-05 12:01:44,228 INFO L78 Accepts]: Start accepts. Automaton has 77653 states and 86238 transitions. Word has length 344 [2025-02-05 12:01:44,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:44,228 INFO L471 AbstractCegarLoop]: Abstraction has 77653 states and 86238 transitions. [2025-02-05 12:01:44,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) 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 12:01:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 77653 states and 86238 transitions. [2025-02-05 12:01:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-05 12:01:44,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:44,233 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, 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, 3, 3, 3, 3, 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] [2025-02-05 12:01:44,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 12:01:44,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:01:44,433 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:44,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:44,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1088407946, now seen corresponding path program 1 times [2025-02-05 12:01:44,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:44,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736581261] [2025-02-05 12:01:44,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:44,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:44,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-05 12:01:44,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-05 12:01:44,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:44,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-02-05 12:01:44,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:44,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736581261] [2025-02-05 12:01:44,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736581261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:44,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:44,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:44,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274568575] [2025-02-05 12:01:44,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:44,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:44,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:44,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:44,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:44,872 INFO L87 Difference]: Start difference. First operand 77653 states and 86238 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 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 12:01:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:46,668 INFO L93 Difference]: Finished difference Result 168920 states and 188110 transitions. [2025-02-05 12:01:46,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:46,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 374 [2025-02-05 12:01:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:46,760 INFO L225 Difference]: With dead ends: 168920 [2025-02-05 12:01:46,760 INFO L226 Difference]: Without dead ends: 90417 [2025-02-05 12:01:46,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:46,807 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 392 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:46,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 824 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:01:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90417 states. [2025-02-05 12:01:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90417 to 75491. [2025-02-05 12:01:47,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75491 states, 75490 states have (on average 1.1091932706318717) internal successors, (83733), 75490 states have internal predecessors, (83733), 0 states have call successors, (0), 0 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 12:01:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75491 states to 75491 states and 83733 transitions. [2025-02-05 12:01:47,824 INFO L78 Accepts]: Start accepts. Automaton has 75491 states and 83733 transitions. Word has length 374 [2025-02-05 12:01:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:47,825 INFO L471 AbstractCegarLoop]: Abstraction has 75491 states and 83733 transitions. [2025-02-05 12:01:47,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 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 12:01:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 75491 states and 83733 transitions. [2025-02-05 12:01:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-02-05 12:01:47,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:47,831 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:01:47,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 12:01:47,831 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:47,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash -701073374, now seen corresponding path program 1 times [2025-02-05 12:01:47,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:47,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854766967] [2025-02-05 12:01:47,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:47,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:47,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-02-05 12:01:47,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-02-05 12:01:47,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:47,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-05 12:01:48,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854766967] [2025-02-05 12:01:48,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854766967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:48,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:48,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:48,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240904904] [2025-02-05 12:01:48,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:48,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:48,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:48,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:48,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:48,010 INFO L87 Difference]: Start difference. First operand 75491 states and 83733 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 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 12:01:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:50,014 INFO L93 Difference]: Finished difference Result 156939 states and 174500 transitions. [2025-02-05 12:01:50,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:50,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 379 [2025-02-05 12:01:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:50,108 INFO L225 Difference]: With dead ends: 156939 [2025-02-05 12:01:50,109 INFO L226 Difference]: Without dead ends: 81022 [2025-02-05 12:01:50,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:50,155 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 473 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:50,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 269 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:01:50,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81022 states. [2025-02-05 12:01:50,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81022 to 78458. [2025-02-05 12:01:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78458 states, 78457 states have (on average 1.1072689498706298) internal successors, (86873), 78457 states have internal predecessors, (86873), 0 states have call successors, (0), 0 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 12:01:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78458 states to 78458 states and 86873 transitions. [2025-02-05 12:01:51,289 INFO L78 Accepts]: Start accepts. Automaton has 78458 states and 86873 transitions. Word has length 379 [2025-02-05 12:01:51,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:51,290 INFO L471 AbstractCegarLoop]: Abstraction has 78458 states and 86873 transitions. [2025-02-05 12:01:51,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 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 12:01:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 78458 states and 86873 transitions. [2025-02-05 12:01:51,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-02-05 12:01:51,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:51,294 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:51,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:01:51,295 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:51,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:51,295 INFO L85 PathProgramCache]: Analyzing trace with hash 967618073, now seen corresponding path program 1 times [2025-02-05 12:01:51,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:51,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911146426] [2025-02-05 12:01:51,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:51,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:51,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-02-05 12:01:51,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-02-05 12:01:51,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:51,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-02-05 12:01:51,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:51,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911146426] [2025-02-05 12:01:51,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911146426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:51,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:51,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:51,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911392759] [2025-02-05 12:01:51,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:51,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:51,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:51,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:51,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:51,405 INFO L87 Difference]: Start difference. First operand 78458 states and 86873 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:53,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:53,314 INFO L93 Difference]: Finished difference Result 167541 states and 185296 transitions. [2025-02-05 12:01:53,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:53,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 396 [2025-02-05 12:01:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:53,431 INFO L225 Difference]: With dead ends: 167541 [2025-02-05 12:01:53,431 INFO L226 Difference]: Without dead ends: 88654 [2025-02-05 12:01:53,474 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 12:01:53,474 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 392 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:53,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 331 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:01:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88654 states. [2025-02-05 12:01:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88654 to 83123. [2025-02-05 12:01:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83123 states, 83122 states have (on average 1.0984697192079114) internal successors, (91307), 83122 states have internal predecessors, (91307), 0 states have call successors, (0), 0 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 12:01:54,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83123 states to 83123 states and 91307 transitions. [2025-02-05 12:01:54,667 INFO L78 Accepts]: Start accepts. Automaton has 83123 states and 91307 transitions. Word has length 396 [2025-02-05 12:01:54,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:54,667 INFO L471 AbstractCegarLoop]: Abstraction has 83123 states and 91307 transitions. [2025-02-05 12:01:54,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:54,668 INFO L276 IsEmpty]: Start isEmpty. Operand 83123 states and 91307 transitions. [2025-02-05 12:01:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-02-05 12:01:54,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:54,676 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, 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, 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, 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 12:01:54,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 12:01:54,676 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:54,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:54,677 INFO L85 PathProgramCache]: Analyzing trace with hash 495126966, now seen corresponding path program 1 times [2025-02-05 12:01:54,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:54,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898716371] [2025-02-05 12:01:54,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:54,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:54,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-02-05 12:01:54,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-02-05 12:01:54,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:54,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 346 proven. 44 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-05 12:01:55,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:55,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898716371] [2025-02-05 12:01:55,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898716371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:01:55,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114369036] [2025-02-05 12:01:55,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:55,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:01:55,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:01:55,439 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 12:01:55,448 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 12:01:55,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-02-05 12:01:55,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-02-05 12:01:55,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:55,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:55,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 12:01:55,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:01:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 417 proven. 82 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-02-05 12:01:55,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:01:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 417 proven. 82 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-02-05 12:01:56,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114369036] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 12:01:56,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 12:01:56,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-02-05 12:01:56,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270837667] [2025-02-05 12:01:56,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 12:01:56,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 12:01:56,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:56,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 12:01:56,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 12:01:56,577 INFO L87 Difference]: Start difference. First operand 83123 states and 91307 transitions. Second operand has 9 states, 9 states have (on average 82.33333333333333) internal successors, (741), 9 states have internal predecessors, (741), 0 states have call successors, (0), 0 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 12:02:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:05,029 INFO L93 Difference]: Finished difference Result 211381 states and 230946 transitions. [2025-02-05 12:02:05,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 12:02:05,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.33333333333333) internal successors, (741), 9 states have internal predecessors, (741), 0 states have call successors, (0), 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 426 [2025-02-05 12:02:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:05,176 INFO L225 Difference]: With dead ends: 211381 [2025-02-05 12:02:05,176 INFO L226 Difference]: Without dead ends: 121877 [2025-02-05 12:02:05,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 872 GetRequests, 856 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2025-02-05 12:02:05,243 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 8305 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 7719 mSolverCounterSat, 2837 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8305 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 10556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2837 IncrementalHoareTripleChecker+Valid, 7719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:05,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8305 Valid, 307 Invalid, 10556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2837 Valid, 7719 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2025-02-05 12:02:05,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121877 states. [2025-02-05 12:02:06,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121877 to 103084. [2025-02-05 12:02:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103084 states, 103083 states have (on average 1.074095631675446) internal successors, (110721), 103083 states have internal predecessors, (110721), 0 states have call successors, (0), 0 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 12:02:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103084 states to 103084 states and 110721 transitions. [2025-02-05 12:02:06,762 INFO L78 Accepts]: Start accepts. Automaton has 103084 states and 110721 transitions. Word has length 426 [2025-02-05 12:02:06,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:06,763 INFO L471 AbstractCegarLoop]: Abstraction has 103084 states and 110721 transitions. [2025-02-05 12:02:06,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.33333333333333) internal successors, (741), 9 states have internal predecessors, (741), 0 states have call successors, (0), 0 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 12:02:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 103084 states and 110721 transitions. [2025-02-05 12:02:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-02-05 12:02:06,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:06,773 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:06,779 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 12:02:06,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:06,974 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:06,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:06,975 INFO L85 PathProgramCache]: Analyzing trace with hash 198199779, now seen corresponding path program 1 times [2025-02-05 12:02:06,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:06,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046133719] [2025-02-05 12:02:06,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:06,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:07,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-02-05 12:02:07,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-02-05 12:02:07,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:07,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 251 proven. 44 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 12:02:07,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:07,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046133719] [2025-02-05 12:02:07,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046133719] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:02:07,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831995281] [2025-02-05 12:02:07,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:07,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:07,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:02:07,501 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 12:02:07,510 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 12:02:07,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-02-05 12:02:07,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-02-05 12:02:07,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:07,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:07,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 12:02:07,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:02:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 251 proven. 44 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 12:02:07,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:02:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 251 proven. 44 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 12:02:09,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831995281] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 12:02:09,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 12:02:09,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-05 12:02:09,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490552309] [2025-02-05 12:02:09,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 12:02:09,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 12:02:09,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:09,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 12:02:09,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:02:09,661 INFO L87 Difference]: Start difference. First operand 103084 states and 110721 transitions. Second operand has 8 states, 8 states have (on average 137.5) internal successors, (1100), 8 states have internal predecessors, (1100), 0 states have call successors, (0), 0 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 12:02:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:16,862 INFO L93 Difference]: Finished difference Result 236863 states and 253578 transitions. [2025-02-05 12:02:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 12:02:16,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 137.5) internal successors, (1100), 8 states have internal predecessors, (1100), 0 states have call successors, (0), 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 504 [2025-02-05 12:02:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:17,073 INFO L225 Difference]: With dead ends: 236863 [2025-02-05 12:02:17,073 INFO L226 Difference]: Without dead ends: 132931 [2025-02-05 12:02:17,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1014 GetRequests, 1006 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 12:02:17,153 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 1940 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 8453 mSolverCounterSat, 1134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1940 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 9587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1134 IncrementalHoareTripleChecker+Valid, 8453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:17,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1940 Valid, 343 Invalid, 9587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1134 Valid, 8453 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-02-05 12:02:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132931 states. [2025-02-05 12:02:18,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132931 to 110303. [2025-02-05 12:02:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110303 states, 110302 states have (on average 1.0639244981958622) internal successors, (117353), 110302 states have internal predecessors, (117353), 0 states have call successors, (0), 0 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 12:02:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110303 states to 110303 states and 117353 transitions. [2025-02-05 12:02:18,848 INFO L78 Accepts]: Start accepts. Automaton has 110303 states and 117353 transitions. Word has length 504 [2025-02-05 12:02:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:18,848 INFO L471 AbstractCegarLoop]: Abstraction has 110303 states and 117353 transitions. [2025-02-05 12:02:18,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 137.5) internal successors, (1100), 8 states have internal predecessors, (1100), 0 states have call successors, (0), 0 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 12:02:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 110303 states and 117353 transitions. [2025-02-05 12:02:18,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2025-02-05 12:02:18,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:18,859 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, 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, 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, 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] [2025-02-05 12:02:18,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 12:02:19,060 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,SelfDestructingSolverStorable16 [2025-02-05 12:02:19,061 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:19,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:19,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1050016549, now seen corresponding path program 1 times [2025-02-05 12:02:19,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:19,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986617261] [2025-02-05 12:02:19,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:19,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:19,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-02-05 12:02:19,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-02-05 12:02:19,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:19,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2025-02-05 12:02:19,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:19,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986617261] [2025-02-05 12:02:19,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986617261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:19,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:19,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:02:19,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381549395] [2025-02-05 12:02:19,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:19,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:19,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:19,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:19,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:19,273 INFO L87 Difference]: Start difference. First operand 110303 states and 117353 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 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 12:02:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:20,442 INFO L93 Difference]: Finished difference Result 211226 states and 224551 transitions. [2025-02-05 12:02:20,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:20,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 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 550 [2025-02-05 12:02:20,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:20,588 INFO L225 Difference]: With dead ends: 211226 [2025-02-05 12:02:20,589 INFO L226 Difference]: Without dead ends: 101349 [2025-02-05 12:02:20,670 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 12:02:20,671 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 593 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:20,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 80 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 12:02:20,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101349 states. [2025-02-05 12:02:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101349 to 100488. [2025-02-05 12:02:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100488 states, 100487 states have (on average 1.0619483117219142) internal successors, (106712), 100487 states have internal predecessors, (106712), 0 states have call successors, (0), 0 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 12:02:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100488 states to 100488 states and 106712 transitions. [2025-02-05 12:02:22,169 INFO L78 Accepts]: Start accepts. Automaton has 100488 states and 106712 transitions. Word has length 550 [2025-02-05 12:02:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:22,170 INFO L471 AbstractCegarLoop]: Abstraction has 100488 states and 106712 transitions. [2025-02-05 12:02:22,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 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 12:02:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 100488 states and 106712 transitions. [2025-02-05 12:02:22,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-02-05 12:02:22,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:22,185 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:22,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 12:02:22,185 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:22,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:22,186 INFO L85 PathProgramCache]: Analyzing trace with hash 393738778, now seen corresponding path program 1 times [2025-02-05 12:02:22,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:22,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641921164] [2025-02-05 12:02:22,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:22,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:22,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-02-05 12:02:22,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-02-05 12:02:22,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:22,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat