./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label40.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/Problem03_label40.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 50a84ef689ee1e06fdacd72e7701ff2c38527734cebc573231d698f970fe37fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:47:31,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:47:31,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:47:31,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:47:31,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:47:31,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:47:31,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:47:31,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:47:31,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:47:31,528 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:47:31,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:47:31,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:47:31,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:47:31,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:47:31,528 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:47:31,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:47:31,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:47:31,529 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:47:31,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:47:31,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:47:31,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:47:31,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:47:31,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:47:31,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:47:31,529 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:47:31,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:47:31,529 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:47:31,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:47:31,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:47:31,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:47:31,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:47:31,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:47:31,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:47:31,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:47:31,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:47:31,530 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:47:31,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:47:31,530 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:47:31,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:47:31,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:47:31,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:47:31,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:47:31,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:47:31,531 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 -> 50a84ef689ee1e06fdacd72e7701ff2c38527734cebc573231d698f970fe37fd [2025-02-05 10:47:31,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:47:31,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:47:31,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:47:31,765 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:47:31,766 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:47:31,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label40.c [2025-02-05 10:47:32,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27e461997/711954279cf745ab815b0c7f1c9a6a81/FLAGa6bd91d6b [2025-02-05 10:47:33,236 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:47:33,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label40.c [2025-02-05 10:47:33,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27e461997/711954279cf745ab815b0c7f1c9a6a81/FLAGa6bd91d6b [2025-02-05 10:47:33,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27e461997/711954279cf745ab815b0c7f1c9a6a81 [2025-02-05 10:47:33,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:47:33,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:47:33,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:47:33,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:47:33,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:47:33,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:47:33" (1/1) ... [2025-02-05 10:47:33,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58e1acee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:33, skipping insertion in model container [2025-02-05 10:47:33,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:47:33" (1/1) ... [2025-02-05 10:47:33,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:47:33,688 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/Problem03_label40.c[59070,59083] [2025-02-05 10:47:33,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:47:33,722 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:47:33,852 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/Problem03_label40.c[59070,59083] [2025-02-05 10:47:33,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:47:33,877 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:47:33,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:33 WrapperNode [2025-02-05 10:47:33,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:47:33,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:47:33,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:47:33,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:47:33,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:33" (1/1) ... [2025-02-05 10:47:33,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:33" (1/1) ... [2025-02-05 10:47:33,983 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-02-05 10:47:33,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:47:33,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:47:33,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:47:33,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:47:33,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:33" (1/1) ... [2025-02-05 10:47:33,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:33" (1/1) ... [2025-02-05 10:47:33,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:33" (1/1) ... [2025-02-05 10:47:34,016 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 10:47:34,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:33" (1/1) ... [2025-02-05 10:47:34,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:33" (1/1) ... [2025-02-05 10:47:34,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:33" (1/1) ... [2025-02-05 10:47:34,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:33" (1/1) ... [2025-02-05 10:47:34,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:33" (1/1) ... [2025-02-05 10:47:34,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:33" (1/1) ... [2025-02-05 10:47:34,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:47:34,085 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:47:34,085 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:47:34,085 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:47:34,086 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:33" (1/1) ... [2025-02-05 10:47:34,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:47:34,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:34,112 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 10:47:34,118 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 10:47:34,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:47:34,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:47:34,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:47:34,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:47:34,205 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:47:34,206 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:47:35,576 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-02-05 10:47:35,576 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:47:35,593 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:47:35,594 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:47:35,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:47:35 BoogieIcfgContainer [2025-02-05 10:47:35,594 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:47:35,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:47:35,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:47:35,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:47:35,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:47:33" (1/3) ... [2025-02-05 10:47:35,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b81b1be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:47:35, skipping insertion in model container [2025-02-05 10:47:35,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:33" (2/3) ... [2025-02-05 10:47:35,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b81b1be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:47:35, skipping insertion in model container [2025-02-05 10:47:35,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:47:35" (3/3) ... [2025-02-05 10:47:35,602 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label40.c [2025-02-05 10:47:35,613 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:47:35,615 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label40.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:47:35,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:47:35,676 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;@1578edfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:47:35,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:47:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-05 10:47:35,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:35,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:35,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:35,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:35,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2089159146, now seen corresponding path program 1 times [2025-02-05 10:47:35,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:35,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941714152] [2025-02-05 10:47:35,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:35,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:35,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-05 10:47:35,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-05 10:47:35,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:35,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:36,401 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 10:47:36,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:36,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941714152] [2025-02-05 10:47:36,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941714152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:36,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:36,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:36,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899218641] [2025-02-05 10:47:36,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:36,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:36,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:36,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:36,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:36,426 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 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 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:37,279 INFO L93 Difference]: Finished difference Result 855 states and 1493 transitions. [2025-02-05 10:47:37,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:37,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2025-02-05 10:47:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:37,293 INFO L225 Difference]: With dead ends: 855 [2025-02-05 10:47:37,293 INFO L226 Difference]: Without dead ends: 460 [2025-02-05 10:47:37,296 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 10:47:37,298 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 112 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:37,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 175 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:47:37,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-02-05 10:47:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 459. [2025-02-05 10:47:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.5502183406113537) internal successors, (710), 458 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:37,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 710 transitions. [2025-02-05 10:47:37,344 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 710 transitions. Word has length 184 [2025-02-05 10:47:37,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:37,345 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 710 transitions. [2025-02-05 10:47:37,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:37,345 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 710 transitions. [2025-02-05 10:47:37,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 10:47:37,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:37,348 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:47:37,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:47:37,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:37,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:37,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1015742464, now seen corresponding path program 1 times [2025-02-05 10:47:37,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:37,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10161540] [2025-02-05 10:47:37,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:37,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:37,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 10:47:37,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 10:47:37,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:37,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:37,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:37,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10161540] [2025-02-05 10:47:37,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10161540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:37,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:37,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:37,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728223480] [2025-02-05 10:47:37,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:37,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:37,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:37,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:37,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:37,659 INFO L87 Difference]: Start difference. First operand 459 states and 710 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:37,867 INFO L93 Difference]: Finished difference Result 1372 states and 2125 transitions. [2025-02-05 10:47:37,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:37,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2025-02-05 10:47:37,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:37,871 INFO L225 Difference]: With dead ends: 1372 [2025-02-05 10:47:37,871 INFO L226 Difference]: Without dead ends: 915 [2025-02-05 10:47:37,873 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 10:47:37,874 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:37,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 596 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:47:37,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-02-05 10:47:37,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2025-02-05 10:47:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 1.5460526315789473) internal successors, (1410), 912 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:37,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1410 transitions. [2025-02-05 10:47:37,924 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1410 transitions. Word has length 189 [2025-02-05 10:47:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:37,925 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1410 transitions. [2025-02-05 10:47:37,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1410 transitions. [2025-02-05 10:47:37,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 10:47:37,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:37,927 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:47:37,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:47:37,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:37,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:37,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1929310356, now seen corresponding path program 1 times [2025-02-05 10:47:37,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:37,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550410517] [2025-02-05 10:47:37,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:37,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:37,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 10:47:37,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 10:47:37,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:37,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:38,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:38,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550410517] [2025-02-05 10:47:38,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550410517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:38,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:38,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:38,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153312526] [2025-02-05 10:47:38,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:38,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:38,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:38,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:38,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:38,100 INFO L87 Difference]: Start difference. First operand 913 states and 1410 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:38,764 INFO L93 Difference]: Finished difference Result 2685 states and 4171 transitions. [2025-02-05 10:47:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:38,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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 192 [2025-02-05 10:47:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:38,770 INFO L225 Difference]: With dead ends: 2685 [2025-02-05 10:47:38,770 INFO L226 Difference]: Without dead ends: 1774 [2025-02-05 10:47:38,772 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 10:47:38,772 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 237 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:38,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 153 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:47:38,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2025-02-05 10:47:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1738. [2025-02-05 10:47:38,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1737 states have (on average 1.5146804835924006) internal successors, (2631), 1737 states have internal predecessors, (2631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2631 transitions. [2025-02-05 10:47:38,821 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2631 transitions. Word has length 192 [2025-02-05 10:47:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:38,821 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2631 transitions. [2025-02-05 10:47:38,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2631 transitions. [2025-02-05 10:47:38,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 10:47:38,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:38,825 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:47:38,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:47:38,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:38,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:38,826 INFO L85 PathProgramCache]: Analyzing trace with hash 260493149, now seen corresponding path program 1 times [2025-02-05 10:47:38,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:38,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619077568] [2025-02-05 10:47:38,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:38,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:38,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 10:47:38,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 10:47:38,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:38,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:38,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:38,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619077568] [2025-02-05 10:47:38,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619077568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:38,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:38,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:38,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564031523] [2025-02-05 10:47:38,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:38,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:38,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:38,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:38,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:38,964 INFO L87 Difference]: Start difference. First operand 1738 states and 2631 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:39,241 INFO L93 Difference]: Finished difference Result 5178 states and 7849 transitions. [2025-02-05 10:47:39,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:39,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-02-05 10:47:39,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:39,252 INFO L225 Difference]: With dead ends: 5178 [2025-02-05 10:47:39,252 INFO L226 Difference]: Without dead ends: 3442 [2025-02-05 10:47:39,254 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 10:47:39,255 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 349 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:39,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 513 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:47:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2025-02-05 10:47:39,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3438. [2025-02-05 10:47:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 3437 states have (on average 1.5085830666278732) internal successors, (5185), 3437 states have internal predecessors, (5185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 5185 transitions. [2025-02-05 10:47:39,316 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 5185 transitions. Word has length 198 [2025-02-05 10:47:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:39,316 INFO L471 AbstractCegarLoop]: Abstraction has 3438 states and 5185 transitions. [2025-02-05 10:47:39,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 5185 transitions. [2025-02-05 10:47:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 10:47:39,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:39,321 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-05 10:47:39,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:47:39,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:39,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:39,321 INFO L85 PathProgramCache]: Analyzing trace with hash -724284111, now seen corresponding path program 1 times [2025-02-05 10:47:39,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:39,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738473298] [2025-02-05 10:47:39,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:39,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:39,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 10:47:39,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 10:47:39,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:39,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:47:39,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:39,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738473298] [2025-02-05 10:47:39,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738473298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:39,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:39,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:47:39,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245726804] [2025-02-05 10:47:39,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:39,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:47:39,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:39,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:47:39,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:47:39,860 INFO L87 Difference]: Start difference. First operand 3438 states and 5185 transitions. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:40,589 INFO L93 Difference]: Finished difference Result 7480 states and 11419 transitions. [2025-02-05 10:47:40,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:47:40,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2025-02-05 10:47:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:40,600 INFO L225 Difference]: With dead ends: 7480 [2025-02-05 10:47:40,601 INFO L226 Difference]: Without dead ends: 3348 [2025-02-05 10:47:40,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:47:40,606 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 331 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:40,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 47 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:47:40,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3348 states. [2025-02-05 10:47:40,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3348 to 3347. [2025-02-05 10:47:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3347 states, 3346 states have (on average 1.3682008368200838) internal successors, (4578), 3346 states have internal predecessors, (4578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3347 states to 3347 states and 4578 transitions. [2025-02-05 10:47:40,675 INFO L78 Accepts]: Start accepts. Automaton has 3347 states and 4578 transitions. Word has length 199 [2025-02-05 10:47:40,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:40,675 INFO L471 AbstractCegarLoop]: Abstraction has 3347 states and 4578 transitions. [2025-02-05 10:47:40,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3347 states and 4578 transitions. [2025-02-05 10:47:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 10:47:40,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:40,680 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:47:40,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:47:40,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:40,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:40,681 INFO L85 PathProgramCache]: Analyzing trace with hash -151661497, now seen corresponding path program 1 times [2025-02-05 10:47:40,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:40,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421445324] [2025-02-05 10:47:40,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:40,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:40,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 10:47:40,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 10:47:40,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:40,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:40,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:40,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421445324] [2025-02-05 10:47:40,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421445324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:40,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:40,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:40,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258242705] [2025-02-05 10:47:40,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:40,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:40,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:40,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:40,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:40,830 INFO L87 Difference]: Start difference. First operand 3347 states and 4578 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:41,372 INFO L93 Difference]: Finished difference Result 9975 states and 13648 transitions. [2025-02-05 10:47:41,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:41,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2025-02-05 10:47:41,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:41,392 INFO L225 Difference]: With dead ends: 9975 [2025-02-05 10:47:41,392 INFO L226 Difference]: Without dead ends: 6630 [2025-02-05 10:47:41,397 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 10:47:41,399 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 227 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:41,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 104 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:47:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6630 states. [2025-02-05 10:47:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6630 to 6616. [2025-02-05 10:47:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6616 states, 6615 states have (on average 1.3180650037792896) internal successors, (8719), 6615 states have internal predecessors, (8719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6616 states to 6616 states and 8719 transitions. [2025-02-05 10:47:41,513 INFO L78 Accepts]: Start accepts. Automaton has 6616 states and 8719 transitions. Word has length 199 [2025-02-05 10:47:41,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:41,513 INFO L471 AbstractCegarLoop]: Abstraction has 6616 states and 8719 transitions. [2025-02-05 10:47:41,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 6616 states and 8719 transitions. [2025-02-05 10:47:41,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 10:47:41,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:41,522 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:41,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:47:41,522 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:41,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:41,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1599186973, now seen corresponding path program 1 times [2025-02-05 10:47:41,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:41,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671017830] [2025-02-05 10:47:41,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:41,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:41,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 10:47:41,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 10:47:41,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:41,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:41,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:41,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671017830] [2025-02-05 10:47:41,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671017830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:41,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:41,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:47:41,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391603739] [2025-02-05 10:47:41,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:41,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:47:41,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:41,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:47:41,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:47:41,958 INFO L87 Difference]: Start difference. First operand 6616 states and 8719 transitions. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:42,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:42,867 INFO L93 Difference]: Finished difference Result 17220 states and 22747 transitions. [2025-02-05 10:47:42,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:47:42,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2025-02-05 10:47:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:42,897 INFO L225 Difference]: With dead ends: 17220 [2025-02-05 10:47:42,898 INFO L226 Difference]: Without dead ends: 9910 [2025-02-05 10:47:42,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:47:42,908 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 194 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:42,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 98 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:47:42,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9910 states. [2025-02-05 10:47:43,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9910 to 9906. [2025-02-05 10:47:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9906 states, 9905 states have (on average 1.3010600706713782) internal successors, (12887), 9905 states have internal predecessors, (12887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9906 states to 9906 states and 12887 transitions. [2025-02-05 10:47:43,091 INFO L78 Accepts]: Start accepts. Automaton has 9906 states and 12887 transitions. Word has length 215 [2025-02-05 10:47:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:43,091 INFO L471 AbstractCegarLoop]: Abstraction has 9906 states and 12887 transitions. [2025-02-05 10:47:43,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 9906 states and 12887 transitions. [2025-02-05 10:47:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-02-05 10:47:43,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:43,103 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:43,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:47:43,103 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:43,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1180482744, now seen corresponding path program 1 times [2025-02-05 10:47:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:43,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442739182] [2025-02-05 10:47:43,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:43,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:43,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-05 10:47:43,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-05 10:47:43,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:43,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:43,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:43,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442739182] [2025-02-05 10:47:43,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442739182] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:43,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858050121] [2025-02-05 10:47:43,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:43,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:43,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:43,812 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 10:47:43,814 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 10:47:43,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-05 10:47:43,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-05 10:47:43,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:43,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:43,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:47:43,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 10:47:44,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:44,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858050121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:44,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:44,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:47:44,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215633248] [2025-02-05 10:47:44,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:44,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:44,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:44,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:44,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:44,178 INFO L87 Difference]: Start difference. First operand 9906 states and 12887 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:44,781 INFO L93 Difference]: Finished difference Result 19843 states and 25833 transitions. [2025-02-05 10:47:44,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:44,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 222 [2025-02-05 10:47:44,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:44,811 INFO L225 Difference]: With dead ends: 19843 [2025-02-05 10:47:44,811 INFO L226 Difference]: Without dead ends: 9939 [2025-02-05 10:47:44,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:44,823 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 40 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:44,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 317 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:47:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9939 states. [2025-02-05 10:47:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9939 to 9906. [2025-02-05 10:47:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9906 states, 9905 states have (on average 1.2832912670368501) internal successors, (12711), 9905 states have internal predecessors, (12711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9906 states to 9906 states and 12711 transitions. [2025-02-05 10:47:44,984 INFO L78 Accepts]: Start accepts. Automaton has 9906 states and 12711 transitions. Word has length 222 [2025-02-05 10:47:44,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:44,985 INFO L471 AbstractCegarLoop]: Abstraction has 9906 states and 12711 transitions. [2025-02-05 10:47:44,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 9906 states and 12711 transitions. [2025-02-05 10:47:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 10:47:44,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:44,999 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:45,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:47:45,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:45,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:45,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:45,200 INFO L85 PathProgramCache]: Analyzing trace with hash 164932550, now seen corresponding path program 1 times [2025-02-05 10:47:45,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:45,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595690054] [2025-02-05 10:47:45,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:45,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:45,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 10:47:45,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 10:47:45,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:45,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:47:45,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:45,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595690054] [2025-02-05 10:47:45,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595690054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:45,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:45,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:45,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197862679] [2025-02-05 10:47:45,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:45,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:45,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:45,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:45,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:45,388 INFO L87 Difference]: Start difference. First operand 9906 states and 12711 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:46,023 INFO L93 Difference]: Finished difference Result 26416 states and 33913 transitions. [2025-02-05 10:47:46,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:46,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 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 227 [2025-02-05 10:47:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:46,049 INFO L225 Difference]: With dead ends: 26416 [2025-02-05 10:47:46,049 INFO L226 Difference]: Without dead ends: 16512 [2025-02-05 10:47:46,055 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 10:47:46,057 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 202 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:46,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 117 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:47:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16512 states. [2025-02-05 10:47:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16512 to 16506. [2025-02-05 10:47:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16506 states, 16505 states have (on average 1.280763405028779) internal successors, (21139), 16505 states have internal predecessors, (21139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16506 states to 16506 states and 21139 transitions. [2025-02-05 10:47:46,228 INFO L78 Accepts]: Start accepts. Automaton has 16506 states and 21139 transitions. Word has length 227 [2025-02-05 10:47:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:46,229 INFO L471 AbstractCegarLoop]: Abstraction has 16506 states and 21139 transitions. [2025-02-05 10:47:46,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 16506 states and 21139 transitions. [2025-02-05 10:47:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 10:47:46,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:46,245 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:46,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:47:46,246 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:46,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:46,246 INFO L85 PathProgramCache]: Analyzing trace with hash -813249389, now seen corresponding path program 1 times [2025-02-05 10:47:46,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:46,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98780957] [2025-02-05 10:47:46,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:46,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:46,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 10:47:46,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 10:47:46,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:46,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:47:46,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:46,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98780957] [2025-02-05 10:47:46,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98780957] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:46,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430124529] [2025-02-05 10:47:46,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:46,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:46,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:46,858 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 10:47:46,859 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 10:47:46,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 10:47:46,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 10:47:46,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:46,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:46,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:47:46,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:47,171 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:47:47,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:47,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430124529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:47,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:47,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:47:47,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925209084] [2025-02-05 10:47:47,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:47,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:47,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:47,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:47,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:47,174 INFO L87 Difference]: Start difference. First operand 16506 states and 21139 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:47,761 INFO L93 Difference]: Finished difference Result 49274 states and 63090 transitions. [2025-02-05 10:47:47,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:47,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 228 [2025-02-05 10:47:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:47,813 INFO L225 Difference]: With dead ends: 49274 [2025-02-05 10:47:47,813 INFO L226 Difference]: Without dead ends: 32770 [2025-02-05 10:47:47,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:47,833 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 35 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:47,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 343 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:47:47,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32770 states. [2025-02-05 10:47:48,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32770 to 32746. [2025-02-05 10:47:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32746 states, 32745 states have (on average 1.1736448312719499) internal successors, (38431), 32745 states have internal predecessors, (38431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32746 states to 32746 states and 38431 transitions. [2025-02-05 10:47:48,271 INFO L78 Accepts]: Start accepts. Automaton has 32746 states and 38431 transitions. Word has length 228 [2025-02-05 10:47:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:48,271 INFO L471 AbstractCegarLoop]: Abstraction has 32746 states and 38431 transitions. [2025-02-05 10:47:48,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 32746 states and 38431 transitions. [2025-02-05 10:47:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 10:47:48,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:48,287 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:48,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 10:47:48,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:48,491 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:48,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:48,492 INFO L85 PathProgramCache]: Analyzing trace with hash -830284115, now seen corresponding path program 1 times [2025-02-05 10:47:48,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:48,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138562209] [2025-02-05 10:47:48,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:48,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:48,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 10:47:48,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 10:47:48,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:48,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:48,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:48,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138562209] [2025-02-05 10:47:48,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138562209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:48,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:48,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:48,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030819347] [2025-02-05 10:47:48,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:48,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:48,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:48,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:48,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:48,682 INFO L87 Difference]: Start difference. First operand 32746 states and 38431 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:49,316 INFO L93 Difference]: Finished difference Result 80106 states and 95598 transitions. [2025-02-05 10:47:49,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:49,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-02-05 10:47:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:49,392 INFO L225 Difference]: With dead ends: 80106 [2025-02-05 10:47:49,392 INFO L226 Difference]: Without dead ends: 47362 [2025-02-05 10:47:49,419 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 10:47:49,420 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 173 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:49,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 126 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:47:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47362 states. [2025-02-05 10:47:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47362 to 47362. [2025-02-05 10:47:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47362 states, 47361 states have (on average 1.1426912438504255) internal successors, (54119), 47361 states have internal predecessors, (54119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47362 states to 47362 states and 54119 transitions. [2025-02-05 10:47:49,953 INFO L78 Accepts]: Start accepts. Automaton has 47362 states and 54119 transitions. Word has length 228 [2025-02-05 10:47:49,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:49,953 INFO L471 AbstractCegarLoop]: Abstraction has 47362 states and 54119 transitions. [2025-02-05 10:47:49,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 47362 states and 54119 transitions. [2025-02-05 10:47:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-02-05 10:47:49,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:49,972 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 10:47:49,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 10:47:49,972 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:49,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:49,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1635663039, now seen corresponding path program 1 times [2025-02-05 10:47:49,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:49,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082449128] [2025-02-05 10:47:49,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:49,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:50,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-05 10:47:50,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-05 10:47:50,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:50,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:50,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:50,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082449128] [2025-02-05 10:47:50,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082449128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:50,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:50,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:50,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744581397] [2025-02-05 10:47:50,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:50,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:50,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:50,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:50,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:50,142 INFO L87 Difference]: Start difference. First operand 47362 states and 54119 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:50,931 INFO L93 Difference]: Finished difference Result 129415 states and 148034 transitions. [2025-02-05 10:47:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:50,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2025-02-05 10:47:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:51,040 INFO L225 Difference]: With dead ends: 129415 [2025-02-05 10:47:51,040 INFO L226 Difference]: Without dead ends: 82055 [2025-02-05 10:47:51,067 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 10:47:51,068 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 155 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:51,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 128 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:47:51,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82055 states. [2025-02-05 10:47:51,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82055 to 82049. [2025-02-05 10:47:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82049 states, 82048 states have (on average 1.1426238299531981) internal successors, (93750), 82048 states have internal predecessors, (93750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82049 states to 82049 states and 93750 transitions. [2025-02-05 10:47:51,826 INFO L78 Accepts]: Start accepts. Automaton has 82049 states and 93750 transitions. Word has length 259 [2025-02-05 10:47:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:51,826 INFO L471 AbstractCegarLoop]: Abstraction has 82049 states and 93750 transitions. [2025-02-05 10:47:51,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 82049 states and 93750 transitions. [2025-02-05 10:47:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-02-05 10:47:51,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:51,844 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:51,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 10:47:51,845 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:51,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:51,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1886086308, now seen corresponding path program 1 times [2025-02-05 10:47:51,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:51,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26010837] [2025-02-05 10:47:51,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:51,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:51,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-05 10:47:51,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-05 10:47:51,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:51,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 81 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:52,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:52,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26010837] [2025-02-05 10:47:52,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26010837] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:52,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470857196] [2025-02-05 10:47:52,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:52,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:52,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:52,993 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 10:47:52,995 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 10:47:53,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-05 10:47:53,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-05 10:47:53,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:53,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:53,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:47:53,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-02-05 10:47:53,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:53,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470857196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:53,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:53,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-05 10:47:53,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785884008] [2025-02-05 10:47:53,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:53,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:53,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:53,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:53,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:53,322 INFO L87 Difference]: Start difference. First operand 82049 states and 93750 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:54,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:54,201 INFO L93 Difference]: Finished difference Result 225947 states and 258550 transitions. [2025-02-05 10:47:54,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:54,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 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 266 [2025-02-05 10:47:54,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:54,384 INFO L225 Difference]: With dead ends: 225947 [2025-02-05 10:47:54,384 INFO L226 Difference]: Without dead ends: 143900 [2025-02-05 10:47:54,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:54,463 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 71 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:54,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 83 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:47:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143900 states. [2025-02-05 10:47:55,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143900 to 143847. [2025-02-05 10:47:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143847 states, 143846 states have (on average 1.130333829234042) internal successors, (162594), 143846 states have internal predecessors, (162594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143847 states to 143847 states and 162594 transitions. [2025-02-05 10:47:56,027 INFO L78 Accepts]: Start accepts. Automaton has 143847 states and 162594 transitions. Word has length 266 [2025-02-05 10:47:56,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:56,028 INFO L471 AbstractCegarLoop]: Abstraction has 143847 states and 162594 transitions. [2025-02-05 10:47:56,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 143847 states and 162594 transitions. [2025-02-05 10:47:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-02-05 10:47:56,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:56,058 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 10:47:56,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 10:47:56,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:56,258 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:56,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:56,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1169788894, now seen corresponding path program 1 times [2025-02-05 10:47:56,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:56,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740326369] [2025-02-05 10:47:56,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:56,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:56,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-02-05 10:47:56,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-02-05 10:47:56,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:56,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:57,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:57,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740326369] [2025-02-05 10:47:57,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740326369] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:57,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644031126] [2025-02-05 10:47:57,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:57,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:57,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:57,578 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:47:57,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 10:47:57,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-02-05 10:47:57,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-02-05 10:47:57,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:57,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:57,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:47:57,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:57,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:57,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644031126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:57,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:57,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 10:47:57,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849315553] [2025-02-05 10:47:57,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:57,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:57,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:57,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:57,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:57,848 INFO L87 Difference]: Start difference. First operand 143847 states and 162594 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:58,943 INFO L93 Difference]: Finished difference Result 287740 states and 325266 transitions. [2025-02-05 10:47:58,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:58,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 280 [2025-02-05 10:47:58,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:59,115 INFO L225 Difference]: With dead ends: 287740 [2025-02-05 10:47:59,115 INFO L226 Difference]: Without dead ends: 143895 [2025-02-05 10:47:59,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:59,197 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 80 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:59,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 277 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:47:59,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143895 states. [2025-02-05 10:48:00,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143895 to 143847. [2025-02-05 10:48:01,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143847 states, 143846 states have (on average 1.1206151022621416) internal successors, (161196), 143846 states have internal predecessors, (161196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143847 states to 143847 states and 161196 transitions. [2025-02-05 10:48:01,894 INFO L78 Accepts]: Start accepts. Automaton has 143847 states and 161196 transitions. Word has length 280 [2025-02-05 10:48:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:01,894 INFO L471 AbstractCegarLoop]: Abstraction has 143847 states and 161196 transitions. [2025-02-05 10:48:01,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 143847 states and 161196 transitions. [2025-02-05 10:48:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-02-05 10:48:01,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:01,924 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-02-05 10:48:01,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 10:48:02,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 10:48:02,125 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:02,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:02,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1647325907, now seen corresponding path program 1 times [2025-02-05 10:48:02,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:02,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867411396] [2025-02-05 10:48:02,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:02,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:02,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-05 10:48:02,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-05 10:48:02,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:02,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-02-05 10:48:02,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867411396] [2025-02-05 10:48:02,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867411396] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:48:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597425438] [2025-02-05 10:48:02,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:02,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:02,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:02,359 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:48:02,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 10:48:02,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-05 10:48:02,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-05 10:48:02,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:02,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:02,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:48:02,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:48:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-02-05 10:48:02,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:48:02,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597425438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:02,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:48:02,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:48:02,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498841444] [2025-02-05 10:48:02,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:02,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:48:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:02,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:48:02,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:02,564 INFO L87 Difference]: Start difference. First operand 143847 states and 161196 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:04,221 INFO L93 Difference]: Finished difference Result 442027 states and 495664 transitions. [2025-02-05 10:48:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:48:04,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 294 [2025-02-05 10:48:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:04,905 INFO L225 Difference]: With dead ends: 442027 [2025-02-05 10:48:04,905 INFO L226 Difference]: Without dead ends: 298182 [2025-02-05 10:48:04,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:04,971 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 477 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:04,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 308 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:48:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298182 states. [2025-02-05 10:48:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298182 to 282099. [2025-02-05 10:48:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282099 states, 282098 states have (on average 1.1167821111812206) internal successors, (315042), 282098 states have internal predecessors, (315042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282099 states to 282099 states and 315042 transitions. [2025-02-05 10:48:08,581 INFO L78 Accepts]: Start accepts. Automaton has 282099 states and 315042 transitions. Word has length 294 [2025-02-05 10:48:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:08,581 INFO L471 AbstractCegarLoop]: Abstraction has 282099 states and 315042 transitions. [2025-02-05 10:48:08,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 282099 states and 315042 transitions. [2025-02-05 10:48:08,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-05 10:48:08,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:08,647 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-02-05 10:48:08,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:48:08,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 10:48:08,847 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:08,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:08,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1759570767, now seen corresponding path program 1 times [2025-02-05 10:48:08,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:08,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608526314] [2025-02-05 10:48:08,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:08,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:08,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-05 10:48:08,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-05 10:48:08,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:08,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-02-05 10:48:09,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:09,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608526314] [2025-02-05 10:48:09,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608526314] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:48:09,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021314199] [2025-02-05 10:48:09,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:09,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:09,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:09,926 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:48:09,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:48:09,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-05 10:48:10,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-05 10:48:10,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:10,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:10,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:48:10,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:48:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 10:48:10,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:48:10,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021314199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:10,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:48:10,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:48:10,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385393929] [2025-02-05 10:48:10,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:10,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:10,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:10,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:10,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:10,077 INFO L87 Difference]: Start difference. First operand 282099 states and 315042 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:11,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:11,664 INFO L93 Difference]: Finished difference Result 515487 states and 574466 transitions. [2025-02-05 10:48:11,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:11,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 297 [2025-02-05 10:48:11,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:11,972 INFO L225 Difference]: With dead ends: 515487 [2025-02-05 10:48:11,972 INFO L226 Difference]: Without dead ends: 233390 [2025-02-05 10:48:12,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:12,075 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 208 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:12,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 311 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:48:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233390 states. [2025-02-05 10:48:14,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233390 to 233326. [2025-02-05 10:48:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233326 states, 233325 states have (on average 1.0985706632379728) internal successors, (256324), 233325 states have internal predecessors, (256324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233326 states to 233326 states and 256324 transitions. [2025-02-05 10:48:15,566 INFO L78 Accepts]: Start accepts. Automaton has 233326 states and 256324 transitions. Word has length 297 [2025-02-05 10:48:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:15,567 INFO L471 AbstractCegarLoop]: Abstraction has 233326 states and 256324 transitions. [2025-02-05 10:48:15,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 233326 states and 256324 transitions. [2025-02-05 10:48:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-02-05 10:48:15,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:15,633 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:15,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 10:48:15,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 10:48:15,834 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:15,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:15,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2069255675, now seen corresponding path program 1 times [2025-02-05 10:48:15,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:15,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022288349] [2025-02-05 10:48:15,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:15,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:15,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-02-05 10:48:15,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-02-05 10:48:15,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:15,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:48:15,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:15,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022288349] [2025-02-05 10:48:15,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022288349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:15,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:48:15,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:48:15,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76248962] [2025-02-05 10:48:15,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:15,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:15,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:15,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:15,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:48:15,994 INFO L87 Difference]: Start difference. First operand 233326 states and 256324 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:17,481 INFO L93 Difference]: Finished difference Result 414080 states and 454800 transitions. [2025-02-05 10:48:17,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:17,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 389 [2025-02-05 10:48:17,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:17,731 INFO L225 Difference]: With dead ends: 414080 [2025-02-05 10:48:17,731 INFO L226 Difference]: Without dead ends: 180756 [2025-02-05 10:48:17,849 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 10:48:17,850 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 134 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:17,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 307 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:48:17,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180756 states. [2025-02-05 10:48:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180756 to 180720. [2025-02-05 10:48:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180720 states, 180719 states have (on average 1.0793552421162136) internal successors, (195060), 180719 states have internal predecessors, (195060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180720 states to 180720 states and 195060 transitions. [2025-02-05 10:48:20,390 INFO L78 Accepts]: Start accepts. Automaton has 180720 states and 195060 transitions. Word has length 389 [2025-02-05 10:48:20,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:20,390 INFO L471 AbstractCegarLoop]: Abstraction has 180720 states and 195060 transitions. [2025-02-05 10:48:20,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 180720 states and 195060 transitions. [2025-02-05 10:48:20,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-02-05 10:48:20,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:20,461 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:20,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 10:48:20,461 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:20,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:20,462 INFO L85 PathProgramCache]: Analyzing trace with hash -122813962, now seen corresponding path program 1 times [2025-02-05 10:48:20,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:20,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659566556] [2025-02-05 10:48:20,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:20,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:20,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-02-05 10:48:20,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-02-05 10:48:20,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:20,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 6 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-02-05 10:48:21,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659566556] [2025-02-05 10:48:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659566556] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:48:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851678261] [2025-02-05 10:48:21,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:21,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:21,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:21,864 INFO L229 MonitoredProcess]: Starting monitored process 8 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 10:48:21,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 10:48:21,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-02-05 10:48:22,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-02-05 10:48:22,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:22,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:22,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:48:22,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:48:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-02-05 10:48:22,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:48:22,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851678261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:22,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:48:22,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-05 10:48:22,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812788640] [2025-02-05 10:48:22,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:22,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:22,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:22,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:22,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:22,083 INFO L87 Difference]: Start difference. First operand 180720 states and 195060 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:23,557 INFO L93 Difference]: Finished difference Result 418618 states and 452742 transitions. [2025-02-05 10:48:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:23,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 415 [2025-02-05 10:48:23,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:23,860 INFO L225 Difference]: With dead ends: 418618 [2025-02-05 10:48:23,860 INFO L226 Difference]: Without dead ends: 237900 [2025-02-05 10:48:23,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:23,931 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 152 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:23,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 149 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:48:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237900 states. [2025-02-05 10:48:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237900 to 211373. [2025-02-05 10:48:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211373 states, 211372 states have (on average 1.081198077323392) internal successors, (228535), 211372 states have internal predecessors, (228535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211373 states to 211373 states and 228535 transitions. [2025-02-05 10:48:26,874 INFO L78 Accepts]: Start accepts. Automaton has 211373 states and 228535 transitions. Word has length 415 [2025-02-05 10:48:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:26,874 INFO L471 AbstractCegarLoop]: Abstraction has 211373 states and 228535 transitions. [2025-02-05 10:48:26,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 211373 states and 228535 transitions. [2025-02-05 10:48:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-02-05 10:48:26,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:26,969 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:26,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 10:48:27,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:27,170 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:27,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:27,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1672863642, now seen corresponding path program 1 times [2025-02-05 10:48:27,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:27,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922006776] [2025-02-05 10:48:27,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:27,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-02-05 10:48:27,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-02-05 10:48:27,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:27,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-02-05 10:48:27,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:27,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922006776] [2025-02-05 10:48:27,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922006776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:27,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:48:27,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:48:27,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798560680] [2025-02-05 10:48:27,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:27,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:27,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:27,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:27,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:48:27,400 INFO L87 Difference]: Start difference. First operand 211373 states and 228535 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)