./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.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/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.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 a5deaf1c7eecf4d76182f6b98ab14efecb2cf3c3c2e7d8162af75087f90c331b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:13:28,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:13:28,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:13:28,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:13:28,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:13:28,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:13:28,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:13:28,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:13:28,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:13:28,217 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:13:28,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:13:28,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:13:28,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:13:28,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:13:28,218 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:13:28,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:13:28,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:13:28,219 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:13:28,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:13:28,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:13:28,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:13:28,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:13:28,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:13:28,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:13:28,220 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:13:28,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:13:28,220 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:13:28,220 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:13:28,220 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:13:28,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:13:28,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:13:28,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:13:28,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:13:28,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:13:28,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:13:28,221 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:13:28,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:13:28,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:13:28,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:13:28,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:13:28,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:13:28,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:13:28,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:13:28,222 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 -> a5deaf1c7eecf4d76182f6b98ab14efecb2cf3c3c2e7d8162af75087f90c331b [2025-02-05 16:13:28,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:13:28,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:13:28,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:13:28,541 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:13:28,541 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:13:28,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2025-02-05 16:13:29,884 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71f45c7ff/8714ae62c9d14cd7aefe17b64924141b/FLAG353650018 [2025-02-05 16:13:30,247 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:13:30,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2025-02-05 16:13:30,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71f45c7ff/8714ae62c9d14cd7aefe17b64924141b/FLAG353650018 [2025-02-05 16:13:30,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71f45c7ff/8714ae62c9d14cd7aefe17b64924141b [2025-02-05 16:13:30,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:13:30,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:13:30,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:13:30,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:13:30,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:13:30,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:13:30" (1/1) ... [2025-02-05 16:13:30,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7f7e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:30, skipping insertion in model container [2025-02-05 16:13:30,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:13:30" (1/1) ... [2025-02-05 16:13:30,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:13:30,523 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/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c[6844,6857] [2025-02-05 16:13:30,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:13:30,543 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:13:30,589 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/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c[6844,6857] [2025-02-05 16:13:30,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:13:30,616 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:13:30,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:30 WrapperNode [2025-02-05 16:13:30,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:13:30,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:13:30,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:13:30,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:13:30,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:30" (1/1) ... [2025-02-05 16:13:30,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:30" (1/1) ... [2025-02-05 16:13:30,663 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2025-02-05 16:13:30,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:13:30,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:13:30,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:13:30,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:13:30,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:30" (1/1) ... [2025-02-05 16:13:30,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:30" (1/1) ... [2025-02-05 16:13:30,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:30" (1/1) ... [2025-02-05 16:13:30,684 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 16:13:30,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:30" (1/1) ... [2025-02-05 16:13:30,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:30" (1/1) ... [2025-02-05 16:13:30,689 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:30" (1/1) ... [2025-02-05 16:13:30,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:30" (1/1) ... [2025-02-05 16:13:30,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:30" (1/1) ... [2025-02-05 16:13:30,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:30" (1/1) ... [2025-02-05 16:13:30,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:13:30,700 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:13:30,701 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:13:30,701 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:13:30,702 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:30" (1/1) ... [2025-02-05 16:13:30,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:13:30,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:13:30,738 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 16:13:30,742 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 16:13:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:13:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:13:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:13:30,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:13:30,833 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:13:30,835 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:13:31,177 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-05 16:13:31,177 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:13:31,186 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:13:31,187 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:13:31,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:13:31 BoogieIcfgContainer [2025-02-05 16:13:31,188 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:13:31,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:13:31,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:13:31,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:13:31,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:13:30" (1/3) ... [2025-02-05 16:13:31,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bab3567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:13:31, skipping insertion in model container [2025-02-05 16:13:31,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:30" (2/3) ... [2025-02-05 16:13:31,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bab3567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:13:31, skipping insertion in model container [2025-02-05 16:13:31,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:13:31" (3/3) ... [2025-02-05 16:13:31,198 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2025-02-05 16:13:31,210 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:13:31,213 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c that has 1 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:13:31,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:13:31,288 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;@1579a8dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:13:31,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:13:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 64 states have (on average 1.703125) internal successors, (109), 65 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:31,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 16:13:31,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:31,300 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] [2025-02-05 16:13:31,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:31,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1703050643, now seen corresponding path program 1 times [2025-02-05 16:13:31,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:31,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192770375] [2025-02-05 16:13:31,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:31,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:31,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 16:13:31,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 16:13:31,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:31,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:31,517 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 16:13:31,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:31,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192770375] [2025-02-05 16:13:31,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192770375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:31,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:31,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:13:31,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243082088] [2025-02-05 16:13:31,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:31,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:13:31,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:31,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:13:31,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:13:31,541 INFO L87 Difference]: Start difference. First operand has 66 states, 64 states have (on average 1.703125) internal successors, (109), 65 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:31,555 INFO L93 Difference]: Finished difference Result 110 states and 178 transitions. [2025-02-05 16:13:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:13:31,557 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-02-05 16:13:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:31,562 INFO L225 Difference]: With dead ends: 110 [2025-02-05 16:13:31,562 INFO L226 Difference]: Without dead ends: 63 [2025-02-05 16:13:31,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:13:31,566 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:31,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-05 16:13:31,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-05 16:13:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 62 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 104 transitions. [2025-02-05 16:13:31,595 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 104 transitions. Word has length 25 [2025-02-05 16:13:31,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:31,596 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 104 transitions. [2025-02-05 16:13:31,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 104 transitions. [2025-02-05 16:13:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 16:13:31,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:31,597 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] [2025-02-05 16:13:31,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:13:31,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:31,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:31,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1294226418, now seen corresponding path program 1 times [2025-02-05 16:13:31,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:31,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067773448] [2025-02-05 16:13:31,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:31,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:31,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 16:13:31,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 16:13:31,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:31,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:31,845 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 16:13:31,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:31,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067773448] [2025-02-05 16:13:31,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067773448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:31,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:31,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:13:31,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794489230] [2025-02-05 16:13:31,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:31,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:13:31,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:31,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:13:31,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:31,848 INFO L87 Difference]: Start difference. First operand 63 states and 104 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:31,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:31,929 INFO L93 Difference]: Finished difference Result 147 states and 236 transitions. [2025-02-05 16:13:31,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:13:31,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-02-05 16:13:31,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:31,931 INFO L225 Difference]: With dead ends: 147 [2025-02-05 16:13:31,931 INFO L226 Difference]: Without dead ends: 103 [2025-02-05 16:13:31,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:31,932 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 63 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:31,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 377 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:13:31,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-05 16:13:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 63. [2025-02-05 16:13:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2025-02-05 16:13:31,938 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 25 [2025-02-05 16:13:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:31,939 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2025-02-05 16:13:31,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:31,939 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2025-02-05 16:13:31,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 16:13:31,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:31,940 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] [2025-02-05 16:13:31,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:13:31,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:31,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:31,941 INFO L85 PathProgramCache]: Analyzing trace with hash -76370206, now seen corresponding path program 1 times [2025-02-05 16:13:31,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:31,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932020013] [2025-02-05 16:13:31,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:31,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:31,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 16:13:32,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 16:13:32,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:32,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:32,093 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 16:13:32,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:32,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932020013] [2025-02-05 16:13:32,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932020013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:32,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:32,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:32,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846103821] [2025-02-05 16:13:32,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:32,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:32,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:32,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:32,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:32,097 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:32,132 INFO L93 Difference]: Finished difference Result 135 states and 201 transitions. [2025-02-05 16:13:32,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:32,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-02-05 16:13:32,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:32,137 INFO L225 Difference]: With dead ends: 135 [2025-02-05 16:13:32,137 INFO L226 Difference]: Without dead ends: 95 [2025-02-05 16:13:32,138 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 16:13:32,138 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:32,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 194 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:32,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-05 16:13:32,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-02-05 16:13:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 92 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-02-05 16:13:32,152 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 41 [2025-02-05 16:13:32,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:32,152 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-02-05 16:13:32,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-02-05 16:13:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 16:13:32,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:32,153 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] [2025-02-05 16:13:32,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:13:32,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:32,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:32,155 INFO L85 PathProgramCache]: Analyzing trace with hash 112567055, now seen corresponding path program 1 times [2025-02-05 16:13:32,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:32,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835449766] [2025-02-05 16:13:32,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:32,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:32,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 16:13:32,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 16:13:32,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:32,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:32,329 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 16:13:32,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:32,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835449766] [2025-02-05 16:13:32,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835449766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:32,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:32,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:13:32,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391877268] [2025-02-05 16:13:32,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:32,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:13:32,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:32,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:13:32,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:32,333 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:32,423 INFO L93 Difference]: Finished difference Result 373 states and 583 transitions. [2025-02-05 16:13:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:13:32,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-02-05 16:13:32,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:32,427 INFO L225 Difference]: With dead ends: 373 [2025-02-05 16:13:32,427 INFO L226 Difference]: Without dead ends: 303 [2025-02-05 16:13:32,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:13:32,428 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 362 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:32,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 291 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:13:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-02-05 16:13:32,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 161. [2025-02-05 16:13:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.5125) internal successors, (242), 160 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 242 transitions. [2025-02-05 16:13:32,448 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 242 transitions. Word has length 41 [2025-02-05 16:13:32,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:32,449 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 242 transitions. [2025-02-05 16:13:32,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 242 transitions. [2025-02-05 16:13:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 16:13:32,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:32,450 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] [2025-02-05 16:13:32,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:13:32,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:32,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:32,451 INFO L85 PathProgramCache]: Analyzing trace with hash -775774379, now seen corresponding path program 1 times [2025-02-05 16:13:32,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:32,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472781216] [2025-02-05 16:13:32,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:32,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:32,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 16:13:32,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 16:13:32,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:32,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:32,741 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 16:13:32,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:32,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472781216] [2025-02-05 16:13:32,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472781216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:32,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:32,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:13:32,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644918401] [2025-02-05 16:13:32,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:32,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:13:32,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:32,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:13:32,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:13:32,743 INFO L87 Difference]: Start difference. First operand 161 states and 242 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:32,795 INFO L93 Difference]: Finished difference Result 175 states and 259 transitions. [2025-02-05 16:13:32,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:13:32,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-02-05 16:13:32,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:32,799 INFO L225 Difference]: With dead ends: 175 [2025-02-05 16:13:32,800 INFO L226 Difference]: Without dead ends: 173 [2025-02-05 16:13:32,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:13:32,800 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:32,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 552 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:32,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-05 16:13:32,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-02-05 16:13:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.4767441860465116) internal successors, (254), 172 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 254 transitions. [2025-02-05 16:13:32,816 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 254 transitions. Word has length 42 [2025-02-05 16:13:32,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:32,816 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 254 transitions. [2025-02-05 16:13:32,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 254 transitions. [2025-02-05 16:13:32,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 16:13:32,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:32,817 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] [2025-02-05 16:13:32,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:13:32,817 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:32,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1809517583, now seen corresponding path program 1 times [2025-02-05 16:13:32,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:32,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199956909] [2025-02-05 16:13:32,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:32,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:32,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 16:13:32,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 16:13:32,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:32,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:32,893 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 16:13:32,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:32,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199956909] [2025-02-05 16:13:32,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199956909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:32,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:32,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:32,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526725633] [2025-02-05 16:13:32,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:32,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:32,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:32,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:32,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:32,896 INFO L87 Difference]: Start difference. First operand 173 states and 254 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:32,915 INFO L93 Difference]: Finished difference Result 394 states and 593 transitions. [2025-02-05 16:13:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:32,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-02-05 16:13:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:32,919 INFO L225 Difference]: With dead ends: 394 [2025-02-05 16:13:32,920 INFO L226 Difference]: Without dead ends: 244 [2025-02-05 16:13:32,921 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 16:13:32,922 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 37 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:32,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:32,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-02-05 16:13:32,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2025-02-05 16:13:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.4896265560165975) internal successors, (359), 241 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2025-02-05 16:13:32,941 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 43 [2025-02-05 16:13:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:32,941 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2025-02-05 16:13:32,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2025-02-05 16:13:32,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 16:13:32,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:32,942 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] [2025-02-05 16:13:32,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:13:32,942 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:32,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:32,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1295937826, now seen corresponding path program 1 times [2025-02-05 16:13:32,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:32,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723079174] [2025-02-05 16:13:32,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:32,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:32,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 16:13:32,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 16:13:32,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:32,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:33,022 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 16:13:33,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:33,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723079174] [2025-02-05 16:13:33,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723079174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:33,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:33,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:33,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266521027] [2025-02-05 16:13:33,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:33,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:33,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:33,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:33,026 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:33,053 INFO L93 Difference]: Finished difference Result 628 states and 943 transitions. [2025-02-05 16:13:33,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:33,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-02-05 16:13:33,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:33,057 INFO L225 Difference]: With dead ends: 628 [2025-02-05 16:13:33,057 INFO L226 Difference]: Without dead ends: 411 [2025-02-05 16:13:33,058 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 16:13:33,060 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 44 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:33,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:33,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-05 16:13:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2025-02-05 16:13:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 1.4754901960784315) internal successors, (602), 408 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 602 transitions. [2025-02-05 16:13:33,079 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 602 transitions. Word has length 44 [2025-02-05 16:13:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:33,079 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 602 transitions. [2025-02-05 16:13:33,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 602 transitions. [2025-02-05 16:13:33,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 16:13:33,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:33,080 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] [2025-02-05 16:13:33,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:13:33,080 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:33,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:33,081 INFO L85 PathProgramCache]: Analyzing trace with hash 137261936, now seen corresponding path program 1 times [2025-02-05 16:13:33,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:33,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487199410] [2025-02-05 16:13:33,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:33,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:33,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 16:13:33,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 16:13:33,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:33,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:33,144 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 16:13:33,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:33,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487199410] [2025-02-05 16:13:33,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487199410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:33,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:33,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:33,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421174229] [2025-02-05 16:13:33,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:33,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:33,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:33,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:33,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:33,146 INFO L87 Difference]: Start difference. First operand 409 states and 602 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:33,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:33,180 INFO L93 Difference]: Finished difference Result 1081 states and 1588 transitions. [2025-02-05 16:13:33,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:33,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-02-05 16:13:33,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:33,185 INFO L225 Difference]: With dead ends: 1081 [2025-02-05 16:13:33,185 INFO L226 Difference]: Without dead ends: 697 [2025-02-05 16:13:33,186 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 16:13:33,186 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 48 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:33,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:33,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-02-05 16:13:33,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 695. [2025-02-05 16:13:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 1.4380403458213256) internal successors, (998), 694 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 998 transitions. [2025-02-05 16:13:33,228 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 998 transitions. Word has length 44 [2025-02-05 16:13:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:33,228 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 998 transitions. [2025-02-05 16:13:33,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 998 transitions. [2025-02-05 16:13:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:13:33,244 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:33,244 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] [2025-02-05 16:13:33,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:13:33,244 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:33,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:33,245 INFO L85 PathProgramCache]: Analyzing trace with hash -90192710, now seen corresponding path program 1 times [2025-02-05 16:13:33,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:33,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50920950] [2025-02-05 16:13:33,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:33,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:33,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:13:33,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:13:33,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:33,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:33,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:33,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50920950] [2025-02-05 16:13:33,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50920950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:33,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:33,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:33,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638014972] [2025-02-05 16:13:33,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:33,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:33,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:33,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:33,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:33,411 INFO L87 Difference]: Start difference. First operand 695 states and 998 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:33,438 INFO L93 Difference]: Finished difference Result 1367 states and 1972 transitions. [2025-02-05 16:13:33,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:33,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-02-05 16:13:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:33,444 INFO L225 Difference]: With dead ends: 1367 [2025-02-05 16:13:33,444 INFO L226 Difference]: Without dead ends: 697 [2025-02-05 16:13:33,445 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 16:13:33,445 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 41 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:33,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 182 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-02-05 16:13:33,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 695. [2025-02-05 16:13:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 1.420749279538905) internal successors, (986), 694 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 986 transitions. [2025-02-05 16:13:33,484 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 986 transitions. Word has length 62 [2025-02-05 16:13:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:33,486 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 986 transitions. [2025-02-05 16:13:33,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 986 transitions. [2025-02-05 16:13:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:13:33,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:33,487 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:13:33,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:13:33,488 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:33,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:33,490 INFO L85 PathProgramCache]: Analyzing trace with hash -389830323, now seen corresponding path program 1 times [2025-02-05 16:13:33,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:33,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773745518] [2025-02-05 16:13:33,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:33,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:33,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:13:33,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:13:33,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:33,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:33,597 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 16:13:33,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:33,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773745518] [2025-02-05 16:13:33,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773745518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:33,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:33,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:33,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544334349] [2025-02-05 16:13:33,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:33,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:33,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:33,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:33,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:33,599 INFO L87 Difference]: Start difference. First operand 695 states and 986 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:33,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:33,623 INFO L93 Difference]: Finished difference Result 1033 states and 1468 transitions. [2025-02-05 16:13:33,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:33,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-02-05 16:13:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:33,626 INFO L225 Difference]: With dead ends: 1033 [2025-02-05 16:13:33,627 INFO L226 Difference]: Without dead ends: 363 [2025-02-05 16:13:33,630 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 16:13:33,631 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:33,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:33,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-05 16:13:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2025-02-05 16:13:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.3888888888888888) internal successors, (500), 360 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 500 transitions. [2025-02-05 16:13:33,647 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 500 transitions. Word has length 62 [2025-02-05 16:13:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:33,648 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 500 transitions. [2025-02-05 16:13:33,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 500 transitions. [2025-02-05 16:13:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:13:33,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:33,649 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:13:33,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:13:33,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:33,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:33,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1008808096, now seen corresponding path program 1 times [2025-02-05 16:13:33,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:33,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713169416] [2025-02-05 16:13:33,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:33,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:33,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:13:33,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:13:33,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:33,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:36,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:36,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713169416] [2025-02-05 16:13:36,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713169416] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:13:36,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420591091] [2025-02-05 16:13:36,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:36,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:13:36,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:13:36,299 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 16:13:36,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:13:36,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:13:36,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:13:36,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:36,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:36,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:13:36,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:13:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:36,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:13:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:37,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420591091] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:13:37,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:13:37,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 24 [2025-02-05 16:13:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398193164] [2025-02-05 16:13:37,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:13:37,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 16:13:37,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:37,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 16:13:37,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-02-05 16:13:37,561 INFO L87 Difference]: Start difference. First operand 361 states and 500 transitions. Second operand has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:47,903 INFO L93 Difference]: Finished difference Result 3546 states and 4902 transitions. [2025-02-05 16:13:47,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-02-05 16:13:47,903 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 0 states have call successors, (0), 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 62 [2025-02-05 16:13:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:47,916 INFO L225 Difference]: With dead ends: 3546 [2025-02-05 16:13:47,917 INFO L226 Difference]: Without dead ends: 3210 [2025-02-05 16:13:47,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6353 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=3071, Invalid=14221, Unknown=0, NotChecked=0, Total=17292 [2025-02-05 16:13:47,926 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 4189 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4189 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:47,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4189 Valid, 1175 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 16:13:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2025-02-05 16:13:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 2172. [2025-02-05 16:13:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 2171 states have (on average 1.3735605711653616) internal successors, (2982), 2171 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 2982 transitions. [2025-02-05 16:13:48,011 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 2982 transitions. Word has length 62 [2025-02-05 16:13:48,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:48,011 INFO L471 AbstractCegarLoop]: Abstraction has 2172 states and 2982 transitions. [2025-02-05 16:13:48,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:48,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2982 transitions. [2025-02-05 16:13:48,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:13:48,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:48,012 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] [2025-02-05 16:13:48,021 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 16:13:48,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 16:13:48,217 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:48,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:48,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2023061580, now seen corresponding path program 1 times [2025-02-05 16:13:48,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:48,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960762350] [2025-02-05 16:13:48,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:48,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:48,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:13:48,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:13:48,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:48,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:13:48,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:48,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960762350] [2025-02-05 16:13:48,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960762350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:48,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:48,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:13:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111908041] [2025-02-05 16:13:48,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:48,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:13:48,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:48,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:13:48,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:48,331 INFO L87 Difference]: Start difference. First operand 2172 states and 2982 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:48,440 INFO L93 Difference]: Finished difference Result 5241 states and 7261 transitions. [2025-02-05 16:13:48,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:13:48,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 63 [2025-02-05 16:13:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:48,457 INFO L225 Difference]: With dead ends: 5241 [2025-02-05 16:13:48,457 INFO L226 Difference]: Without dead ends: 4226 [2025-02-05 16:13:48,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:13:48,462 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 216 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:48,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 425 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:48,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4226 states. [2025-02-05 16:13:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4226 to 3133. [2025-02-05 16:13:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 3132 states have (on average 1.3690932311621966) internal successors, (4288), 3132 states have internal predecessors, (4288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 4288 transitions. [2025-02-05 16:13:48,607 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 4288 transitions. Word has length 63 [2025-02-05 16:13:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:48,607 INFO L471 AbstractCegarLoop]: Abstraction has 3133 states and 4288 transitions. [2025-02-05 16:13:48,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4288 transitions. [2025-02-05 16:13:48,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:13:48,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:48,608 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] [2025-02-05 16:13:48,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:13:48,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:48,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1882956040, now seen corresponding path program 1 times [2025-02-05 16:13:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:48,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933905891] [2025-02-05 16:13:48,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:48,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:48,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:13:48,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:13:48,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:48,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:13:48,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:48,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933905891] [2025-02-05 16:13:48,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933905891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:48,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:48,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:13:48,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114852935] [2025-02-05 16:13:48,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:48,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:13:48,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:48,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:13:48,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:48,693 INFO L87 Difference]: Start difference. First operand 3133 states and 4288 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:48,821 INFO L93 Difference]: Finished difference Result 6253 states and 8638 transitions. [2025-02-05 16:13:48,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:13:48,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 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 63 [2025-02-05 16:13:48,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:48,841 INFO L225 Difference]: With dead ends: 6253 [2025-02-05 16:13:48,841 INFO L226 Difference]: Without dead ends: 5178 [2025-02-05 16:13:48,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:13:48,845 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 218 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:48,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 366 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2025-02-05 16:13:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 4152. [2025-02-05 16:13:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 4151 states have (on average 1.3659359190556493) internal successors, (5670), 4151 states have internal predecessors, (5670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 5670 transitions. [2025-02-05 16:13:49,026 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 5670 transitions. Word has length 63 [2025-02-05 16:13:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:49,027 INFO L471 AbstractCegarLoop]: Abstraction has 4152 states and 5670 transitions. [2025-02-05 16:13:49,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 5670 transitions. [2025-02-05 16:13:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:13:49,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:49,029 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] [2025-02-05 16:13:49,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:13:49,030 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:49,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:49,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1249229689, now seen corresponding path program 1 times [2025-02-05 16:13:49,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:49,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809690262] [2025-02-05 16:13:49,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:49,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:49,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:13:49,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:13:49,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:49,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:49,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:49,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809690262] [2025-02-05 16:13:49,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809690262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:49,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:49,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:49,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131793825] [2025-02-05 16:13:49,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:49,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:49,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:49,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:49,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:49,080 INFO L87 Difference]: Start difference. First operand 4152 states and 5670 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:49,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:49,256 INFO L93 Difference]: Finished difference Result 12024 states and 16282 transitions. [2025-02-05 16:13:49,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:49,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:13:49,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:49,282 INFO L225 Difference]: With dead ends: 12024 [2025-02-05 16:13:49,282 INFO L226 Difference]: Without dead ends: 7999 [2025-02-05 16:13:49,288 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 16:13:49,289 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 37 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:49,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 212 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:49,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7999 states. [2025-02-05 16:13:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7999 to 7997. [2025-02-05 16:13:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7997 states, 7996 states have (on average 1.3267883941970986) internal successors, (10609), 7996 states have internal predecessors, (10609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7997 states to 7997 states and 10609 transitions. [2025-02-05 16:13:49,623 INFO L78 Accepts]: Start accepts. Automaton has 7997 states and 10609 transitions. Word has length 64 [2025-02-05 16:13:49,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:49,623 INFO L471 AbstractCegarLoop]: Abstraction has 7997 states and 10609 transitions. [2025-02-05 16:13:49,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:49,624 INFO L276 IsEmpty]: Start isEmpty. Operand 7997 states and 10609 transitions. [2025-02-05 16:13:49,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:13:49,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:49,625 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] [2025-02-05 16:13:49,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:13:49,626 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:49,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:49,626 INFO L85 PathProgramCache]: Analyzing trace with hash 111310681, now seen corresponding path program 1 times [2025-02-05 16:13:49,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:49,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508762869] [2025-02-05 16:13:49,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:49,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:49,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:13:49,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:13:49,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:49,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:49,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508762869] [2025-02-05 16:13:49,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508762869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:49,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:49,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:49,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112653183] [2025-02-05 16:13:49,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:49,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:49,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:49,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:49,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:49,691 INFO L87 Difference]: Start difference. First operand 7997 states and 10609 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:50,090 INFO L93 Difference]: Finished difference Result 20890 states and 27629 transitions. [2025-02-05 16:13:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:50,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:13:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:50,140 INFO L225 Difference]: With dead ends: 20890 [2025-02-05 16:13:50,140 INFO L226 Difference]: Without dead ends: 13160 [2025-02-05 16:13:50,152 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 16:13:50,154 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 40 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:50,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 164 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:50,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13160 states. [2025-02-05 16:13:50,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13160 to 13158. [2025-02-05 16:13:50,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13158 states, 13157 states have (on average 1.3015125028501937) internal successors, (17124), 13157 states have internal predecessors, (17124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13158 states to 13158 states and 17124 transitions. [2025-02-05 16:13:50,605 INFO L78 Accepts]: Start accepts. Automaton has 13158 states and 17124 transitions. Word has length 64 [2025-02-05 16:13:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:50,606 INFO L471 AbstractCegarLoop]: Abstraction has 13158 states and 17124 transitions. [2025-02-05 16:13:50,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 13158 states and 17124 transitions. [2025-02-05 16:13:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:13:50,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:50,608 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] [2025-02-05 16:13:50,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:13:50,608 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:50,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:50,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1534170157, now seen corresponding path program 1 times [2025-02-05 16:13:50,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:50,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200462746] [2025-02-05 16:13:50,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:50,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:50,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:13:50,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:13:50,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:50,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:50,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:50,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200462746] [2025-02-05 16:13:50,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200462746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:50,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:50,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:50,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669921418] [2025-02-05 16:13:50,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:50,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:50,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:50,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:50,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:50,660 INFO L87 Difference]: Start difference. First operand 13158 states and 17124 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:51,028 INFO L93 Difference]: Finished difference Result 30346 states and 39530 transitions. [2025-02-05 16:13:51,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:51,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:13:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:51,065 INFO L225 Difference]: With dead ends: 30346 [2025-02-05 16:13:51,065 INFO L226 Difference]: Without dead ends: 17565 [2025-02-05 16:13:51,077 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 16:13:51,078 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 40 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:51,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 171 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17565 states. [2025-02-05 16:13:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17565 to 17563. [2025-02-05 16:13:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17563 states, 17562 states have (on average 1.2781573852636374) internal successors, (22447), 17562 states have internal predecessors, (22447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17563 states to 17563 states and 22447 transitions. [2025-02-05 16:13:51,676 INFO L78 Accepts]: Start accepts. Automaton has 17563 states and 22447 transitions. Word has length 64 [2025-02-05 16:13:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:51,676 INFO L471 AbstractCegarLoop]: Abstraction has 17563 states and 22447 transitions. [2025-02-05 16:13:51,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 17563 states and 22447 transitions. [2025-02-05 16:13:51,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:13:51,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:51,679 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] [2025-02-05 16:13:51,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:13:51,680 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:51,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:51,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2081628779, now seen corresponding path program 1 times [2025-02-05 16:13:51,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:51,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88558247] [2025-02-05 16:13:51,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:51,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:51,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:13:51,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:13:51,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:51,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:13:51,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:51,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88558247] [2025-02-05 16:13:51,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88558247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:51,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:51,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:13:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532216540] [2025-02-05 16:13:51,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:51,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:13:51,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:51,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:13:51,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:51,772 INFO L87 Difference]: Start difference. First operand 17563 states and 22447 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:52,364 INFO L93 Difference]: Finished difference Result 29010 states and 37409 transitions. [2025-02-05 16:13:52,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:13:52,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 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 64 [2025-02-05 16:13:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:52,411 INFO L225 Difference]: With dead ends: 29010 [2025-02-05 16:13:52,412 INFO L226 Difference]: Without dead ends: 23021 [2025-02-05 16:13:52,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:13:52,424 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 219 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:52,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 398 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:52,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23021 states. [2025-02-05 16:13:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23021 to 21566. [2025-02-05 16:13:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21566 states, 21565 states have (on average 1.2714583816369116) internal successors, (27419), 21565 states have internal predecessors, (27419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21566 states to 21566 states and 27419 transitions. [2025-02-05 16:13:53,096 INFO L78 Accepts]: Start accepts. Automaton has 21566 states and 27419 transitions. Word has length 64 [2025-02-05 16:13:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:53,097 INFO L471 AbstractCegarLoop]: Abstraction has 21566 states and 27419 transitions. [2025-02-05 16:13:53,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:53,097 INFO L276 IsEmpty]: Start isEmpty. Operand 21566 states and 27419 transitions. [2025-02-05 16:13:53,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:13:53,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:53,099 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] [2025-02-05 16:13:53,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:13:53,100 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:53,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:53,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1778418228, now seen corresponding path program 1 times [2025-02-05 16:13:53,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:53,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665776333] [2025-02-05 16:13:53,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:53,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:53,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:13:53,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:13:53,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:53,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:53,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:53,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665776333] [2025-02-05 16:13:53,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665776333] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:13:53,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93519488] [2025-02-05 16:13:53,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:53,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:13:53,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:13:53,410 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 16:13:53,412 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 16:13:53,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:13:53,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:13:53,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:53,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:53,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 16:13:53,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:13:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:54,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:13:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:55,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93519488] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:13:55,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:13:55,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 16] total 36 [2025-02-05 16:13:55,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621009524] [2025-02-05 16:13:55,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:13:55,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 16:13:55,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:55,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 16:13:55,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 16:13:55,124 INFO L87 Difference]: Start difference. First operand 21566 states and 27419 transitions. Second operand has 36 states, 36 states have (on average 4.972222222222222) internal successors, (179), 36 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:04,935 INFO L93 Difference]: Finished difference Result 131571 states and 168239 transitions. [2025-02-05 16:14:04,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2025-02-05 16:14:04,936 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.972222222222222) internal successors, (179), 36 states have internal predecessors, (179), 0 states have call successors, (0), 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 66 [2025-02-05 16:14:04,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:05,164 INFO L225 Difference]: With dead ends: 131571 [2025-02-05 16:14:05,164 INFO L226 Difference]: Without dead ends: 110228 [2025-02-05 16:14:05,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17714 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=7852, Invalid=36880, Unknown=0, NotChecked=0, Total=44732 [2025-02-05 16:14:05,216 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 6969 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6969 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:05,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6969 Valid, 2486 Invalid, 2839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 16:14:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110228 states. [2025-02-05 16:14:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110228 to 75891. [2025-02-05 16:14:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75891 states, 75890 states have (on average 1.2582949005139017) internal successors, (95492), 75890 states have internal predecessors, (95492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75891 states to 75891 states and 95492 transitions. [2025-02-05 16:14:07,497 INFO L78 Accepts]: Start accepts. Automaton has 75891 states and 95492 transitions. Word has length 66 [2025-02-05 16:14:07,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:07,498 INFO L471 AbstractCegarLoop]: Abstraction has 75891 states and 95492 transitions. [2025-02-05 16:14:07,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.972222222222222) internal successors, (179), 36 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 75891 states and 95492 transitions. [2025-02-05 16:14:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:14:07,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:07,501 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] [2025-02-05 16:14:07,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:14:07,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 16:14:07,705 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:07,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:07,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1455892199, now seen corresponding path program 1 times [2025-02-05 16:14:07,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:07,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683039763] [2025-02-05 16:14:07,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:07,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:07,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:14:07,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:14:07,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:07,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:07,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:07,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683039763] [2025-02-05 16:14:07,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683039763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:07,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:07,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:14:07,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364493178] [2025-02-05 16:14:07,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:07,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:14:07,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:07,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:14:07,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:14:07,758 INFO L87 Difference]: Start difference. First operand 75891 states and 95492 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:09,138 INFO L93 Difference]: Finished difference Result 99781 states and 125220 transitions. [2025-02-05 16:14:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:14:09,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-02-05 16:14:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:09,230 INFO L225 Difference]: With dead ends: 99781 [2025-02-05 16:14:09,230 INFO L226 Difference]: Without dead ends: 53193 [2025-02-05 16:14:09,264 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 16:14:09,264 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 37 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:09,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 206 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:14:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53193 states. [2025-02-05 16:14:10,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53193 to 47515. [2025-02-05 16:14:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47515 states, 47514 states have (on average 1.2397819590015575) internal successors, (58907), 47514 states have internal predecessors, (58907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47515 states to 47515 states and 58907 transitions. [2025-02-05 16:14:10,918 INFO L78 Accepts]: Start accepts. Automaton has 47515 states and 58907 transitions. Word has length 67 [2025-02-05 16:14:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:10,918 INFO L471 AbstractCegarLoop]: Abstraction has 47515 states and 58907 transitions. [2025-02-05 16:14:10,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 47515 states and 58907 transitions. [2025-02-05 16:14:10,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:14:10,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:10,921 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] [2025-02-05 16:14:10,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:14:10,921 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:10,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:10,922 INFO L85 PathProgramCache]: Analyzing trace with hash -300852910, now seen corresponding path program 1 times [2025-02-05 16:14:10,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:10,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105334261] [2025-02-05 16:14:10,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:10,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:10,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:14:10,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:14:10,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:10,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:11,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:11,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105334261] [2025-02-05 16:14:11,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105334261] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:14:11,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215628814] [2025-02-05 16:14:11,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:11,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:11,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:14:11,911 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 16:14:11,914 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 16:14:11,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:14:12,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:14:12,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:12,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:12,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-05 16:14:12,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:14:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:13,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:14:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:16,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215628814] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:14:16,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:14:16,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 42 [2025-02-05 16:14:16,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989744183] [2025-02-05 16:14:16,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:14:16,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-05 16:14:16,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:16,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-05 16:14:16,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2025-02-05 16:14:16,024 INFO L87 Difference]: Start difference. First operand 47515 states and 58907 transitions. Second operand has 42 states, 42 states have (on average 4.333333333333333) internal successors, (182), 42 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:37,284 INFO L93 Difference]: Finished difference Result 212035 states and 261441 transitions. [2025-02-05 16:14:37,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2025-02-05 16:14:37,285 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.333333333333333) internal successors, (182), 42 states have internal predecessors, (182), 0 states have call successors, (0), 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 68 [2025-02-05 16:14:37,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:37,498 INFO L225 Difference]: With dead ends: 212035 [2025-02-05 16:14:37,498 INFO L226 Difference]: Without dead ends: 164730 [2025-02-05 16:14:37,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12043 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=6447, Invalid=23655, Unknown=0, NotChecked=0, Total=30102 [2025-02-05 16:14:37,550 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 5053 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5053 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:37,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5053 Valid, 2016 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 16:14:37,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164730 states. [2025-02-05 16:14:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164730 to 68966. [2025-02-05 16:14:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68966 states, 68965 states have (on average 1.2422533168998768) internal successors, (85672), 68965 states have internal predecessors, (85672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68966 states to 68966 states and 85672 transitions. [2025-02-05 16:14:41,219 INFO L78 Accepts]: Start accepts. Automaton has 68966 states and 85672 transitions. Word has length 68 [2025-02-05 16:14:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:41,219 INFO L471 AbstractCegarLoop]: Abstraction has 68966 states and 85672 transitions. [2025-02-05 16:14:41,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.333333333333333) internal successors, (182), 42 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 68966 states and 85672 transitions. [2025-02-05 16:14:41,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 16:14:41,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:41,233 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:41,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 16:14:41,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:41,434 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:41,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:41,434 INFO L85 PathProgramCache]: Analyzing trace with hash 111799621, now seen corresponding path program 1 times [2025-02-05 16:14:41,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:41,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854217750] [2025-02-05 16:14:41,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:41,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:41,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:14:41,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:14:41,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:41,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 16:14:41,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:41,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854217750] [2025-02-05 16:14:41,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854217750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:41,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:41,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:14:41,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583316366] [2025-02-05 16:14:41,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:41,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:14:41,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:41,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:14:41,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:14:41,500 INFO L87 Difference]: Start difference. First operand 68966 states and 85672 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:43,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:43,181 INFO L93 Difference]: Finished difference Result 97189 states and 120509 transitions. [2025-02-05 16:14:43,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:14:43,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 108 [2025-02-05 16:14:43,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:43,254 INFO L225 Difference]: With dead ends: 97189 [2025-02-05 16:14:43,255 INFO L226 Difference]: Without dead ends: 54210 [2025-02-05 16:14:43,279 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 16:14:43,280 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 26 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:43,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 200 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:14:43,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54210 states. [2025-02-05 16:14:44,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54210 to 44233. [2025-02-05 16:14:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44233 states, 44232 states have (on average 1.2247241815879906) internal successors, (54172), 44232 states have internal predecessors, (54172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44233 states to 44233 states and 54172 transitions. [2025-02-05 16:14:44,626 INFO L78 Accepts]: Start accepts. Automaton has 44233 states and 54172 transitions. Word has length 108 [2025-02-05 16:14:44,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:44,626 INFO L471 AbstractCegarLoop]: Abstraction has 44233 states and 54172 transitions. [2025-02-05 16:14:44,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:44,626 INFO L276 IsEmpty]: Start isEmpty. Operand 44233 states and 54172 transitions. [2025-02-05 16:14:44,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 16:14:44,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:44,634 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:44,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:14:44,634 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:44,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1540051688, now seen corresponding path program 1 times [2025-02-05 16:14:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:44,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563895200] [2025-02-05 16:14:44,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:44,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:44,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:14:44,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:14:44,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:44,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 16:14:45,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:45,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563895200] [2025-02-05 16:14:45,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563895200] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:14:45,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867153441] [2025-02-05 16:14:45,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:45,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:45,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:14:45,039 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 16:14:45,041 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 16:14:45,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:14:45,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:14:45,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:45,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:45,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 16:14:45,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:14:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 37 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:45,752 INFO L312 TraceCheckSpWp]: Computing backward predicates...