./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label21.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 14f7b86bfc883455824a54ae68bb832997924960967cf306b251b3f457d9ff4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:43:12,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:43:12,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:43:12,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:43:12,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:43:12,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:43:12,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:43:12,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:43:12,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:43:12,434 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:43:12,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:43:12,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:43:12,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:43:12,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:43:12,435 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:43:12,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:43:12,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:43:12,436 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:43:12,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:43:12,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:43:12,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:43:12,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:43:12,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:43:12,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:43:12,436 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:43:12,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:43:12,437 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:43:12,437 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:43:12,437 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:43:12,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:43:12,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:43:12,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:43:12,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:43:12,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:43:12,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:43:12,438 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:43:12,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:43:12,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:43:12,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:43:12,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:43:12,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:43:12,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:43:12,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:43:12,438 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 -> 14f7b86bfc883455824a54ae68bb832997924960967cf306b251b3f457d9ff4b [2025-02-05 11:43:12,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:43:12,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:43:12,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:43:12,696 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:43:12,696 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:43:12,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label21.c [2025-02-05 11:43:14,009 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48029e48a/22271edfdef44321a416b5e4f29859b4/FLAGf19186ddd [2025-02-05 11:43:14,437 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:43:14,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label21.c [2025-02-05 11:43:14,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48029e48a/22271edfdef44321a416b5e4f29859b4/FLAGf19186ddd [2025-02-05 11:43:14,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48029e48a/22271edfdef44321a416b5e4f29859b4 [2025-02-05 11:43:14,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:43:14,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:43:14,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:43:14,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:43:14,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:43:14,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:43:14" (1/1) ... [2025-02-05 11:43:14,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c292c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:43:14, skipping insertion in model container [2025-02-05 11:43:14,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:43:14" (1/1) ... [2025-02-05 11:43:14,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:43:14,816 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label21.c[3130,3143] [2025-02-05 11:43:15,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:43:15,528 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:43:15,542 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label21.c[3130,3143] [2025-02-05 11:43:15,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:43:15,917 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:43:15,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:43:15 WrapperNode [2025-02-05 11:43:15,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:43:15,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:43:15,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:43:15,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:43:15,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:43:15" (1/1) ... [2025-02-05 11:43:15,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:43:15" (1/1) ... [2025-02-05 11:43:16,490 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-02-05 11:43:16,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:43:16,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:43:16,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:43:16,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:43:16,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:43:15" (1/1) ... [2025-02-05 11:43:16,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:43:15" (1/1) ... [2025-02-05 11:43:16,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:43:15" (1/1) ... [2025-02-05 11:43:16,794 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 11:43:16,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:43:15" (1/1) ... [2025-02-05 11:43:16,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:43:15" (1/1) ... [2025-02-05 11:43:16,907 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:43:15" (1/1) ... [2025-02-05 11:43:16,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:43:15" (1/1) ... [2025-02-05 11:43:16,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:43:15" (1/1) ... [2025-02-05 11:43:16,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:43:15" (1/1) ... [2025-02-05 11:43:16,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:43:16,995 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:43:16,996 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:43:16,996 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:43:16,997 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:43:15" (1/1) ... [2025-02-05 11:43:17,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:43:17,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:43:17,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:43:17,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:43:17,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:43:17,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:43:17,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:43:17,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:43:17,104 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:43:17,106 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:43:21,510 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-02-05 11:43:21,510 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:43:21,511 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:43:21,706 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-02-05 11:43:21,707 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:43:21,747 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:43:21,749 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:43:21,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:43:21 BoogieIcfgContainer [2025-02-05 11:43:21,750 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:43:21,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:43:21,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:43:21,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:43:21,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:43:14" (1/3) ... [2025-02-05 11:43:21,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1cb9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:43:21, skipping insertion in model container [2025-02-05 11:43:21,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:43:15" (2/3) ... [2025-02-05 11:43:21,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1cb9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:43:21, skipping insertion in model container [2025-02-05 11:43:21,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:43:21" (3/3) ... [2025-02-05 11:43:21,760 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label21.c [2025-02-05 11:43:21,771 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:43:21,772 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label21.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:43:21,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:43:21,863 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;@33d1acbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:43:21,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:43:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:21,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 11:43:21,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:21,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:43:21,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:21,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:21,877 INFO L85 PathProgramCache]: Analyzing trace with hash -10876247, now seen corresponding path program 1 times [2025-02-05 11:43:21,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:21,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645219997] [2025-02-05 11:43:21,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:21,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:21,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 11:43:21,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 11:43:21,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:21,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:43:22,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:22,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645219997] [2025-02-05 11:43:22,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645219997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:22,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:22,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:43:22,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401484393] [2025-02-05 11:43:22,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:22,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:22,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:22,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:22,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:22,132 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:25,995 INFO L93 Difference]: Finished difference Result 3121 states and 5801 transitions. [2025-02-05 11:43:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:25,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-02-05 11:43:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:26,021 INFO L225 Difference]: With dead ends: 3121 [2025-02-05 11:43:26,021 INFO L226 Difference]: Without dead ends: 1944 [2025-02-05 11:43:26,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:26,031 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 969 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3124 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 3124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:26,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 571 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 3124 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-05 11:43:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2025-02-05 11:43:26,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1873. [2025-02-05 11:43:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1872 states have (on average 1.7393162393162394) internal successors, (3256), 1872 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3256 transitions. [2025-02-05 11:43:26,143 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3256 transitions. Word has length 20 [2025-02-05 11:43:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:26,145 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 3256 transitions. [2025-02-05 11:43:26,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3256 transitions. [2025-02-05 11:43:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 11:43:26,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:26,147 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:43:26,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:43:26,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:26,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:26,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2117954402, now seen corresponding path program 1 times [2025-02-05 11:43:26,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:26,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227477352] [2025-02-05 11:43:26,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:26,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:26,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 11:43:26,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 11:43:26,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:26,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:43:26,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:26,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227477352] [2025-02-05 11:43:26,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227477352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:26,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:26,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:43:26,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155941102] [2025-02-05 11:43:26,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:26,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:26,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:26,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:26,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:26,558 INFO L87 Difference]: Start difference. First operand 1873 states and 3256 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 11:43:29,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:29,767 INFO L93 Difference]: Finished difference Result 4604 states and 7964 transitions. [2025-02-05 11:43:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:29,768 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 85 [2025-02-05 11:43:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:29,778 INFO L225 Difference]: With dead ends: 4604 [2025-02-05 11:43:29,779 INFO L226 Difference]: Without dead ends: 2733 [2025-02-05 11:43:29,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:29,783 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:29,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 738 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:43:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2025-02-05 11:43:29,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2670. [2025-02-05 11:43:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2670 states, 2669 states have (on average 1.6579243162233046) internal successors, (4425), 2669 states have internal predecessors, (4425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 4425 transitions. [2025-02-05 11:43:29,839 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 4425 transitions. Word has length 85 [2025-02-05 11:43:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:29,839 INFO L471 AbstractCegarLoop]: Abstraction has 2670 states and 4425 transitions. [2025-02-05 11:43:29,839 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 11:43:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 4425 transitions. [2025-02-05 11:43:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 11:43:29,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:29,841 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:43:29,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:43:29,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:29,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:29,842 INFO L85 PathProgramCache]: Analyzing trace with hash 464732720, now seen corresponding path program 1 times [2025-02-05 11:43:29,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:29,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983464821] [2025-02-05 11:43:29,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:29,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:29,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 11:43:29,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 11:43:29,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:29,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:43:29,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:29,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983464821] [2025-02-05 11:43:29,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983464821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:29,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:29,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:43:29,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371506081] [2025-02-05 11:43:29,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:29,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:29,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:29,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:29,988 INFO L87 Difference]: Start difference. First operand 2670 states and 4425 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:32,798 INFO L93 Difference]: Finished difference Result 7732 states and 12864 transitions. [2025-02-05 11:43:32,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:32,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-02-05 11:43:32,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:32,817 INFO L225 Difference]: With dead ends: 7732 [2025-02-05 11:43:32,817 INFO L226 Difference]: Without dead ends: 5064 [2025-02-05 11:43:32,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:32,822 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 870 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 3255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:32,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1136 Invalid, 3255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:43:32,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2025-02-05 11:43:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 5063. [2025-02-05 11:43:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5063 states, 5062 states have (on average 1.454563413670486) internal successors, (7363), 5062 states have internal predecessors, (7363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5063 states to 5063 states and 7363 transitions. [2025-02-05 11:43:32,905 INFO L78 Accepts]: Start accepts. Automaton has 5063 states and 7363 transitions. Word has length 86 [2025-02-05 11:43:32,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:32,906 INFO L471 AbstractCegarLoop]: Abstraction has 5063 states and 7363 transitions. [2025-02-05 11:43:32,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5063 states and 7363 transitions. [2025-02-05 11:43:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 11:43:32,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:32,908 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:43:32,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:43:32,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:32,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:32,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1317417816, now seen corresponding path program 1 times [2025-02-05 11:43:32,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:32,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792964337] [2025-02-05 11:43:32,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:32,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:32,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 11:43:32,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 11:43:32,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:32,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:43:33,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:33,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792964337] [2025-02-05 11:43:33,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792964337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:33,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:33,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:43:33,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866694213] [2025-02-05 11:43:33,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:33,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:33,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:33,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:33,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:33,017 INFO L87 Difference]: Start difference. First operand 5063 states and 7363 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:36,000 INFO L93 Difference]: Finished difference Result 12513 states and 18431 transitions. [2025-02-05 11:43:36,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:36,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-05 11:43:36,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:36,032 INFO L225 Difference]: With dead ends: 12513 [2025-02-05 11:43:36,032 INFO L226 Difference]: Without dead ends: 7452 [2025-02-05 11:43:36,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:36,045 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 871 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:36,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1175 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:43:36,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states. [2025-02-05 11:43:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 7444. [2025-02-05 11:43:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7444 states, 7443 states have (on average 1.336826548434771) internal successors, (9950), 7443 states have internal predecessors, (9950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7444 states to 7444 states and 9950 transitions. [2025-02-05 11:43:36,164 INFO L78 Accepts]: Start accepts. Automaton has 7444 states and 9950 transitions. Word has length 89 [2025-02-05 11:43:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:36,164 INFO L471 AbstractCegarLoop]: Abstraction has 7444 states and 9950 transitions. [2025-02-05 11:43:36,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 7444 states and 9950 transitions. [2025-02-05 11:43:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 11:43:36,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:36,166 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:43:36,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:43:36,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:36,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:36,167 INFO L85 PathProgramCache]: Analyzing trace with hash -260184084, now seen corresponding path program 1 times [2025-02-05 11:43:36,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:36,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845967876] [2025-02-05 11:43:36,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:36,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:36,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 11:43:36,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 11:43:36,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:36,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:43:36,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:36,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845967876] [2025-02-05 11:43:36,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845967876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:36,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:36,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:43:36,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264469977] [2025-02-05 11:43:36,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:36,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:36,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:36,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:36,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:36,267 INFO L87 Difference]: Start difference. First operand 7444 states and 9950 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:38,862 INFO L93 Difference]: Finished difference Result 20424 states and 27781 transitions. [2025-02-05 11:43:38,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:38,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-02-05 11:43:38,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:38,893 INFO L225 Difference]: With dead ends: 20424 [2025-02-05 11:43:38,893 INFO L226 Difference]: Without dead ends: 13769 [2025-02-05 11:43:38,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:38,901 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 806 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2489 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 2489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:38,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1160 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 2489 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:43:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13769 states. [2025-02-05 11:43:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13769 to 13751. [2025-02-05 11:43:39,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13751 states, 13750 states have (on average 1.2261090909090908) internal successors, (16859), 13750 states have internal predecessors, (16859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13751 states to 13751 states and 16859 transitions. [2025-02-05 11:43:39,075 INFO L78 Accepts]: Start accepts. Automaton has 13751 states and 16859 transitions. Word has length 93 [2025-02-05 11:43:39,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:39,076 INFO L471 AbstractCegarLoop]: Abstraction has 13751 states and 16859 transitions. [2025-02-05 11:43:39,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 13751 states and 16859 transitions. [2025-02-05 11:43:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 11:43:39,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:39,077 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:43:39,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:43:39,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:39,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:39,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1913643200, now seen corresponding path program 1 times [2025-02-05 11:43:39,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:39,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910698729] [2025-02-05 11:43:39,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:39,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:39,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 11:43:39,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 11:43:39,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:39,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:43:39,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:39,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910698729] [2025-02-05 11:43:39,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910698729] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:39,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:39,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:39,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061920792] [2025-02-05 11:43:39,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:39,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:39,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:39,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:39,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:39,168 INFO L87 Difference]: Start difference. First operand 13751 states and 16859 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:42,024 INFO L93 Difference]: Finished difference Result 33022 states and 41589 transitions. [2025-02-05 11:43:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:42,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-02-05 11:43:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:42,053 INFO L225 Difference]: With dead ends: 33022 [2025-02-05 11:43:42,053 INFO L226 Difference]: Without dead ends: 20060 [2025-02-05 11:43:42,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:42,063 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 977 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 822 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 3371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 822 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:42,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 1671 Invalid, 3371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [822 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:43:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20060 states. [2025-02-05 11:43:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20060 to 20050. [2025-02-05 11:43:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.2318320115716495) internal successors, (24697), 20049 states have internal predecessors, (24697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 24697 transitions. [2025-02-05 11:43:42,275 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 24697 transitions. Word has length 109 [2025-02-05 11:43:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:42,275 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 24697 transitions. [2025-02-05 11:43:42,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 24697 transitions. [2025-02-05 11:43:42,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 11:43:42,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:42,278 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:43:42,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:43:42,278 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:42,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:42,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1330541308, now seen corresponding path program 1 times [2025-02-05 11:43:42,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:42,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639364541] [2025-02-05 11:43:42,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:42,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:42,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 11:43:42,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 11:43:42,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:42,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:43:42,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:42,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639364541] [2025-02-05 11:43:42,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639364541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:42,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:42,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:42,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034911370] [2025-02-05 11:43:42,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:42,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:42,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:42,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:42,368 INFO L87 Difference]: Start difference. First operand 20050 states and 24697 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:45,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:45,144 INFO L93 Difference]: Finished difference Result 39329 states and 48628 transitions. [2025-02-05 11:43:45,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:45,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-02-05 11:43:45,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:45,173 INFO L225 Difference]: With dead ends: 39329 [2025-02-05 11:43:45,174 INFO L226 Difference]: Without dead ends: 20068 [2025-02-05 11:43:45,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:45,183 INFO L435 NwaCegarLoop]: 1320 mSDtfsCounter, 1104 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 2469 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 2469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:45,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 1373 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 2469 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:43:45,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20068 states. [2025-02-05 11:43:45,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20068 to 20050. [2025-02-05 11:43:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.2169185495535937) internal successors, (24398), 20049 states have internal predecessors, (24398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 24398 transitions. [2025-02-05 11:43:45,360 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 24398 transitions. Word has length 116 [2025-02-05 11:43:45,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:45,361 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 24398 transitions. [2025-02-05 11:43:45,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 24398 transitions. [2025-02-05 11:43:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 11:43:45,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:45,363 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:43:45,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:43:45,364 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:45,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:45,364 INFO L85 PathProgramCache]: Analyzing trace with hash -211676871, now seen corresponding path program 1 times [2025-02-05 11:43:45,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:45,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859450960] [2025-02-05 11:43:45,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:45,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:45,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 11:43:45,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 11:43:45,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:45,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 11:43:45,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:45,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859450960] [2025-02-05 11:43:45,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859450960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:45,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:45,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:43:45,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774166596] [2025-02-05 11:43:45,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:45,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:45,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:45,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:45,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:45,589 INFO L87 Difference]: Start difference. First operand 20050 states and 24398 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:47,793 INFO L93 Difference]: Finished difference Result 39311 states and 47997 transitions. [2025-02-05 11:43:47,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:47,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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 191 [2025-02-05 11:43:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:47,889 INFO L225 Difference]: With dead ends: 39311 [2025-02-05 11:43:47,890 INFO L226 Difference]: Without dead ends: 20050 [2025-02-05 11:43:47,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:47,900 INFO L435 NwaCegarLoop]: 1077 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:47,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1206 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:43:47,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20050 states. [2025-02-05 11:43:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20050 to 20050. [2025-02-05 11:43:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.2166691605566362) internal successors, (24393), 20049 states have internal predecessors, (24393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 24393 transitions. [2025-02-05 11:43:48,077 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 24393 transitions. Word has length 191 [2025-02-05 11:43:48,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:48,077 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 24393 transitions. [2025-02-05 11:43:48,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 24393 transitions. [2025-02-05 11:43:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 11:43:48,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:48,081 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:43:48,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:43:48,081 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:48,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:48,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1882354187, now seen corresponding path program 1 times [2025-02-05 11:43:48,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:48,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915022689] [2025-02-05 11:43:48,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:48,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:48,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 11:43:48,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 11:43:48,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:48,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:43:48,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:48,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915022689] [2025-02-05 11:43:48,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915022689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:48,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:48,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:48,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596873882] [2025-02-05 11:43:48,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:48,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:48,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:48,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:48,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:48,186 INFO L87 Difference]: Start difference. First operand 20050 states and 24393 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:50,704 INFO L93 Difference]: Finished difference Result 39321 states and 48009 transitions. [2025-02-05 11:43:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:50,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 198 [2025-02-05 11:43:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:50,727 INFO L225 Difference]: With dead ends: 39321 [2025-02-05 11:43:50,727 INFO L226 Difference]: Without dead ends: 20060 [2025-02-05 11:43:50,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:50,742 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 887 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 3145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:50,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 928 Invalid, 3145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:43:50,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20060 states. [2025-02-05 11:43:50,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20060 to 20050. [2025-02-05 11:43:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.1535737443264003) internal successors, (23128), 20049 states have internal predecessors, (23128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 23128 transitions. [2025-02-05 11:43:50,993 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 23128 transitions. Word has length 198 [2025-02-05 11:43:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:50,994 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 23128 transitions. [2025-02-05 11:43:50,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 23128 transitions. [2025-02-05 11:43:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-02-05 11:43:51,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:51,002 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:43:51,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:43:51,003 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:51,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:51,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1127809798, now seen corresponding path program 1 times [2025-02-05 11:43:51,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:51,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906385754] [2025-02-05 11:43:51,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:51,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:51,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-05 11:43:51,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-05 11:43:51,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:51,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-02-05 11:43:51,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:51,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906385754] [2025-02-05 11:43:51,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906385754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:51,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:51,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:51,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105334832] [2025-02-05 11:43:51,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:51,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:51,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:51,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:51,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:51,202 INFO L87 Difference]: Start difference. First operand 20050 states and 23128 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:53,764 INFO L93 Difference]: Finished difference Result 45630 states and 53337 transitions. [2025-02-05 11:43:53,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:53,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 287 [2025-02-05 11:43:53,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:53,796 INFO L225 Difference]: With dead ends: 45630 [2025-02-05 11:43:53,796 INFO L226 Difference]: Without dead ends: 26369 [2025-02-05 11:43:53,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:53,812 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 968 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 844 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 844 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:53,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 787 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [844 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:43:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26369 states. [2025-02-05 11:43:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26369 to 26357. [2025-02-05 11:43:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26357 states, 26356 states have (on average 1.145204128092275) internal successors, (30183), 26356 states have internal predecessors, (30183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26357 states to 26357 states and 30183 transitions. [2025-02-05 11:43:54,032 INFO L78 Accepts]: Start accepts. Automaton has 26357 states and 30183 transitions. Word has length 287 [2025-02-05 11:43:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:54,033 INFO L471 AbstractCegarLoop]: Abstraction has 26357 states and 30183 transitions. [2025-02-05 11:43:54,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 26357 states and 30183 transitions. [2025-02-05 11:43:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-02-05 11:43:54,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:54,037 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:43:54,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:43:54,037 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:54,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:54,038 INFO L85 PathProgramCache]: Analyzing trace with hash 176812785, now seen corresponding path program 1 times [2025-02-05 11:43:54,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:54,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029352200] [2025-02-05 11:43:54,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:54,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:54,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-05 11:43:54,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-05 11:43:54,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:54,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 11:43:54,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:54,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029352200] [2025-02-05 11:43:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029352200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:54,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:54,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:54,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332537168] [2025-02-05 11:43:54,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:54,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:54,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:54,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:54,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:54,324 INFO L87 Difference]: Start difference. First operand 26357 states and 30183 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:56,472 INFO L93 Difference]: Finished difference Result 51951 states and 59618 transitions. [2025-02-05 11:43:56,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:56,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 339 [2025-02-05 11:43:56,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:56,499 INFO L225 Difference]: With dead ends: 51951 [2025-02-05 11:43:56,499 INFO L226 Difference]: Without dead ends: 26383 [2025-02-05 11:43:56,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:56,516 INFO L435 NwaCegarLoop]: 1775 mSDtfsCounter, 780 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2543 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 2543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:56,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1916 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 2543 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 11:43:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26383 states. [2025-02-05 11:43:56,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26383 to 26357. [2025-02-05 11:43:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26357 states, 26356 states have (on average 1.140992563363181) internal successors, (30072), 26356 states have internal predecessors, (30072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26357 states to 26357 states and 30072 transitions. [2025-02-05 11:43:56,726 INFO L78 Accepts]: Start accepts. Automaton has 26357 states and 30072 transitions. Word has length 339 [2025-02-05 11:43:56,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:56,726 INFO L471 AbstractCegarLoop]: Abstraction has 26357 states and 30072 transitions. [2025-02-05 11:43:56,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 26357 states and 30072 transitions. [2025-02-05 11:43:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-02-05 11:43:56,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:56,729 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:43:56,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:43:56,729 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:56,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1649326024, now seen corresponding path program 1 times [2025-02-05 11:43:56,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:56,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786810093] [2025-02-05 11:43:56,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:56,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-02-05 11:43:56,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-02-05 11:43:56,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:56,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-02-05 11:43:56,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:56,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786810093] [2025-02-05 11:43:56,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786810093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:56,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:56,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:56,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036953979] [2025-02-05 11:43:56,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:56,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:56,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:56,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:56,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:56,849 INFO L87 Difference]: Start difference. First operand 26357 states and 30072 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 11:43:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:59,412 INFO L93 Difference]: Finished difference Result 77099 states and 88119 transitions. [2025-02-05 11:43:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:59,413 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 347 [2025-02-05 11:43:59,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:59,471 INFO L225 Difference]: With dead ends: 77099 [2025-02-05 11:43:59,471 INFO L226 Difference]: Without dead ends: 49953 [2025-02-05 11:43:59,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:59,494 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 1000 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 810 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:59,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 1808 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [810 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:43:59,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49953 states. [2025-02-05 11:43:59,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49953 to 46010. [2025-02-05 11:43:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46010 states, 46009 states have (on average 1.1187159034102023) internal successors, (51471), 46009 states have internal predecessors, (51471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46010 states to 46010 states and 51471 transitions. [2025-02-05 11:43:59,877 INFO L78 Accepts]: Start accepts. Automaton has 46010 states and 51471 transitions. Word has length 347 [2025-02-05 11:43:59,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:59,878 INFO L471 AbstractCegarLoop]: Abstraction has 46010 states and 51471 transitions. [2025-02-05 11:43:59,878 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 11:43:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 46010 states and 51471 transitions. [2025-02-05 11:43:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-02-05 11:43:59,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:59,881 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:43:59,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:43:59,881 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:59,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:59,881 INFO L85 PathProgramCache]: Analyzing trace with hash -13039463, now seen corresponding path program 1 times [2025-02-05 11:43:59,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:59,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698579635] [2025-02-05 11:43:59,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:59,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:59,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-02-05 11:43:59,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-02-05 11:43:59,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:59,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 71 proven. 75 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-05 11:44:00,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:00,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698579635] [2025-02-05 11:44:00,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698579635] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:44:00,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100969192] [2025-02-05 11:44:00,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:00,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:44:00,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:44:00,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:44:00,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:44:00,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-02-05 11:44:00,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-02-05 11:44:00,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:00,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:00,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:44:00,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:44:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-02-05 11:44:00,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:44:00,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100969192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:00,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:44:00,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 11:44:00,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630757110] [2025-02-05 11:44:00,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:00,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:00,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:00,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:00,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:44:00,729 INFO L87 Difference]: Start difference. First operand 46010 states and 51471 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:03,029 INFO L93 Difference]: Finished difference Result 91222 states and 102140 transitions. [2025-02-05 11:44:03,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:03,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 347 [2025-02-05 11:44:03,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:03,078 INFO L225 Difference]: With dead ends: 91222 [2025-02-05 11:44:03,078 INFO L226 Difference]: Without dead ends: 46001 [2025-02-05 11:44:03,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:44:03,109 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 1041 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:03,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 792 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:44:03,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46001 states. [2025-02-05 11:44:03,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46001 to 46000. [2025-02-05 11:44:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46000 states, 45999 states have (on average 1.0863497032544185) internal successors, (49971), 45999 states have internal predecessors, (49971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46000 states to 46000 states and 49971 transitions. [2025-02-05 11:44:03,707 INFO L78 Accepts]: Start accepts. Automaton has 46000 states and 49971 transitions. Word has length 347 [2025-02-05 11:44:03,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:03,707 INFO L471 AbstractCegarLoop]: Abstraction has 46000 states and 49971 transitions. [2025-02-05 11:44:03,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 46000 states and 49971 transitions. [2025-02-05 11:44:03,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-02-05 11:44:03,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:03,712 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:03,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:44:03,913 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,SelfDestructingSolverStorable12 [2025-02-05 11:44:03,913 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:03,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:03,913 INFO L85 PathProgramCache]: Analyzing trace with hash -795452880, now seen corresponding path program 1 times [2025-02-05 11:44:03,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:03,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309148323] [2025-02-05 11:44:03,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:03,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:03,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-05 11:44:03,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-05 11:44:03,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:03,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 251 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 11:44:04,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:04,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309148323] [2025-02-05 11:44:04,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309148323] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:44:04,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317344860] [2025-02-05 11:44:04,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:04,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:44:04,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:44:04,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:44:04,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:44:04,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-05 11:44:04,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-05 11:44:04,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:04,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:04,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:44:04,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:44:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-05 11:44:04,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:44:04,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317344860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:04,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:44:04,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:44:04,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035642443] [2025-02-05 11:44:04,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:04,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:04,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:04,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:04,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:44:04,867 INFO L87 Difference]: Start difference. First operand 46000 states and 49971 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:07,947 INFO L93 Difference]: Finished difference Result 101431 states and 110493 transitions. [2025-02-05 11:44:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:07,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 368 [2025-02-05 11:44:07,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:08,007 INFO L225 Difference]: With dead ends: 101431 [2025-02-05 11:44:08,007 INFO L226 Difference]: Without dead ends: 56220 [2025-02-05 11:44:08,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:44:08,035 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 1217 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 961 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 3225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 961 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:08,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 399 Invalid, 3225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [961 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:44:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56220 states. [2025-02-05 11:44:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56220 to 56220. [2025-02-05 11:44:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56220 states, 56219 states have (on average 1.0820718974012344) internal successors, (60833), 56219 states have internal predecessors, (60833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56220 states to 56220 states and 60833 transitions. [2025-02-05 11:44:08,485 INFO L78 Accepts]: Start accepts. Automaton has 56220 states and 60833 transitions. Word has length 368 [2025-02-05 11:44:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:08,486 INFO L471 AbstractCegarLoop]: Abstraction has 56220 states and 60833 transitions. [2025-02-05 11:44:08,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 56220 states and 60833 transitions. [2025-02-05 11:44:08,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-02-05 11:44:08,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:08,491 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:08,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:44:08,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:44:08,692 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:08,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:08,692 INFO L85 PathProgramCache]: Analyzing trace with hash 87781800, now seen corresponding path program 1 times [2025-02-05 11:44:08,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:08,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761525031] [2025-02-05 11:44:08,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:08,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:08,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-02-05 11:44:08,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-02-05 11:44:08,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:08,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-02-05 11:44:08,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:08,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761525031] [2025-02-05 11:44:08,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761525031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:08,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:08,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:08,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378670538] [2025-02-05 11:44:08,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:08,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:08,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:08,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:08,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:08,937 INFO L87 Difference]: Start difference. First operand 56220 states and 60833 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:11,540 INFO L93 Difference]: Finished difference Result 123460 states and 134160 transitions. [2025-02-05 11:44:11,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:11,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 377 [2025-02-05 11:44:11,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:11,621 INFO L225 Difference]: With dead ends: 123460 [2025-02-05 11:44:11,621 INFO L226 Difference]: Without dead ends: 68029 [2025-02-05 11:44:11,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:11,662 INFO L435 NwaCegarLoop]: 1744 mSDtfsCounter, 788 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2478 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 2478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:11,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 1884 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 2478 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:44:11,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68029 states. [2025-02-05 11:44:12,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68029 to 67236. [2025-02-05 11:44:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67236 states, 67235 states have (on average 1.0782479363426787) internal successors, (72496), 67235 states have internal predecessors, (72496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67236 states to 67236 states and 72496 transitions. [2025-02-05 11:44:12,291 INFO L78 Accepts]: Start accepts. Automaton has 67236 states and 72496 transitions. Word has length 377 [2025-02-05 11:44:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:12,291 INFO L471 AbstractCegarLoop]: Abstraction has 67236 states and 72496 transitions. [2025-02-05 11:44:12,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 67236 states and 72496 transitions. [2025-02-05 11:44:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-02-05 11:44:12,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:12,295 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:12,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:44:12,295 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:12,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:12,296 INFO L85 PathProgramCache]: Analyzing trace with hash -360691240, now seen corresponding path program 1 times [2025-02-05 11:44:12,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:12,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774100650] [2025-02-05 11:44:12,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:12,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:12,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-02-05 11:44:12,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-02-05 11:44:12,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:12,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-02-05 11:44:12,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:12,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774100650] [2025-02-05 11:44:12,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774100650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:12,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:12,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:12,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695515852] [2025-02-05 11:44:12,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:12,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:44:12,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:12,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:44:12,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:44:12,557 INFO L87 Difference]: Start difference. First operand 67236 states and 72496 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:17,816 INFO L93 Difference]: Finished difference Result 184993 states and 199773 transitions. [2025-02-05 11:44:17,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:44:17,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 382 [2025-02-05 11:44:17,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:18,157 INFO L225 Difference]: With dead ends: 184993 [2025-02-05 11:44:18,157 INFO L226 Difference]: Without dead ends: 118546 [2025-02-05 11:44:18,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:44:18,185 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 1672 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5850 mSolverCounterSat, 956 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 6806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 956 IncrementalHoareTripleChecker+Valid, 5850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:18,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1672 Valid, 832 Invalid, 6806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [956 Valid, 5850 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-05 11:44:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118546 states. [2025-02-05 11:44:19,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118546 to 116870. [2025-02-05 11:44:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116870 states, 116869 states have (on average 1.073937485560756) internal successors, (125510), 116869 states have internal predecessors, (125510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116870 states to 116870 states and 125510 transitions. [2025-02-05 11:44:19,640 INFO L78 Accepts]: Start accepts. Automaton has 116870 states and 125510 transitions. Word has length 382 [2025-02-05 11:44:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:19,640 INFO L471 AbstractCegarLoop]: Abstraction has 116870 states and 125510 transitions. [2025-02-05 11:44:19,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 116870 states and 125510 transitions. [2025-02-05 11:44:19,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-02-05 11:44:19,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:19,645 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:19,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:44:19,645 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:19,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:19,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1643441034, now seen corresponding path program 1 times [2025-02-05 11:44:19,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:19,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522259314] [2025-02-05 11:44:19,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:19,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:19,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-02-05 11:44:19,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-02-05 11:44:19,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:19,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-02-05 11:44:19,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:19,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522259314] [2025-02-05 11:44:19,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522259314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:19,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:19,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:19,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119155886] [2025-02-05 11:44:19,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:19,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:19,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:19,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:19,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:19,929 INFO L87 Difference]: Start difference. First operand 116870 states and 125510 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:22,719 INFO L93 Difference]: Finished difference Result 232162 states and 249323 transitions. [2025-02-05 11:44:22,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:22,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 415 [2025-02-05 11:44:22,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:22,870 INFO L225 Difference]: With dead ends: 232162 [2025-02-05 11:44:22,870 INFO L226 Difference]: Without dead ends: 116081 [2025-02-05 11:44:22,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:22,934 INFO L435 NwaCegarLoop]: 1327 mSDtfsCounter, 1110 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:22,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1403 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:44:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116081 states. [2025-02-05 11:44:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116081 to 116080. [2025-02-05 11:44:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116080 states, 116079 states have (on average 1.0558498953299047) internal successors, (122562), 116079 states have internal predecessors, (122562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116080 states to 116080 states and 122562 transitions. [2025-02-05 11:44:24,367 INFO L78 Accepts]: Start accepts. Automaton has 116080 states and 122562 transitions. Word has length 415 [2025-02-05 11:44:24,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:24,367 INFO L471 AbstractCegarLoop]: Abstraction has 116080 states and 122562 transitions. [2025-02-05 11:44:24,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:24,367 INFO L276 IsEmpty]: Start isEmpty. Operand 116080 states and 122562 transitions. [2025-02-05 11:44:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-02-05 11:44:24,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:24,373 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:24,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:44:24,373 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:24,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:24,374 INFO L85 PathProgramCache]: Analyzing trace with hash 191023685, now seen corresponding path program 1 times [2025-02-05 11:44:24,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:24,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057091163] [2025-02-05 11:44:24,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:24,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:24,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-02-05 11:44:24,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-02-05 11:44:24,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:24,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:24,551 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2025-02-05 11:44:24,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:24,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057091163] [2025-02-05 11:44:24,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057091163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:24,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:24,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:44:24,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615621340] [2025-02-05 11:44:24,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:24,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:44:24,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:24,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:44:24,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:44:24,553 INFO L87 Difference]: Start difference. First operand 116080 states and 122562 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:30,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:30,729 INFO L93 Difference]: Finished difference Result 284218 states and 300085 transitions. [2025-02-05 11:44:30,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:44:30,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 451 [2025-02-05 11:44:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:30,917 INFO L225 Difference]: With dead ends: 284218 [2025-02-05 11:44:30,917 INFO L226 Difference]: Without dead ends: 168927 [2025-02-05 11:44:31,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:44:31,121 INFO L435 NwaCegarLoop]: 1432 mSDtfsCounter, 1785 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 7912 mSolverCounterSat, 833 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1785 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 8745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 833 IncrementalHoareTripleChecker+Valid, 7912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:31,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1785 Valid, 1677 Invalid, 8745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [833 Valid, 7912 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-02-05 11:44:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168927 states. [2025-02-05 11:44:32,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168927 to 164102. [2025-02-05 11:44:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164102 states, 164101 states have (on average 1.052875972724115) internal successors, (172778), 164101 states have internal predecessors, (172778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164102 states to 164102 states and 172778 transitions. [2025-02-05 11:44:33,043 INFO L78 Accepts]: Start accepts. Automaton has 164102 states and 172778 transitions. Word has length 451 [2025-02-05 11:44:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:33,043 INFO L471 AbstractCegarLoop]: Abstraction has 164102 states and 172778 transitions. [2025-02-05 11:44:33,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 164102 states and 172778 transitions. [2025-02-05 11:44:33,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-05 11:44:33,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:33,051 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:33,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 11:44:33,051 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:33,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:33,052 INFO L85 PathProgramCache]: Analyzing trace with hash -672122728, now seen corresponding path program 1 times [2025-02-05 11:44:33,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:33,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414993913] [2025-02-05 11:44:33,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:33,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:33,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 11:44:33,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 11:44:33,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:33,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 273 proven. 113 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 11:44:34,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:34,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414993913] [2025-02-05 11:44:34,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414993913] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:44:34,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340862527] [2025-02-05 11:44:34,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:34,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:44:34,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:44:34,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:44:34,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:44:34,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 11:44:34,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 11:44:34,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:34,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:34,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:44:34,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:44:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-02-05 11:44:34,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:44:34,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340862527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:34,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:44:34,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:44:34,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183019884] [2025-02-05 11:44:34,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:34,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:34,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:34,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:34,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:44:34,328 INFO L87 Difference]: Start difference. First operand 164102 states and 172778 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)