./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label54.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_label54.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 11e41592a4a90a36b9d41c817b9251e7ae28a6a8e3ac5da0511d1aedc7736ffe --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:06:40,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:06:40,914 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:06:40,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:06:40,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:06:40,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:06:40,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:06:40,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:06:40,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:06:40,948 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:06:40,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:06:40,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:06:40,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:06:40,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:06:40,948 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:06:40,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:06:40,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:06:40,948 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:06:40,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:06:40,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:06:40,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:06:40,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:06:40,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:06:40,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:06:40,949 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:06:40,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:06:40,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:06:40,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:06:40,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:06:40,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:06:40,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:06:40,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:06:40,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:06:40,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:06:40,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:06:40,949 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:06:40,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:06:40,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:06:40,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:06:40,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:06:40,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:06:40,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:06:40,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:06:40,952 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 -> 11e41592a4a90a36b9d41c817b9251e7ae28a6a8e3ac5da0511d1aedc7736ffe [2025-02-05 12:06:41,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:06:41,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:06:41,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:06:41,228 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:06:41,229 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:06:41,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label54.c [2025-02-05 12:06:42,576 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3dd80bec/a16c135975d2456ea922594750e6b3fe/FLAG8f0b7b5fb [2025-02-05 12:06:42,935 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:06:42,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label54.c [2025-02-05 12:06:42,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3dd80bec/a16c135975d2456ea922594750e6b3fe/FLAG8f0b7b5fb [2025-02-05 12:06:43,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3dd80bec/a16c135975d2456ea922594750e6b3fe [2025-02-05 12:06:43,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:06:43,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:06:43,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:06:43,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:06:43,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:06:43,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:06:43" (1/1) ... [2025-02-05 12:06:43,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d686b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:06:43, skipping insertion in model container [2025-02-05 12:06:43,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:06:43" (1/1) ... [2025-02-05 12:06:43,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:06:43,330 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_label54.c[2072,2085] [2025-02-05 12:06:43,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:06:43,693 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:06:43,705 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_label54.c[2072,2085] [2025-02-05 12:06:43,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:06:43,961 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:06:43,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:06:43 WrapperNode [2025-02-05 12:06:43,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:06:43,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:06:43,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:06:43,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:06:43,969 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:06:43" (1/1) ... [2025-02-05 12:06:44,015 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:06:43" (1/1) ... [2025-02-05 12:06:44,244 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-02-05 12:06:44,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:06:44,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:06:44,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:06:44,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:06:44,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:06:43" (1/1) ... [2025-02-05 12:06:44,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:06:43" (1/1) ... [2025-02-05 12:06:44,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:06:43" (1/1) ... [2025-02-05 12:06:44,488 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:06:44,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:06:43" (1/1) ... [2025-02-05 12:06:44,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:06:43" (1/1) ... [2025-02-05 12:06:44,638 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:06:43" (1/1) ... [2025-02-05 12:06:44,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:06:43" (1/1) ... [2025-02-05 12:06:44,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:06:43" (1/1) ... [2025-02-05 12:06:44,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:06:43" (1/1) ... [2025-02-05 12:06:44,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:06:44,735 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:06:44,735 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:06:44,736 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:06:44,737 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:06:43" (1/1) ... [2025-02-05 12:06:44,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:06:44,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:06:44,771 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:06:44,779 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:06:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:06:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:06:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:06:44,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:06:44,852 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:06:44,854 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:06:47,836 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-02-05 12:06:48,002 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-02-05 12:06:48,002 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:06:48,026 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:06:48,027 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:06:48,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:06:48 BoogieIcfgContainer [2025-02-05 12:06:48,027 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:06:48,033 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:06:48,033 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:06:48,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:06:48,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:06:43" (1/3) ... [2025-02-05 12:06:48,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117bdbb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:06:48, skipping insertion in model container [2025-02-05 12:06:48,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:06:43" (2/3) ... [2025-02-05 12:06:48,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117bdbb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:06:48, skipping insertion in model container [2025-02-05 12:06:48,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:06:48" (3/3) ... [2025-02-05 12:06:48,041 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label54.c [2025-02-05 12:06:48,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:06:48,054 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label54.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:06:48,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:06:48,128 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;@39a4d9fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:06:48,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:06:48,134 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:06:48,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 12:06:48,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:48,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:06:48,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:48,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:48,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1385596893, now seen corresponding path program 1 times [2025-02-05 12:06:48,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:48,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505435256] [2025-02-05 12:06:48,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:48,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:48,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 12:06:48,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 12:06:48,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:48,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:48,349 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:06:48,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:48,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505435256] [2025-02-05 12:06:48,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505435256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:48,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:48,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:06:48,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58872945] [2025-02-05 12:06:48,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:48,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:48,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:48,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:48,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:48,375 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 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:06:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:50,550 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-02-05 12:06:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:50,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-02-05 12:06:50,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:50,564 INFO L225 Difference]: With dead ends: 1644 [2025-02-05 12:06:50,564 INFO L226 Difference]: Without dead ends: 977 [2025-02-05 12:06:50,568 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:06:50,569 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 475 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 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, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:50,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:06:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-05 12:06:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-02-05 12:06:50,655 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:06:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-02-05 12:06:50,666 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 13 [2025-02-05 12:06:50,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:50,667 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-02-05 12:06:50,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:06:50,668 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-02-05 12:06:50,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 12:06:50,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:50,670 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 12:06:50,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:06:50,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:50,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:50,671 INFO L85 PathProgramCache]: Analyzing trace with hash 274513442, now seen corresponding path program 1 times [2025-02-05 12:06:50,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:50,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991319563] [2025-02-05 12:06:50,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:50,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:50,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 12:06:50,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 12:06:50,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:50,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:06:50,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:50,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991319563] [2025-02-05 12:06:50,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991319563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:50,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:50,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:06:50,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708541419] [2025-02-05 12:06:50,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:50,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:50,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:50,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:50,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:50,956 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:06:53,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:53,007 INFO L93 Difference]: Finished difference Result 2815 states and 4382 transitions. [2025-02-05 12:06:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:53,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-02-05 12:06:53,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:53,015 INFO L225 Difference]: With dead ends: 2815 [2025-02-05 12:06:53,015 INFO L226 Difference]: Without dead ends: 1846 [2025-02-05 12:06:53,021 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:06:53,022 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:53,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 581 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:06:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2025-02-05 12:06:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1841. [2025-02-05 12:06:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.3505434782608696) internal successors, (2485), 1840 states have internal predecessors, (2485), 0 states have call successors, (0), 0 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:06:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2485 transitions. [2025-02-05 12:06:53,146 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2485 transitions. Word has length 80 [2025-02-05 12:06:53,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:53,146 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2485 transitions. [2025-02-05 12:06:53,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:06:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2485 transitions. [2025-02-05 12:06:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 12:06:53,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:53,148 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 12:06:53,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:06:53,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:53,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:53,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2128855398, now seen corresponding path program 1 times [2025-02-05 12:06:53,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:53,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640631806] [2025-02-05 12:06:53,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:53,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:53,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 12:06:53,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 12:06:53,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:53,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:53,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:06:53,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:53,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640631806] [2025-02-05 12:06:53,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640631806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:53,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:53,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:53,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033088165] [2025-02-05 12:06:53,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:53,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:53,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:53,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:53,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:53,466 INFO L87 Difference]: Start difference. First operand 1841 states and 2485 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:06:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:55,675 INFO L93 Difference]: Finished difference Result 4552 states and 6285 transitions. [2025-02-05 12:06:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:55,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-02-05 12:06:55,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:55,686 INFO L225 Difference]: With dead ends: 4552 [2025-02-05 12:06:55,686 INFO L226 Difference]: Without dead ends: 2713 [2025-02-05 12:06:55,689 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:06:55,689 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 494 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:55,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 886 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:06:55,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2025-02-05 12:06:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2711. [2025-02-05 12:06:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2710 states have (on average 1.3007380073800738) internal successors, (3525), 2710 states have internal predecessors, (3525), 0 states have call successors, (0), 0 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:06:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3525 transitions. [2025-02-05 12:06:55,741 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3525 transitions. Word has length 83 [2025-02-05 12:06:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:55,743 INFO L471 AbstractCegarLoop]: Abstraction has 2711 states and 3525 transitions. [2025-02-05 12:06:55,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:06:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3525 transitions. [2025-02-05 12:06:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 12:06:55,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:55,748 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:06:55,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:06:55,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:55,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:55,749 INFO L85 PathProgramCache]: Analyzing trace with hash -940075888, now seen corresponding path program 1 times [2025-02-05 12:06:55,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:55,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15208260] [2025-02-05 12:06:55,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:55,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:55,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 12:06:55,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 12:06:55,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:55,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:56,083 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 12:06:56,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:56,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15208260] [2025-02-05 12:06:56,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15208260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:56,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:56,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:06:56,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744955396] [2025-02-05 12:06:56,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:56,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:56,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:56,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:56,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:56,085 INFO L87 Difference]: Start difference. First operand 2711 states and 3525 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 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:06:57,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:57,668 INFO L93 Difference]: Finished difference Result 7984 states and 10364 transitions. [2025-02-05 12:06:57,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:57,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 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 152 [2025-02-05 12:06:57,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:57,684 INFO L225 Difference]: With dead ends: 7984 [2025-02-05 12:06:57,685 INFO L226 Difference]: Without dead ends: 4421 [2025-02-05 12:06:57,689 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:06:57,690 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 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.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:57,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:06:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states. [2025-02-05 12:06:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 3566. [2025-02-05 12:06:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3566 states, 3565 states have (on average 1.1778401122019635) internal successors, (4199), 3565 states have internal predecessors, (4199), 0 states have call successors, (0), 0 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:06:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 4199 transitions. [2025-02-05 12:06:57,755 INFO L78 Accepts]: Start accepts. Automaton has 3566 states and 4199 transitions. Word has length 152 [2025-02-05 12:06:57,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:57,756 INFO L471 AbstractCegarLoop]: Abstraction has 3566 states and 4199 transitions. [2025-02-05 12:06:57,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 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:06:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3566 states and 4199 transitions. [2025-02-05 12:06:57,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 12:06:57,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:57,758 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:06:57,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:06:57,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:57,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:57,759 INFO L85 PathProgramCache]: Analyzing trace with hash 49152702, now seen corresponding path program 1 times [2025-02-05 12:06:57,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:57,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131301062] [2025-02-05 12:06:57,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:57,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:57,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 12:06:57,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 12:06:57,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:57,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:06:58,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:58,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131301062] [2025-02-05 12:06:58,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131301062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:58,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:58,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:58,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791001485] [2025-02-05 12:06:58,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:58,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:58,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:58,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:58,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:58,036 INFO L87 Difference]: Start difference. First operand 3566 states and 4199 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:06:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:59,728 INFO L93 Difference]: Finished difference Result 9263 states and 11078 transitions. [2025-02-05 12:06:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:59,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-02-05 12:06:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:59,748 INFO L225 Difference]: With dead ends: 9263 [2025-02-05 12:06:59,748 INFO L226 Difference]: Without dead ends: 5699 [2025-02-05 12:06:59,753 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:06:59,754 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:59,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:06:59,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2025-02-05 12:06:59,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 5699. [2025-02-05 12:06:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5699 states, 5698 states have (on average 1.1597051597051597) internal successors, (6608), 5698 states have internal predecessors, (6608), 0 states have call successors, (0), 0 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:06:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5699 states to 5699 states and 6608 transitions. [2025-02-05 12:06:59,823 INFO L78 Accepts]: Start accepts. Automaton has 5699 states and 6608 transitions. Word has length 165 [2025-02-05 12:06:59,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:59,824 INFO L471 AbstractCegarLoop]: Abstraction has 5699 states and 6608 transitions. [2025-02-05 12:06:59,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:06:59,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5699 states and 6608 transitions. [2025-02-05 12:06:59,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 12:06:59,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:59,825 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:06:59,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:06:59,826 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:59,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:59,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2078845, now seen corresponding path program 1 times [2025-02-05 12:06:59,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:59,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939810258] [2025-02-05 12:06:59,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:59,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:59,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 12:06:59,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 12:06:59,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:59,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 12:06:59,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:59,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939810258] [2025-02-05 12:06:59,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939810258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:59,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:59,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:59,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69033539] [2025-02-05 12:06:59,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:59,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:59,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:59,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:59,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:59,990 INFO L87 Difference]: Start difference. First operand 5699 states and 6608 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:07:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:01,956 INFO L93 Difference]: Finished difference Result 16984 states and 19688 transitions. [2025-02-05 12:07:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:01,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 167 [2025-02-05 12:07:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:01,989 INFO L225 Difference]: With dead ends: 16984 [2025-02-05 12:07:01,989 INFO L226 Difference]: Without dead ends: 11287 [2025-02-05 12:07:01,997 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:07:01,997 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 525 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:01,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 240 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:07:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11287 states. [2025-02-05 12:07:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11287 to 10835. [2025-02-05 12:07:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10835 states, 10834 states have (on average 1.1594978770537199) internal successors, (12562), 10834 states have internal predecessors, (12562), 0 states have call successors, (0), 0 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:07:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10835 states to 10835 states and 12562 transitions. [2025-02-05 12:07:02,154 INFO L78 Accepts]: Start accepts. Automaton has 10835 states and 12562 transitions. Word has length 167 [2025-02-05 12:07:02,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:02,155 INFO L471 AbstractCegarLoop]: Abstraction has 10835 states and 12562 transitions. [2025-02-05 12:07:02,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:07:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand 10835 states and 12562 transitions. [2025-02-05 12:07:02,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-02-05 12:07:02,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:02,158 INFO L218 NwaCegarLoop]: trace histogram [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, 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:07:02,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:07:02,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:02,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:02,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1403027648, now seen corresponding path program 1 times [2025-02-05 12:07:02,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:02,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039717876] [2025-02-05 12:07:02,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:02,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:02,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-05 12:07:02,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-05 12:07:02,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:02,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 12:07:02,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039717876] [2025-02-05 12:07:02,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039717876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:02,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:02,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:02,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339785510] [2025-02-05 12:07:02,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:02,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:02,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:02,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:02,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:02,464 INFO L87 Difference]: Start difference. First operand 10835 states and 12562 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 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:07:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:04,181 INFO L93 Difference]: Finished difference Result 26329 states and 30808 transitions. [2025-02-05 12:07:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:04,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 250 [2025-02-05 12:07:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:04,212 INFO L225 Difference]: With dead ends: 26329 [2025-02-05 12:07:04,212 INFO L226 Difference]: Without dead ends: 14221 [2025-02-05 12:07:04,222 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:07:04,222 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 380 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:04,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 853 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:07:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14221 states. [2025-02-05 12:07:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14221 to 14221. [2025-02-05 12:07:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14221 states, 14220 states have (on average 1.1236990154711675) internal successors, (15979), 14220 states have internal predecessors, (15979), 0 states have call successors, (0), 0 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:07:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14221 states to 14221 states and 15979 transitions. [2025-02-05 12:07:04,389 INFO L78 Accepts]: Start accepts. Automaton has 14221 states and 15979 transitions. Word has length 250 [2025-02-05 12:07:04,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:04,390 INFO L471 AbstractCegarLoop]: Abstraction has 14221 states and 15979 transitions. [2025-02-05 12:07:04,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 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:07:04,390 INFO L276 IsEmpty]: Start isEmpty. Operand 14221 states and 15979 transitions. [2025-02-05 12:07:04,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-05 12:07:04,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:04,396 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-02-05 12:07:04,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:07:04,396 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:04,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1390350315, now seen corresponding path program 1 times [2025-02-05 12:07:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:04,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420291631] [2025-02-05 12:07:04,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:04,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:04,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-05 12:07:04,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-05 12:07:04,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:04,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-05 12:07:04,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:04,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420291631] [2025-02-05 12:07:04,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420291631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:04,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:04,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:04,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460024463] [2025-02-05 12:07:04,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:04,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:04,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:04,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:04,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:04,686 INFO L87 Difference]: Start difference. First operand 14221 states and 15979 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:07:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:06,392 INFO L93 Difference]: Finished difference Result 32721 states and 37176 transitions. [2025-02-05 12:07:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:06,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 325 [2025-02-05 12:07:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:06,452 INFO L225 Difference]: With dead ends: 32721 [2025-02-05 12:07:06,452 INFO L226 Difference]: Without dead ends: 17644 [2025-02-05 12:07:06,472 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:07:06,474 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 463 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:06,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 851 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:07:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17644 states. [2025-02-05 12:07:06,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17644 to 17638. [2025-02-05 12:07:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17638 states, 17637 states have (on average 1.12434087429835) internal successors, (19830), 17637 states have internal predecessors, (19830), 0 states have call successors, (0), 0 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:07:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17638 states to 17638 states and 19830 transitions. [2025-02-05 12:07:06,823 INFO L78 Accepts]: Start accepts. Automaton has 17638 states and 19830 transitions. Word has length 325 [2025-02-05 12:07:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:06,824 INFO L471 AbstractCegarLoop]: Abstraction has 17638 states and 19830 transitions. [2025-02-05 12:07:06,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:07:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 17638 states and 19830 transitions. [2025-02-05 12:07:06,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-02-05 12:07:06,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:06,838 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:06,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:07:06,839 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:06,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:06,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1995818186, now seen corresponding path program 1 times [2025-02-05 12:07:06,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:06,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469618326] [2025-02-05 12:07:06,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:06,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:06,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-02-05 12:07:06,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-02-05 12:07:06,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:06,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-05 12:07:07,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:07,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469618326] [2025-02-05 12:07:07,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469618326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:07,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:07,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:07,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388413144] [2025-02-05 12:07:07,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:07,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:07,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:07,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:07,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:07,123 INFO L87 Difference]: Start difference. First operand 17638 states and 19830 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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:07:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:09,022 INFO L93 Difference]: Finished difference Result 40800 states and 46225 transitions. [2025-02-05 12:07:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:09,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 370 [2025-02-05 12:07:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:09,064 INFO L225 Difference]: With dead ends: 40800 [2025-02-05 12:07:09,064 INFO L226 Difference]: Without dead ends: 21860 [2025-02-05 12:07:09,079 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:07:09,080 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 324 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:09,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 674 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:07:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21860 states. [2025-02-05 12:07:09,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21860 to 21857. [2025-02-05 12:07:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21857 states, 21856 states have (on average 1.1250915080527086) internal successors, (24590), 21856 states have internal predecessors, (24590), 0 states have call successors, (0), 0 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:07:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21857 states to 21857 states and 24590 transitions. [2025-02-05 12:07:09,369 INFO L78 Accepts]: Start accepts. Automaton has 21857 states and 24590 transitions. Word has length 370 [2025-02-05 12:07:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:09,369 INFO L471 AbstractCegarLoop]: Abstraction has 21857 states and 24590 transitions. [2025-02-05 12:07:09,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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:07:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 21857 states and 24590 transitions. [2025-02-05 12:07:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-05 12:07:09,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:09,377 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:09,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:07:09,378 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:09,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:09,379 INFO L85 PathProgramCache]: Analyzing trace with hash 795574629, now seen corresponding path program 1 times [2025-02-05 12:07:09,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:09,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343628025] [2025-02-05 12:07:09,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:09,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:09,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-05 12:07:09,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-05 12:07:09,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:09,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-02-05 12:07:09,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:09,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343628025] [2025-02-05 12:07:09,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343628025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:09,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:09,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:09,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548543995] [2025-02-05 12:07:09,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:09,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:09,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:09,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:09,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:09,824 INFO L87 Difference]: Start difference. First operand 21857 states and 24590 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 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:07:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:11,490 INFO L93 Difference]: Finished difference Result 49705 states and 55881 transitions. [2025-02-05 12:07:11,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:11,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 376 [2025-02-05 12:07:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:11,528 INFO L225 Difference]: With dead ends: 49705 [2025-02-05 12:07:11,529 INFO L226 Difference]: Without dead ends: 27850 [2025-02-05 12:07:11,548 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:07:11,548 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 508 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:11,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 156 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:07:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27850 states. [2025-02-05 12:07:11,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27850 to 21005. [2025-02-05 12:07:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21005 states, 21004 states have (on average 1.1283565035231384) internal successors, (23700), 21004 states have internal predecessors, (23700), 0 states have call successors, (0), 0 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:07:11,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21005 states to 21005 states and 23700 transitions. [2025-02-05 12:07:11,832 INFO L78 Accepts]: Start accepts. Automaton has 21005 states and 23700 transitions. Word has length 376 [2025-02-05 12:07:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:11,833 INFO L471 AbstractCegarLoop]: Abstraction has 21005 states and 23700 transitions. [2025-02-05 12:07:11,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 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:07:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 21005 states and 23700 transitions. [2025-02-05 12:07:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-02-05 12:07:11,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:11,843 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:11,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:07:11,843 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:11,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2118681798, now seen corresponding path program 1 times [2025-02-05 12:07:11,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:11,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888943064] [2025-02-05 12:07:11,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:11,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:11,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-02-05 12:07:11,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-02-05 12:07:11,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:11,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 21 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:12,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:12,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888943064] [2025-02-05 12:07:12,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888943064] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:07:12,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616260378] [2025-02-05 12:07:12,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:12,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:07:12,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:07:12,592 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:07:12,594 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:07:12,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-02-05 12:07:12,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-02-05 12:07:12,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:12,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:12,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:07:12,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:07:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 21 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:13,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:07:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:14,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616260378] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:07:14,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:07:14,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:07:14,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001384602] [2025-02-05 12:07:14,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:14,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:07:14,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:14,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:07:14,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:07:14,331 INFO L87 Difference]: Start difference. First operand 21005 states and 23700 transitions. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:07:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:17,008 INFO L93 Difference]: Finished difference Result 49268 states and 55679 transitions. [2025-02-05 12:07:17,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:07:17,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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 444 [2025-02-05 12:07:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:17,044 INFO L225 Difference]: With dead ends: 49268 [2025-02-05 12:07:17,044 INFO L226 Difference]: Without dead ends: 27412 [2025-02-05 12:07:17,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 885 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:07:17,059 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 696 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:17,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 145 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2114 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 12:07:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27412 states. [2025-02-05 12:07:17,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27412 to 25283. [2025-02-05 12:07:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25283 states, 25282 states have (on average 1.134364369907444) internal successors, (28679), 25282 states have internal predecessors, (28679), 0 states have call successors, (0), 0 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:07:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25283 states to 25283 states and 28679 transitions. [2025-02-05 12:07:17,334 INFO L78 Accepts]: Start accepts. Automaton has 25283 states and 28679 transitions. Word has length 444 [2025-02-05 12:07:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:17,335 INFO L471 AbstractCegarLoop]: Abstraction has 25283 states and 28679 transitions. [2025-02-05 12:07:17,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:07:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 25283 states and 28679 transitions. [2025-02-05 12:07:17,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-02-05 12:07:17,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:17,345 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:17,353 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:07:17,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 12:07:17,550 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:17,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:17,551 INFO L85 PathProgramCache]: Analyzing trace with hash -807565672, now seen corresponding path program 1 times [2025-02-05 12:07:17,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:17,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741163051] [2025-02-05 12:07:17,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:17,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:17,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-02-05 12:07:17,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-02-05 12:07:17,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:17,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-02-05 12:07:17,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:17,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741163051] [2025-02-05 12:07:17,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741163051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:17,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:17,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:17,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366710682] [2025-02-05 12:07:17,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:17,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:17,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:17,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:17,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:17,918 INFO L87 Difference]: Start difference. First operand 25283 states and 28679 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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:07:19,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:19,736 INFO L93 Difference]: Finished difference Result 58242 states and 66282 transitions. [2025-02-05 12:07:19,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:19,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 487 [2025-02-05 12:07:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:19,781 INFO L225 Difference]: With dead ends: 58242 [2025-02-05 12:07:19,781 INFO L226 Difference]: Without dead ends: 32960 [2025-02-05 12:07:19,804 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:07:19,805 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 466 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:19,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 380 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:07:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32960 states. [2025-02-05 12:07:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32960 to 31244. [2025-02-05 12:07:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31244 states, 31243 states have (on average 1.1272925135230292) internal successors, (35220), 31243 states have internal predecessors, (35220), 0 states have call successors, (0), 0 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:07:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31244 states to 31244 states and 35220 transitions. [2025-02-05 12:07:20,318 INFO L78 Accepts]: Start accepts. Automaton has 31244 states and 35220 transitions. Word has length 487 [2025-02-05 12:07:20,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:20,319 INFO L471 AbstractCegarLoop]: Abstraction has 31244 states and 35220 transitions. [2025-02-05 12:07:20,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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:07:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 31244 states and 35220 transitions. [2025-02-05 12:07:20,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-02-05 12:07:20,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:20,347 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:20,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 12:07:20,347 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:20,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:20,348 INFO L85 PathProgramCache]: Analyzing trace with hash 889729351, now seen corresponding path program 1 times [2025-02-05 12:07:20,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:20,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813451066] [2025-02-05 12:07:20,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:20,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:20,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 12:07:20,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 12:07:20,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:20,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 32 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:21,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:21,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813451066] [2025-02-05 12:07:21,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813451066] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:07:21,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344640465] [2025-02-05 12:07:21,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:21,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:07:21,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:07:21,130 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:07:21,133 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:07:21,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 12:07:21,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 12:07:21,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:21,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:21,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:07:21,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:07:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 177 proven. 73 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 12:07:21,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:07:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 12:07:21,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344640465] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:07:21,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:07:21,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2025-02-05 12:07:21,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676414149] [2025-02-05 12:07:21,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:21,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:07:21,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:21,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:07:21,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:07:21,955 INFO L87 Difference]: Start difference. First operand 31244 states and 35220 transitions. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 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:07:24,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:24,708 INFO L93 Difference]: Finished difference Result 79108 states and 89341 transitions. [2025-02-05 12:07:24,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:07:24,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 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 518 [2025-02-05 12:07:24,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:24,883 INFO L225 Difference]: With dead ends: 79108 [2025-02-05 12:07:24,883 INFO L226 Difference]: Without dead ends: 47866 [2025-02-05 12:07:24,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1038 GetRequests, 1033 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:07:24,911 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 873 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 2757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:24,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 174 Invalid, 2757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 2234 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 12:07:24,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47866 states. [2025-02-05 12:07:25,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47866 to 43179. [2025-02-05 12:07:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43179 states, 43178 states have (on average 1.1315484737597852) internal successors, (48858), 43178 states have internal predecessors, (48858), 0 states have call successors, (0), 0 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:07:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43179 states to 43179 states and 48858 transitions. [2025-02-05 12:07:25,636 INFO L78 Accepts]: Start accepts. Automaton has 43179 states and 48858 transitions. Word has length 518 [2025-02-05 12:07:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:25,637 INFO L471 AbstractCegarLoop]: Abstraction has 43179 states and 48858 transitions. [2025-02-05 12:07:25,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 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:07:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 43179 states and 48858 transitions. [2025-02-05 12:07:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2025-02-05 12:07:25,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:25,665 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:07:25,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 12:07:25,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:07:25,868 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:25,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:25,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1837770656, now seen corresponding path program 1 times [2025-02-05 12:07:25,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:25,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122735535] [2025-02-05 12:07:25,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:25,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:25,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-02-05 12:07:25,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-02-05 12:07:25,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:25,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-02-05 12:07:26,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:26,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122735535] [2025-02-05 12:07:26,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122735535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:26,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:26,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:26,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099018262] [2025-02-05 12:07:26,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:26,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:26,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:26,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:26,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:26,230 INFO L87 Difference]: Start difference. First operand 43179 states and 48858 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:28,148 INFO L93 Difference]: Finished difference Result 94436 states and 106867 transitions. [2025-02-05 12:07:28,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:28,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 613 [2025-02-05 12:07:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:28,237 INFO L225 Difference]: With dead ends: 94436 [2025-02-05 12:07:28,237 INFO L226 Difference]: Without dead ends: 49976 [2025-02-05 12:07:28,260 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:07:28,261 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 493 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:28,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 702 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:07:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49976 states. [2025-02-05 12:07:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49976 to 49119. [2025-02-05 12:07:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49119 states, 49118 states have (on average 1.1174518506453845) internal successors, (54887), 49118 states have internal predecessors, (54887), 0 states have call successors, (0), 0 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:07:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49119 states to 49119 states and 54887 transitions. [2025-02-05 12:07:29,086 INFO L78 Accepts]: Start accepts. Automaton has 49119 states and 54887 transitions. Word has length 613 [2025-02-05 12:07:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:29,086 INFO L471 AbstractCegarLoop]: Abstraction has 49119 states and 54887 transitions. [2025-02-05 12:07:29,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 49119 states and 54887 transitions. [2025-02-05 12:07:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-02-05 12:07:29,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:29,104 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:29,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:07:29,104 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:29,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:29,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1701152634, now seen corresponding path program 1 times [2025-02-05 12:07:29,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:29,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093673828] [2025-02-05 12:07:29,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:29,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:29,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-02-05 12:07:29,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-02-05 12:07:29,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:29,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-02-05 12:07:29,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:29,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093673828] [2025-02-05 12:07:29,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093673828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:29,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:29,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:29,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702382709] [2025-02-05 12:07:29,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:29,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:29,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:29,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:29,784 INFO L87 Difference]: Start difference. First operand 49119 states and 54887 transitions. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 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:07:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:31,462 INFO L93 Difference]: Finished difference Result 122126 states and 136058 transitions. [2025-02-05 12:07:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:31,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 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 623 [2025-02-05 12:07:31,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:31,591 INFO L225 Difference]: With dead ends: 122126 [2025-02-05 12:07:31,591 INFO L226 Difference]: Without dead ends: 73009 [2025-02-05 12:07:31,644 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:07:31,645 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 429 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:31,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 607 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:07:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73009 states. [2025-02-05 12:07:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73009 to 68709. [2025-02-05 12:07:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68709 states, 68708 states have (on average 1.1134947895441578) internal successors, (76506), 68708 states have internal predecessors, (76506), 0 states have call successors, (0), 0 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:07:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68709 states to 68709 states and 76506 transitions. [2025-02-05 12:07:32,859 INFO L78 Accepts]: Start accepts. Automaton has 68709 states and 76506 transitions. Word has length 623 [2025-02-05 12:07:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:32,879 INFO L471 AbstractCegarLoop]: Abstraction has 68709 states and 76506 transitions. [2025-02-05 12:07:32,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 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:07:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 68709 states and 76506 transitions. [2025-02-05 12:07:32,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2025-02-05 12:07:32,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:32,915 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:32,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 12:07:32,916 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:32,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:32,917 INFO L85 PathProgramCache]: Analyzing trace with hash 189248771, now seen corresponding path program 1 times [2025-02-05 12:07:32,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:32,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154373656] [2025-02-05 12:07:32,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:32,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:33,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 624 statements into 1 equivalence classes. [2025-02-05 12:07:33,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 624 of 624 statements. [2025-02-05 12:07:33,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:33,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-05 12:07:33,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:33,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154373656] [2025-02-05 12:07:33,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154373656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:33,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:33,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:33,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979527601] [2025-02-05 12:07:33,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:33,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:33,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:33,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:33,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:33,688 INFO L87 Difference]: Start difference. First operand 68709 states and 76506 transitions. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 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:07:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:35,641 INFO L93 Difference]: Finished difference Result 150624 states and 167907 transitions. [2025-02-05 12:07:35,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:35,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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 624 [2025-02-05 12:07:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:35,788 INFO L225 Difference]: With dead ends: 150624 [2025-02-05 12:07:35,789 INFO L226 Difference]: Without dead ends: 80210 [2025-02-05 12:07:35,847 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:07:35,848 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 425 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:35,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 645 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:07:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80210 states. [2025-02-05 12:07:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80210 to 75952. [2025-02-05 12:07:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75952 states, 75951 states have (on average 1.1081486748034917) internal successors, (84165), 75951 states have internal predecessors, (84165), 0 states have call successors, (0), 0 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:07:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75952 states to 75952 states and 84165 transitions. [2025-02-05 12:07:37,164 INFO L78 Accepts]: Start accepts. Automaton has 75952 states and 84165 transitions. Word has length 624 [2025-02-05 12:07:37,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:37,164 INFO L471 AbstractCegarLoop]: Abstraction has 75952 states and 84165 transitions. [2025-02-05 12:07:37,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 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:07:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 75952 states and 84165 transitions. [2025-02-05 12:07:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2025-02-05 12:07:37,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:37,185 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:37,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:07:37,186 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:37,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:37,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1274075392, now seen corresponding path program 1 times [2025-02-05 12:07:37,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:37,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236244655] [2025-02-05 12:07:37,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:37,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:37,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 628 statements into 1 equivalence classes. [2025-02-05 12:07:37,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 628 of 628 statements. [2025-02-05 12:07:37,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:37,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 537 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 12:07:38,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:38,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236244655] [2025-02-05 12:07:38,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236244655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:38,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:38,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:07:38,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310166233] [2025-02-05 12:07:38,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:38,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:07:38,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:38,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:07:38,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:07:38,297 INFO L87 Difference]: Start difference. First operand 75952 states and 84165 transitions. Second operand has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 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:07:41,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:41,261 INFO L93 Difference]: Finished difference Result 180486 states and 199831 transitions. [2025-02-05 12:07:41,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:07:41,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 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 628 [2025-02-05 12:07:41,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:41,439 INFO L225 Difference]: With dead ends: 180486 [2025-02-05 12:07:41,439 INFO L226 Difference]: Without dead ends: 104536 [2025-02-05 12:07:41,504 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:07:41,505 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 818 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:41,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 180 Invalid, 2656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:07:41,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104536 states. [2025-02-05 12:07:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104536 to 98994. [2025-02-05 12:07:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98994 states, 98993 states have (on average 1.1080379420767126) internal successors, (109688), 98993 states have internal predecessors, (109688), 0 states have call successors, (0), 0 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:07:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98994 states to 98994 states and 109688 transitions. [2025-02-05 12:07:43,105 INFO L78 Accepts]: Start accepts. Automaton has 98994 states and 109688 transitions. Word has length 628 [2025-02-05 12:07:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:43,105 INFO L471 AbstractCegarLoop]: Abstraction has 98994 states and 109688 transitions. [2025-02-05 12:07:43,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 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:07:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 98994 states and 109688 transitions. [2025-02-05 12:07:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 12:07:43,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:43,143 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:43,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 12:07:43,143 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:43,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:43,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1041738000, now seen corresponding path program 1 times [2025-02-05 12:07:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:43,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806955182] [2025-02-05 12:07:43,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:43,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 12:07:43,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 12:07:43,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:43,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 375 proven. 82 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 12:07:45,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:45,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806955182] [2025-02-05 12:07:45,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806955182] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:07:45,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887827871] [2025-02-05 12:07:45,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:45,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:07:45,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:07:45,150 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:07:45,153 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:07:45,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 12:07:45,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 12:07:45,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:45,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:45,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 12:07:45,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:07:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 375 proven. 82 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 12:07:46,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:07:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 456 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 12:07:47,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887827871] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 12:07:47,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 12:07:47,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-02-05 12:07:47,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199069427] [2025-02-05 12:07:47,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 12:07:47,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 12:07:47,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:47,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 12:07:47,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 12:07:47,303 INFO L87 Difference]: Start difference. First operand 98994 states and 109688 transitions. Second operand has 10 states, 10 states have (on average 89.2) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 0 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:07:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:52,411 INFO L93 Difference]: Finished difference Result 216993 states and 240202 transitions. [2025-02-05 12:07:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 12:07:52,412 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 89.2) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 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 643 [2025-02-05 12:07:52,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:52,603 INFO L225 Difference]: With dead ends: 216993 [2025-02-05 12:07:52,603 INFO L226 Difference]: Without dead ends: 118001 [2025-02-05 12:07:52,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1295 GetRequests, 1281 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-05 12:07:52,682 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 3241 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 6381 mSolverCounterSat, 835 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3241 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 7216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 835 IncrementalHoareTripleChecker+Valid, 6381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:52,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3241 Valid, 356 Invalid, 7216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [835 Valid, 6381 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-05 12:07:52,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118001 states. [2025-02-05 12:07:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118001 to 104521. [2025-02-05 12:07:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104521 states, 104520 states have (on average 1.1034347493302716) internal successors, (115331), 104520 states have internal predecessors, (115331), 0 states have call successors, (0), 0 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:07:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104521 states to 104521 states and 115331 transitions. [2025-02-05 12:07:54,768 INFO L78 Accepts]: Start accepts. Automaton has 104521 states and 115331 transitions. Word has length 643 [2025-02-05 12:07:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:54,769 INFO L471 AbstractCegarLoop]: Abstraction has 104521 states and 115331 transitions. [2025-02-05 12:07:54,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.2) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 0 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:07:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 104521 states and 115331 transitions. [2025-02-05 12:07:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2025-02-05 12:07:54,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:54,784 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:54,791 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:07:54,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:07:54,985 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:54,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:54,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1040596579, now seen corresponding path program 1 times [2025-02-05 12:07:54,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:54,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530324144] [2025-02-05 12:07:54,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:54,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:55,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-02-05 12:07:55,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-02-05 12:07:55,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:55,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-02-05 12:07:55,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:55,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530324144] [2025-02-05 12:07:55,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530324144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:55,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:55,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:55,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250771659] [2025-02-05 12:07:55,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:55,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:55,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:55,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:55,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:55,665 INFO L87 Difference]: Start difference. First operand 104521 states and 115331 transitions. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)