./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label06.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 e9764aa77a297d88a5c4424b1d4363c7dc0ea34b016b7ff505243e4a2273d457 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:01:21,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:01:21,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:01:21,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:01:21,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:01:21,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:01:21,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:01:21,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:01:21,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:01:21,275 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:01:21,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:01:21,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:01:21,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:01:21,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:01:21,275 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:01:21,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:01:21,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:01:21,276 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:01:21,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:01:21,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:01:21,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:01:21,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:01:21,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:01:21,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:01:21,276 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:01:21,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:01:21,276 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:01:21,277 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:01:21,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:01:21,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:01:21,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:01:21,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:01:21,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:01:21,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:01:21,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:01:21,277 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:01:21,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:01:21,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:01:21,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:01:21,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:01:21,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:01:21,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:01:21,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:01:21,278 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 -> e9764aa77a297d88a5c4424b1d4363c7dc0ea34b016b7ff505243e4a2273d457 [2025-02-05 12:01:21,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:01:21,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:01:21,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:01:21,488 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:01:21,488 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:01:21,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label06.c [2025-02-05 12:01:22,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8dcc7758/3cba06fc8cf1441eb40033241c8d80ec/FLAGd45697598 [2025-02-05 12:01:23,207 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:01:23,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label06.c [2025-02-05 12:01:23,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8dcc7758/3cba06fc8cf1441eb40033241c8d80ec/FLAGd45697598 [2025-02-05 12:01:23,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8dcc7758/3cba06fc8cf1441eb40033241c8d80ec [2025-02-05 12:01:23,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:01:23,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:01:23,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:01:23,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:01:23,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:01:23,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:01:23" (1/1) ... [2025-02-05 12:01:23,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f96c3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:23, skipping insertion in model container [2025-02-05 12:01:23,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:01:23" (1/1) ... [2025-02-05 12:01:23,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:01:24,056 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label06.c[4782,4795] [2025-02-05 12:01:24,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:01:24,725 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:01:24,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label06.c[4782,4795] [2025-02-05 12:01:25,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:01:25,071 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:01:25,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:25 WrapperNode [2025-02-05 12:01:25,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:01:25,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:01:25,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:01:25,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:01:25,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:25" (1/1) ... [2025-02-05 12:01:25,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:25" (1/1) ... [2025-02-05 12:01:25,374 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-02-05 12:01:25,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:01:25,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:01:25,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:01:25,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:01:25,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:25" (1/1) ... [2025-02-05 12:01:25,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:25" (1/1) ... [2025-02-05 12:01:25,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:25" (1/1) ... [2025-02-05 12:01:25,642 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 12:01:25,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:25" (1/1) ... [2025-02-05 12:01:25,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:25" (1/1) ... [2025-02-05 12:01:25,727 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:25" (1/1) ... [2025-02-05 12:01:25,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:25" (1/1) ... [2025-02-05 12:01:25,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:25" (1/1) ... [2025-02-05 12:01:25,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:25" (1/1) ... [2025-02-05 12:01:25,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:01:25,821 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:01:25,821 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:01:25,821 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:01:25,822 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:25" (1/1) ... [2025-02-05 12:01:25,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:01:25,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:01:25,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:01:25,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:01:25,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:01:25,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:01:25,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:01:25,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:01:25,923 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:01:25,924 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:01:28,634 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-02-05 12:01:28,729 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-02-05 12:01:28,729 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:01:28,743 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:01:28,743 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:01:28,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:01:28 BoogieIcfgContainer [2025-02-05 12:01:28,744 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:01:28,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:01:28,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:01:28,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:01:28,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:01:23" (1/3) ... [2025-02-05 12:01:28,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6387fe96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:01:28, skipping insertion in model container [2025-02-05 12:01:28,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:25" (2/3) ... [2025-02-05 12:01:28,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6387fe96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:01:28, skipping insertion in model container [2025-02-05 12:01:28,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:01:28" (3/3) ... [2025-02-05 12:01:28,751 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label06.c [2025-02-05 12:01:28,761 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:01:28,762 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label06.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:01:28,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:01:28,825 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;@73a4e866, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:01:28,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:01:28,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 12:01:28,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:28,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:28,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:28,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:28,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1342596888, now seen corresponding path program 1 times [2025-02-05 12:01:28,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:28,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815574046] [2025-02-05 12:01:28,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:28,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:28,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 12:01:28,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 12:01:28,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:28,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:29,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:29,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815574046] [2025-02-05 12:01:29,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815574046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:29,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:29,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:01:29,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685304037] [2025-02-05 12:01:29,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:29,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:29,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:29,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:29,071 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:31,122 INFO L93 Difference]: Finished difference Result 1642 states and 3021 transitions. [2025-02-05 12:01:31,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:31,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-02-05 12:01:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:31,142 INFO L225 Difference]: With dead ends: 1642 [2025-02-05 12:01:31,142 INFO L226 Difference]: Without dead ends: 975 [2025-02-05 12:01:31,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:31,149 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 459 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:31,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 551 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:01:31,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-02-05 12:01:31,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2025-02-05 12:01:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2025-02-05 12:01:31,220 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 31 [2025-02-05 12:01:31,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:31,221 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2025-02-05 12:01:31,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2025-02-05 12:01:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 12:01:31,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:31,223 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:31,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:01:31,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:31,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:31,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1416566145, now seen corresponding path program 1 times [2025-02-05 12:01:31,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:31,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623584305] [2025-02-05 12:01:31,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:31,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:31,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 12:01:31,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 12:01:31,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:31,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:31,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:31,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623584305] [2025-02-05 12:01:31,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623584305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:31,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:31,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:31,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834118678] [2025-02-05 12:01:31,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:31,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:31,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:31,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:31,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:31,694 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:33,496 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2025-02-05 12:01:33,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:33,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-02-05 12:01:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:33,502 INFO L225 Difference]: With dead ends: 2814 [2025-02-05 12:01:33,502 INFO L226 Difference]: Without dead ends: 1844 [2025-02-05 12:01:33,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:33,504 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 460 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:33,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 921 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:01:33,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-02-05 12:01:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2025-02-05 12:01:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2025-02-05 12:01:33,530 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 101 [2025-02-05 12:01:33,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:33,531 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2025-02-05 12:01:33,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2025-02-05 12:01:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 12:01:33,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:33,533 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:33,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:01:33,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:33,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash -631676630, now seen corresponding path program 1 times [2025-02-05 12:01:33,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:33,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94377210] [2025-02-05 12:01:33,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:33,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:33,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 12:01:33,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 12:01:33,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:33,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:33,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:33,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94377210] [2025-02-05 12:01:33,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94377210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:33,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:33,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:01:33,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37322155] [2025-02-05 12:01:33,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:33,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:33,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:33,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:33,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:33,748 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:35,430 INFO L93 Difference]: Finished difference Result 5395 states and 7326 transitions. [2025-02-05 12:01:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:35,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-02-05 12:01:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:35,439 INFO L225 Difference]: With dead ends: 5395 [2025-02-05 12:01:35,439 INFO L226 Difference]: Without dead ends: 2701 [2025-02-05 12:01:35,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:35,448 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:35,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:01:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-02-05 12:01:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701. [2025-02-05 12:01:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2700 states have (on average 1.191851851851852) internal successors, (3218), 2700 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3218 transitions. [2025-02-05 12:01:35,488 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3218 transitions. Word has length 123 [2025-02-05 12:01:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:35,489 INFO L471 AbstractCegarLoop]: Abstraction has 2701 states and 3218 transitions. [2025-02-05 12:01:35,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3218 transitions. [2025-02-05 12:01:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 12:01:35,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:35,493 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:35,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:01:35,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:35,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:35,497 INFO L85 PathProgramCache]: Analyzing trace with hash -964297021, now seen corresponding path program 1 times [2025-02-05 12:01:35,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:35,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466984428] [2025-02-05 12:01:35,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:35,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:35,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 12:01:35,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 12:01:35,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:35,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:35,721 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:35,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:35,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466984428] [2025-02-05 12:01:35,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466984428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:35,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:35,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:35,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162432965] [2025-02-05 12:01:35,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:35,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:35,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:35,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:35,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:35,723 INFO L87 Difference]: Start difference. First operand 2701 states and 3218 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:37,350 INFO L93 Difference]: Finished difference Result 7108 states and 8598 transitions. [2025-02-05 12:01:37,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:37,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 183 [2025-02-05 12:01:37,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:37,364 INFO L225 Difference]: With dead ends: 7108 [2025-02-05 12:01:37,364 INFO L226 Difference]: Without dead ends: 4409 [2025-02-05 12:01:37,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:37,368 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:37,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:01:37,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2025-02-05 12:01:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4409. [2025-02-05 12:01:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4408 states have (on average 1.1705989110707804) internal successors, (5160), 4408 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 5160 transitions. [2025-02-05 12:01:37,430 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 5160 transitions. Word has length 183 [2025-02-05 12:01:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:37,430 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 5160 transitions. [2025-02-05 12:01:37,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 5160 transitions. [2025-02-05 12:01:37,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-05 12:01:37,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:37,434 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:37,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:01:37,434 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:37,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:37,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1703838648, now seen corresponding path program 1 times [2025-02-05 12:01:37,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:37,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480841348] [2025-02-05 12:01:37,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:37,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:37,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-05 12:01:37,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-05 12:01:37,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:37,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 12:01:37,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:37,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480841348] [2025-02-05 12:01:37,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480841348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:37,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:37,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:37,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105418319] [2025-02-05 12:01:37,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:37,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:37,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:37,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:37,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:37,623 INFO L87 Difference]: Start difference. First operand 4409 states and 5160 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 12:01:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:39,026 INFO L93 Difference]: Finished difference Result 10936 states and 12970 transitions. [2025-02-05 12:01:39,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:39,026 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 185 [2025-02-05 12:01:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:39,043 INFO L225 Difference]: With dead ends: 10936 [2025-02-05 12:01:39,044 INFO L226 Difference]: Without dead ends: 6528 [2025-02-05 12:01:39,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:39,049 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 420 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:39,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 445 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:01:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6528 states. [2025-02-05 12:01:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 4382. [2025-02-05 12:01:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4381 states have (on average 1.1684546907098836) internal successors, (5119), 4381 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5119 transitions. [2025-02-05 12:01:39,169 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 5119 transitions. Word has length 185 [2025-02-05 12:01:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:39,170 INFO L471 AbstractCegarLoop]: Abstraction has 4382 states and 5119 transitions. [2025-02-05 12:01:39,170 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 12:01:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 5119 transitions. [2025-02-05 12:01:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-05 12:01:39,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:39,172 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:39,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:01:39,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:39,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:39,173 INFO L85 PathProgramCache]: Analyzing trace with hash 220195136, now seen corresponding path program 1 times [2025-02-05 12:01:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:39,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536908290] [2025-02-05 12:01:39,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:39,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:39,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 12:01:39,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 12:01:39,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:39,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:01:39,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:39,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536908290] [2025-02-05 12:01:39,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536908290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:39,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:39,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:39,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777694590] [2025-02-05 12:01:39,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:39,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:39,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:39,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:39,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:39,413 INFO L87 Difference]: Start difference. First operand 4382 states and 5119 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:41,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:41,097 INFO L93 Difference]: Finished difference Result 10910 states and 12924 transitions. [2025-02-05 12:01:41,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:41,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2025-02-05 12:01:41,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:41,113 INFO L225 Difference]: With dead ends: 10910 [2025-02-05 12:01:41,113 INFO L226 Difference]: Without dead ends: 6530 [2025-02-05 12:01:41,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:41,118 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 474 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:41,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 414 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:01:41,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6530 states. [2025-02-05 12:01:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6530 to 6096. [2025-02-05 12:01:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6096 states, 6095 states have (on average 1.188515176374077) internal successors, (7244), 6095 states have internal predecessors, (7244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6096 states to 6096 states and 7244 transitions. [2025-02-05 12:01:41,180 INFO L78 Accepts]: Start accepts. Automaton has 6096 states and 7244 transitions. Word has length 251 [2025-02-05 12:01:41,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:41,180 INFO L471 AbstractCegarLoop]: Abstraction has 6096 states and 7244 transitions. [2025-02-05 12:01:41,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:41,181 INFO L276 IsEmpty]: Start isEmpty. Operand 6096 states and 7244 transitions. [2025-02-05 12:01:41,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-05 12:01:41,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:41,183 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:41,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:01:41,184 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:41,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:41,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1823403430, now seen corresponding path program 1 times [2025-02-05 12:01:41,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:41,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896291492] [2025-02-05 12:01:41,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:41,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:41,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-05 12:01:41,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-05 12:01:41,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:41,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:41,380 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 12:01:41,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:41,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896291492] [2025-02-05 12:01:41,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896291492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:41,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:41,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:41,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161409903] [2025-02-05 12:01:41,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:41,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:41,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:41,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:41,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:41,383 INFO L87 Difference]: Start difference. First operand 6096 states and 7244 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:42,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:42,947 INFO L93 Difference]: Finished difference Result 15622 states and 18732 transitions. [2025-02-05 12:01:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:42,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 263 [2025-02-05 12:01:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:42,985 INFO L225 Difference]: With dead ends: 15622 [2025-02-05 12:01:42,987 INFO L226 Difference]: Without dead ends: 9091 [2025-02-05 12:01:42,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:42,993 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 494 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:42,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 626 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:01:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9091 states. [2025-02-05 12:01:43,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9091 to 8660. [2025-02-05 12:01:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8660 states, 8659 states have (on average 1.1809677791892828) internal successors, (10226), 8659 states have internal predecessors, (10226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8660 states to 8660 states and 10226 transitions. [2025-02-05 12:01:43,116 INFO L78 Accepts]: Start accepts. Automaton has 8660 states and 10226 transitions. Word has length 263 [2025-02-05 12:01:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:43,118 INFO L471 AbstractCegarLoop]: Abstraction has 8660 states and 10226 transitions. [2025-02-05 12:01:43,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 8660 states and 10226 transitions. [2025-02-05 12:01:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-05 12:01:43,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:43,125 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:43,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:01:43,126 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:43,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:43,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1747626405, now seen corresponding path program 1 times [2025-02-05 12:01:43,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:43,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612883976] [2025-02-05 12:01:43,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:43,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:43,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-05 12:01:43,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-05 12:01:43,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:43,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 12:01:43,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:43,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612883976] [2025-02-05 12:01:43,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612883976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:43,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:43,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:43,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357305680] [2025-02-05 12:01:43,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:43,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:43,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:43,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:43,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:43,263 INFO L87 Difference]: Start difference. First operand 8660 states and 10226 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:44,663 INFO L93 Difference]: Finished difference Result 20718 states and 24610 transitions. [2025-02-05 12:01:44,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:44,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 268 [2025-02-05 12:01:44,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:44,682 INFO L225 Difference]: With dead ends: 20718 [2025-02-05 12:01:44,682 INFO L226 Difference]: Without dead ends: 12060 [2025-02-05 12:01:44,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:44,690 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 379 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:44,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 826 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:01:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12060 states. [2025-02-05 12:01:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12060 to 11210. [2025-02-05 12:01:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11210 states, 11209 states have (on average 1.157819609242573) internal successors, (12978), 11209 states have internal predecessors, (12978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11210 states to 11210 states and 12978 transitions. [2025-02-05 12:01:44,786 INFO L78 Accepts]: Start accepts. Automaton has 11210 states and 12978 transitions. Word has length 268 [2025-02-05 12:01:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:44,787 INFO L471 AbstractCegarLoop]: Abstraction has 11210 states and 12978 transitions. [2025-02-05 12:01:44,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 11210 states and 12978 transitions. [2025-02-05 12:01:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-02-05 12:01:44,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:44,790 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:44,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:01:44,790 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:44,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:44,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1676761440, now seen corresponding path program 1 times [2025-02-05 12:01:44,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:44,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592303018] [2025-02-05 12:01:44,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:44,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:44,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-02-05 12:01:44,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-02-05 12:01:44,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:44,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:01:45,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:45,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592303018] [2025-02-05 12:01:45,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592303018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:45,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:45,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:01:45,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677201496] [2025-02-05 12:01:45,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:45,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:01:45,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:45,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:01:45,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:01:45,105 INFO L87 Difference]: Start difference. First operand 11210 states and 12978 transitions. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:47,597 INFO L93 Difference]: Finished difference Result 40370 states and 46572 transitions. [2025-02-05 12:01:47,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:01:47,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 0 states have call successors, (0), 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 291 [2025-02-05 12:01:47,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:47,692 INFO L225 Difference]: With dead ends: 40370 [2025-02-05 12:01:47,692 INFO L226 Difference]: Without dead ends: 27449 [2025-02-05 12:01:47,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:01:47,722 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 876 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2777 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 3210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:47,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 326 Invalid, 3210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2777 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 12:01:47,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27449 states. [2025-02-05 12:01:48,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27449 to 26980. [2025-02-05 12:01:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26980 states, 26979 states have (on average 1.1290262796990251) internal successors, (30460), 26979 states have internal predecessors, (30460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26980 states to 26980 states and 30460 transitions. [2025-02-05 12:01:48,274 INFO L78 Accepts]: Start accepts. Automaton has 26980 states and 30460 transitions. Word has length 291 [2025-02-05 12:01:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:48,274 INFO L471 AbstractCegarLoop]: Abstraction has 26980 states and 30460 transitions. [2025-02-05 12:01:48,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 26980 states and 30460 transitions. [2025-02-05 12:01:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-05 12:01:48,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:48,288 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2025-02-05 12:01:48,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:01:48,292 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:48,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:48,292 INFO L85 PathProgramCache]: Analyzing trace with hash -697140207, now seen corresponding path program 1 times [2025-02-05 12:01:48,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:48,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437614601] [2025-02-05 12:01:48,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:48,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:48,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-05 12:01:48,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-05 12:01:48,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:48,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:48,738 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 200 proven. 82 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 12:01:48,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:48,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437614601] [2025-02-05 12:01:48,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437614601] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:01:48,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760103697] [2025-02-05 12:01:48,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:48,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:01:48,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:01:48,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:01:48,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 12:01:48,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-05 12:01:48,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-05 12:01:48,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:48,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:48,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 12:01:48,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:01:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 158 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:49,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:01:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:50,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760103697] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:01:50,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:01:50,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2025-02-05 12:01:50,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943911251] [2025-02-05 12:01:50,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:50,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 12:01:50,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:50,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 12:01:50,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:01:50,362 INFO L87 Difference]: Start difference. First operand 26980 states and 30460 transitions. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:53,868 INFO L93 Difference]: Finished difference Result 75670 states and 85245 transitions. [2025-02-05 12:01:53,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 12:01:53,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 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 372 [2025-02-05 12:01:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:53,922 INFO L225 Difference]: With dead ends: 75670 [2025-02-05 12:01:53,923 INFO L226 Difference]: Without dead ends: 47840 [2025-02-05 12:01:53,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 739 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:01:53,947 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 1506 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2650 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 3486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 2650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:53,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 157 Invalid, 3486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 2650 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 12:01:53,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47840 states. [2025-02-05 12:01:54,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47840 to 46123. [2025-02-05 12:01:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46123 states, 46122 states have (on average 1.102012054984606) internal successors, (50827), 46122 states have internal predecessors, (50827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46123 states to 46123 states and 50827 transitions. [2025-02-05 12:01:54,461 INFO L78 Accepts]: Start accepts. Automaton has 46123 states and 50827 transitions. Word has length 372 [2025-02-05 12:01:54,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:54,462 INFO L471 AbstractCegarLoop]: Abstraction has 46123 states and 50827 transitions. [2025-02-05 12:01:54,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 46123 states and 50827 transitions. [2025-02-05 12:01:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-02-05 12:01:54,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:54,467 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:54,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 12:01:54,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 12:01:54,672 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:54,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:54,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1321917499, now seen corresponding path program 1 times [2025-02-05 12:01:54,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:54,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478878555] [2025-02-05 12:01:54,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:54,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:54,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-02-05 12:01:54,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-02-05 12:01:54,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:54,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 495 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-05 12:01:55,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:55,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478878555] [2025-02-05 12:01:55,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478878555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:55,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:55,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:55,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682444380] [2025-02-05 12:01:55,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:55,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:55,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:55,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:55,074 INFO L87 Difference]: Start difference. First operand 46123 states and 50827 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:57,037 INFO L93 Difference]: Finished difference Result 108858 states and 120237 transitions. [2025-02-05 12:01:57,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:57,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 12:01:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:57,115 INFO L225 Difference]: With dead ends: 108858 [2025-02-05 12:01:57,115 INFO L226 Difference]: Without dead ends: 62309 [2025-02-05 12:01:57,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:57,153 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 395 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:57,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 335 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:01:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62309 states. [2025-02-05 12:01:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62309 to 61435. [2025-02-05 12:01:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61435 states, 61434 states have (on average 1.0888433115213074) internal successors, (66892), 61434 states have internal predecessors, (66892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61435 states to 61435 states and 66892 transitions. [2025-02-05 12:01:57,860 INFO L78 Accepts]: Start accepts. Automaton has 61435 states and 66892 transitions. Word has length 377 [2025-02-05 12:01:57,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:57,860 INFO L471 AbstractCegarLoop]: Abstraction has 61435 states and 66892 transitions. [2025-02-05 12:01:57,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 61435 states and 66892 transitions. [2025-02-05 12:01:57,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-02-05 12:01:57,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:57,874 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:57,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 12:01:57,877 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:57,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:57,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1614257070, now seen corresponding path program 1 times [2025-02-05 12:01:57,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:57,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946295506] [2025-02-05 12:01:57,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:57,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:58,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-02-05 12:01:58,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-02-05 12:01:58,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:58,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 301 proven. 29 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-05 12:01:58,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:58,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946295506] [2025-02-05 12:01:58,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946295506] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:01:58,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006219644] [2025-02-05 12:01:58,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:58,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:01:58,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:01:58,823 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:01:58,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 12:01:58,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-02-05 12:01:58,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-02-05 12:01:58,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:58,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:58,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 12:01:58,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:01:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 387 proven. 82 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-02-05 12:01:59,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:01:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 387 proven. 82 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-02-05 12:01:59,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006219644] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 12:01:59,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 12:01:59,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-02-05 12:01:59,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637030879] [2025-02-05 12:01:59,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 12:01:59,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 12:01:59,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:59,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 12:01:59,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 12:01:59,870 INFO L87 Difference]: Start difference. First operand 61435 states and 66892 transitions. Second operand has 9 states, 9 states have (on average 80.66666666666667) internal successors, (726), 9 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:07,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:07,807 INFO L93 Difference]: Finished difference Result 168463 states and 183226 transitions. [2025-02-05 12:02:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 12:02:07,808 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 80.66666666666667) internal successors, (726), 9 states have internal predecessors, (726), 0 states have call successors, (0), 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 411 [2025-02-05 12:02:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:07,919 INFO L225 Difference]: With dead ends: 168463 [2025-02-05 12:02:07,919 INFO L226 Difference]: Without dead ends: 105328 [2025-02-05 12:02:07,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 826 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2025-02-05 12:02:07,965 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 8396 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 9351 mSolverCounterSat, 1693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8396 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 11044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1693 IncrementalHoareTripleChecker+Valid, 9351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:07,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8396 Valid, 288 Invalid, 11044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1693 Valid, 9351 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-02-05 12:02:08,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105328 states. [2025-02-05 12:02:09,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105328 to 85647. [2025-02-05 12:02:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85647 states, 85646 states have (on average 1.0752983209957265) internal successors, (92095), 85646 states have internal predecessors, (92095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85647 states to 85647 states and 92095 transitions. [2025-02-05 12:02:09,764 INFO L78 Accepts]: Start accepts. Automaton has 85647 states and 92095 transitions. Word has length 411 [2025-02-05 12:02:09,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:09,764 INFO L471 AbstractCegarLoop]: Abstraction has 85647 states and 92095 transitions. [2025-02-05 12:02:09,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.66666666666667) internal successors, (726), 9 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 85647 states and 92095 transitions. [2025-02-05 12:02:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-02-05 12:02:09,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:09,791 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:09,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 12:02:09,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:09,992 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:09,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:09,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1071689491, now seen corresponding path program 1 times [2025-02-05 12:02:09,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:09,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260429309] [2025-02-05 12:02:09,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:09,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:10,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-02-05 12:02:10,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-02-05 12:02:10,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:10,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-02-05 12:02:10,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:10,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260429309] [2025-02-05 12:02:10,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260429309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:10,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:10,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:10,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264273930] [2025-02-05 12:02:10,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:10,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:10,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:10,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:10,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:10,356 INFO L87 Difference]: Start difference. First operand 85647 states and 92095 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:11,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:11,806 INFO L93 Difference]: Finished difference Result 169587 states and 182355 transitions. [2025-02-05 12:02:11,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:11,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 497 [2025-02-05 12:02:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:11,903 INFO L225 Difference]: With dead ends: 169587 [2025-02-05 12:02:11,904 INFO L226 Difference]: Without dead ends: 83942 [2025-02-05 12:02:11,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:11,948 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 451 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:11,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 685 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 12:02:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83942 states. [2025-02-05 12:02:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83942 to 83940. [2025-02-05 12:02:13,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83940 states, 83939 states have (on average 1.0621522772489547) internal successors, (89156), 83939 states have internal predecessors, (89156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83940 states to 83940 states and 89156 transitions. [2025-02-05 12:02:13,420 INFO L78 Accepts]: Start accepts. Automaton has 83940 states and 89156 transitions. Word has length 497 [2025-02-05 12:02:13,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:13,421 INFO L471 AbstractCegarLoop]: Abstraction has 83940 states and 89156 transitions. [2025-02-05 12:02:13,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 83940 states and 89156 transitions. [2025-02-05 12:02:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-02-05 12:02:13,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:13,436 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:13,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 12:02:13,436 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:13,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:13,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2080845024, now seen corresponding path program 1 times [2025-02-05 12:02:13,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:13,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937780973] [2025-02-05 12:02:13,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:13,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:13,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-02-05 12:02:13,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-02-05 12:02:13,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:13,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:13,987 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 583 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2025-02-05 12:02:13,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:13,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937780973] [2025-02-05 12:02:13,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937780973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:13,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:13,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:02:13,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368554100] [2025-02-05 12:02:13,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:13,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:13,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:13,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:13,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:13,994 INFO L87 Difference]: Start difference. First operand 83940 states and 89156 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:14,927 INFO L93 Difference]: Finished difference Result 163189 states and 173361 transitions. [2025-02-05 12:02:14,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:14,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 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 574 [2025-02-05 12:02:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:15,016 INFO L225 Difference]: With dead ends: 163189 [2025-02-05 12:02:15,016 INFO L226 Difference]: Without dead ends: 79250 [2025-02-05 12:02:15,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:15,066 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 583 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:15,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 84 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 12:02:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79250 states. [2025-02-05 12:02:16,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79250 to 79243. [2025-02-05 12:02:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79243 states, 79242 states have (on average 1.0621135256555867) internal successors, (84164), 79242 states have internal predecessors, (84164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:16,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79243 states to 79243 states and 84164 transitions. [2025-02-05 12:02:16,449 INFO L78 Accepts]: Start accepts. Automaton has 79243 states and 84164 transitions. Word has length 574 [2025-02-05 12:02:16,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:16,450 INFO L471 AbstractCegarLoop]: Abstraction has 79243 states and 84164 transitions. [2025-02-05 12:02:16,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 79243 states and 84164 transitions. [2025-02-05 12:02:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-02-05 12:02:16,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:16,466 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:16,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:02:16,466 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:16,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:16,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1756339048, now seen corresponding path program 1 times [2025-02-05 12:02:16,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:16,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878067106] [2025-02-05 12:02:16,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:16,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:16,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-02-05 12:02:16,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-02-05 12:02:16,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:16,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 352 proven. 260 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 12:02:17,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:17,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878067106] [2025-02-05 12:02:17,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878067106] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:02:17,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089977854] [2025-02-05 12:02:17,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:17,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:17,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:02:17,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:02:17,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 12:02:17,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-02-05 12:02:17,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-02-05 12:02:17,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:17,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:17,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:02:17,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:02:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 613 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-05 12:02:17,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:02:17,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089977854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:17,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 12:02:17,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-02-05 12:02:17,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006350546] [2025-02-05 12:02:17,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:17,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:02:17,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:17,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:02:17,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:02:17,980 INFO L87 Difference]: Start difference. First operand 79243 states and 84164 transitions. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:20,370 INFO L93 Difference]: Finished difference Result 181898 states and 192964 transitions. [2025-02-05 12:02:20,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:02:20,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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 584 [2025-02-05 12:02:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:20,532 INFO L225 Difference]: With dead ends: 181898 [2025-02-05 12:02:20,532 INFO L226 Difference]: Without dead ends: 102657 [2025-02-05 12:02:20,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:02:20,591 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 604 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:20,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 128 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:02:20,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102657 states. [2025-02-05 12:02:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102657 to 94994. [2025-02-05 12:02:21,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94994 states, 94993 states have (on average 1.0597412440916698) internal successors, (100668), 94993 states have internal predecessors, (100668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94994 states to 94994 states and 100668 transitions. [2025-02-05 12:02:22,002 INFO L78 Accepts]: Start accepts. Automaton has 94994 states and 100668 transitions. Word has length 584 [2025-02-05 12:02:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:22,003 INFO L471 AbstractCegarLoop]: Abstraction has 94994 states and 100668 transitions. [2025-02-05 12:02:22,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 94994 states and 100668 transitions. [2025-02-05 12:02:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-02-05 12:02:22,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:22,020 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:22,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 12:02:22,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:22,220 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:22,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:22,221 INFO L85 PathProgramCache]: Analyzing trace with hash 999905568, now seen corresponding path program 1 times [2025-02-05 12:02:22,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:22,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497441590] [2025-02-05 12:02:22,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:22,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:22,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-02-05 12:02:22,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-02-05 12:02:22,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:22,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-02-05 12:02:23,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:23,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497441590] [2025-02-05 12:02:23,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497441590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:23,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:23,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:23,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912866242] [2025-02-05 12:02:23,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:23,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:23,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:23,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:23,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:23,369 INFO L87 Difference]: Start difference. First operand 94994 states and 100668 transitions. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:25,064 INFO L93 Difference]: Finished difference Result 191689 states and 203103 transitions. [2025-02-05 12:02:25,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:25,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 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 595 [2025-02-05 12:02:25,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:25,168 INFO L225 Difference]: With dead ends: 191689 [2025-02-05 12:02:25,168 INFO L226 Difference]: Without dead ends: 96697 [2025-02-05 12:02:25,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:25,226 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 94 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:25,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 752 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:02:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96697 states. [2025-02-05 12:02:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96697 to 96270. [2025-02-05 12:02:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96270 states, 96269 states have (on average 1.0583780864037229) internal successors, (101889), 96269 states have internal predecessors, (101889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96270 states to 96270 states and 101889 transitions. [2025-02-05 12:02:26,419 INFO L78 Accepts]: Start accepts. Automaton has 96270 states and 101889 transitions. Word has length 595 [2025-02-05 12:02:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:26,419 INFO L471 AbstractCegarLoop]: Abstraction has 96270 states and 101889 transitions. [2025-02-05 12:02:26,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 96270 states and 101889 transitions. [2025-02-05 12:02:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-02-05 12:02:26,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:26,444 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:26,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:02:26,445 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:26,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:26,445 INFO L85 PathProgramCache]: Analyzing trace with hash 466456267, now seen corresponding path program 1 times [2025-02-05 12:02:26,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:26,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020923558] [2025-02-05 12:02:26,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:26,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:26,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-02-05 12:02:26,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-02-05 12:02:26,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:26,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-05 12:02:27,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:27,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020923558] [2025-02-05 12:02:27,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020923558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:27,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:27,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:02:27,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004067342] [2025-02-05 12:02:27,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:27,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:02:27,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:27,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:02:27,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:02:27,258 INFO L87 Difference]: Start difference. First operand 96270 states and 101889 transitions. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:29,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:29,446 INFO L93 Difference]: Finished difference Result 113328 states and 119749 transitions. [2025-02-05 12:02:29,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:02:29,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 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 706 [2025-02-05 12:02:29,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:29,581 INFO L225 Difference]: With dead ends: 113328 [2025-02-05 12:02:29,582 INFO L226 Difference]: Without dead ends: 112901 [2025-02-05 12:02:29,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:02:29,612 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 875 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:29,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 126 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:02:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112901 states. [2025-02-05 12:02:30,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112901 to 97120. [2025-02-05 12:02:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97120 states, 97119 states have (on average 1.0583407984019604) internal successors, (102785), 97119 states have internal predecessors, (102785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:30,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97120 states to 97120 states and 102785 transitions. [2025-02-05 12:02:30,851 INFO L78 Accepts]: Start accepts. Automaton has 97120 states and 102785 transitions. Word has length 706 [2025-02-05 12:02:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:30,852 INFO L471 AbstractCegarLoop]: Abstraction has 97120 states and 102785 transitions. [2025-02-05 12:02:30,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 97120 states and 102785 transitions. [2025-02-05 12:02:30,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2025-02-05 12:02:30,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:30,875 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:30,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 12:02:30,875 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:30,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash -942894058, now seen corresponding path program 1 times [2025-02-05 12:02:30,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:30,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95056911] [2025-02-05 12:02:30,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:30,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:30,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 736 statements into 1 equivalence classes. [2025-02-05 12:02:30,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 736 of 736 statements. [2025-02-05 12:02:30,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:30,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 12:02:31,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:31,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95056911] [2025-02-05 12:02:31,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95056911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:31,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:31,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:02:31,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897267531] [2025-02-05 12:02:31,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:31,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:02:31,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:31,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:02:31,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:02:31,297 INFO L87 Difference]: Start difference. First operand 97120 states and 102785 transitions. Second operand has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:33,741 INFO L93 Difference]: Finished difference Result 212989 states and 224961 transitions. [2025-02-05 12:02:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:02:33,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 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 736 [2025-02-05 12:02:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:33,886 INFO L225 Difference]: With dead ends: 212989 [2025-02-05 12:02:33,886 INFO L226 Difference]: Without dead ends: 115021 [2025-02-05 12:02:33,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:02:33,949 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 738 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:33,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 114 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 2298 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:02:34,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115021 states. [2025-02-05 12:02:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115021 to 103072. [2025-02-05 12:02:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103072 states, 103071 states have (on average 1.0573488178052022) internal successors, (108982), 103071 states have internal predecessors, (108982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103072 states to 103072 states and 108982 transitions. [2025-02-05 12:02:35,655 INFO L78 Accepts]: Start accepts. Automaton has 103072 states and 108982 transitions. Word has length 736 [2025-02-05 12:02:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:35,656 INFO L471 AbstractCegarLoop]: Abstraction has 103072 states and 108982 transitions. [2025-02-05 12:02:35,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 103072 states and 108982 transitions. [2025-02-05 12:02:35,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2025-02-05 12:02:35,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:35,685 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:35,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 12:02:35,685 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:35,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:35,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1512131161, now seen corresponding path program 1 times [2025-02-05 12:02:35,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:35,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424229162] [2025-02-05 12:02:35,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:35,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:35,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 746 statements into 1 equivalence classes. [2025-02-05 12:02:35,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 746 of 746 statements. [2025-02-05 12:02:35,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:35,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-02-05 12:02:36,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:36,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424229162] [2025-02-05 12:02:36,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424229162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:36,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:36,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:02:36,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787031450] [2025-02-05 12:02:36,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:36,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:02:36,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:36,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:02:36,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:02:36,318 INFO L87 Difference]: Start difference. First operand 103072 states and 108982 transitions. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:38,825 INFO L93 Difference]: Finished difference Result 230856 states and 243687 transitions. [2025-02-05 12:02:38,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:02:38,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 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 746 [2025-02-05 12:02:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:38,958 INFO L225 Difference]: With dead ends: 230856 [2025-02-05 12:02:38,958 INFO L226 Difference]: Without dead ends: 127355 [2025-02-05 12:02:38,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:02:38,991 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 959 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 2526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:38,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 606 Invalid, 2526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:02:39,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127355 states. [2025-02-05 12:02:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127355 to 101363. [2025-02-05 12:02:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101363 states, 101362 states have (on average 1.0575264892168663) internal successors, (107193), 101362 states have internal predecessors, (107193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101363 states to 101363 states and 107193 transitions. [2025-02-05 12:02:40,063 INFO L78 Accepts]: Start accepts. Automaton has 101363 states and 107193 transitions. Word has length 746 [2025-02-05 12:02:40,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:40,063 INFO L471 AbstractCegarLoop]: Abstraction has 101363 states and 107193 transitions. [2025-02-05 12:02:40,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:40,063 INFO L276 IsEmpty]: Start isEmpty. Operand 101363 states and 107193 transitions. [2025-02-05 12:02:40,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2025-02-05 12:02:40,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:40,095 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:40,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 12:02:40,096 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:40,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:40,096 INFO L85 PathProgramCache]: Analyzing trace with hash 677165014, now seen corresponding path program 1 times [2025-02-05 12:02:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:40,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204873076] [2025-02-05 12:02:40,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:40,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:40,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 899 statements into 1 equivalence classes. [2025-02-05 12:02:40,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 899 of 899 statements. [2025-02-05 12:02:40,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:40,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 1012 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-02-05 12:02:40,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:40,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204873076] [2025-02-05 12:02:40,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204873076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:40,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:40,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:02:40,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12963120] [2025-02-05 12:02:40,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:40,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:02:40,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:40,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:02:40,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:02:40,630 INFO L87 Difference]: Start difference. First operand 101363 states and 107193 transitions. Second operand has 4 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:43,193 INFO L93 Difference]: Finished difference Result 207416 states and 219259 transitions. [2025-02-05 12:02:43,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:02:43,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 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 899 [2025-02-05 12:02:43,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:43,324 INFO L225 Difference]: With dead ends: 207416 [2025-02-05 12:02:43,324 INFO L226 Difference]: Without dead ends: 106055 [2025-02-05 12:02:43,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:02:43,360 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 796 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 2225 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 2488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 2225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:43,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 211 Invalid, 2488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 2225 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:02:43,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106055 states. [2025-02-05 12:02:44,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106055 to 97101. [2025-02-05 12:02:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97101 states, 97100 states have (on average 1.055880535530381) internal successors, (102526), 97100 states have internal predecessors, (102526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97101 states to 97101 states and 102526 transitions. [2025-02-05 12:02:44,744 INFO L78 Accepts]: Start accepts. Automaton has 97101 states and 102526 transitions. Word has length 899 [2025-02-05 12:02:44,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:44,744 INFO L471 AbstractCegarLoop]: Abstraction has 97101 states and 102526 transitions. [2025-02-05 12:02:44,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 97101 states and 102526 transitions. [2025-02-05 12:02:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 930 [2025-02-05 12:02:44,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:44,777 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:44,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 12:02:44,777 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:44,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:44,778 INFO L85 PathProgramCache]: Analyzing trace with hash -187481129, now seen corresponding path program 1 times [2025-02-05 12:02:44,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:44,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254113807] [2025-02-05 12:02:44,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:44,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:44,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 929 statements into 1 equivalence classes. [2025-02-05 12:02:44,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 929 of 929 statements. [2025-02-05 12:02:44,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:44,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1399 backedges. 1058 proven. 0 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2025-02-05 12:02:45,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:45,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254113807] [2025-02-05 12:02:45,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254113807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:45,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:45,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:45,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814383505] [2025-02-05 12:02:45,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:45,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:45,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:45,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:45,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:45,038 INFO L87 Difference]: Start difference. First operand 97101 states and 102526 transitions. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:46,635 INFO L93 Difference]: Finished difference Result 195476 states and 206502 transitions. [2025-02-05 12:02:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:46,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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 929 [2025-02-05 12:02:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:46,745 INFO L225 Difference]: With dead ends: 195476 [2025-02-05 12:02:46,745 INFO L226 Difference]: Without dead ends: 98377 [2025-02-05 12:02:46,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:46,798 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 305 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:46,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 251 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:02:46,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98377 states. [2025-02-05 12:02:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98377 to 89439. [2025-02-05 12:02:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89439 states, 89438 states have (on average 1.0538138151568683) internal successors, (94251), 89438 states have internal predecessors, (94251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89439 states to 89439 states and 94251 transitions. [2025-02-05 12:02:47,738 INFO L78 Accepts]: Start accepts. Automaton has 89439 states and 94251 transitions. Word has length 929 [2025-02-05 12:02:47,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:47,738 INFO L471 AbstractCegarLoop]: Abstraction has 89439 states and 94251 transitions. [2025-02-05 12:02:47,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand 89439 states and 94251 transitions. [2025-02-05 12:02:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2025-02-05 12:02:47,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:47,769 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:47,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 12:02:47,770 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:47,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:47,770 INFO L85 PathProgramCache]: Analyzing trace with hash -704629297, now seen corresponding path program 1 times [2025-02-05 12:02:47,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:47,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167566463] [2025-02-05 12:02:47,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:47,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:47,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 931 statements into 1 equivalence classes. [2025-02-05 12:02:47,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 931 of 931 statements. [2025-02-05 12:02:47,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:47,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2025-02-05 12:02:48,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:48,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167566463] [2025-02-05 12:02:48,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167566463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:48,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:48,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:48,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349429828] [2025-02-05 12:02:48,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:48,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:48,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:48,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:48,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:48,315 INFO L87 Difference]: Start difference. First operand 89439 states and 94251 transitions. Second operand has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:49,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:49,944 INFO L93 Difference]: Finished difference Result 182692 states and 192586 transitions. [2025-02-05 12:02:49,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:49,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 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 931 [2025-02-05 12:02:49,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:50,045 INFO L225 Difference]: With dead ends: 182692 [2025-02-05 12:02:50,045 INFO L226 Difference]: Without dead ends: 91978 [2025-02-05 12:02:50,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:50,102 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 146 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:50,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 579 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 12:02:50,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91978 states. [2025-02-05 12:02:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91978 to 86452. [2025-02-05 12:02:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86452 states, 86451 states have (on average 1.052538432175452) internal successors, (90993), 86451 states have internal predecessors, (90993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86452 states to 86452 states and 90993 transitions. [2025-02-05 12:02:51,044 INFO L78 Accepts]: Start accepts. Automaton has 86452 states and 90993 transitions. Word has length 931 [2025-02-05 12:02:51,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:51,044 INFO L471 AbstractCegarLoop]: Abstraction has 86452 states and 90993 transitions. [2025-02-05 12:02:51,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:51,045 INFO L276 IsEmpty]: Start isEmpty. Operand 86452 states and 90993 transitions. [2025-02-05 12:02:51,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1135 [2025-02-05 12:02:51,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:51,094 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:51,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 12:02:51,094 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:51,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:51,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1925585069, now seen corresponding path program 1 times [2025-02-05 12:02:51,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:51,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117184516] [2025-02-05 12:02:51,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:51,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:51,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1134 statements into 1 equivalence classes. [2025-02-05 12:02:51,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1134 of 1134 statements. [2025-02-05 12:02:51,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:51,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 1340 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-02-05 12:02:51,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117184516] [2025-02-05 12:02:51,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117184516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:51,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:51,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:51,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98955046] [2025-02-05 12:02:51,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:51,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:51,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:51,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:51,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:51,566 INFO L87 Difference]: Start difference. First operand 86452 states and 90993 transitions. Second operand has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)