./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label48.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 8261a53c19f43c038d6c9bf7efdae8a565c27af3d0b11334f16494326c28bf76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:59:12,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:59:13,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:59:13,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:59:13,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:59:13,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:59:13,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:59:13,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:59:13,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:59:13,036 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:59:13,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:59:13,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:59:13,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:59:13,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:59:13,037 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:59:13,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:59:13,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:59:13,037 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:59:13,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:59:13,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:59:13,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:59:13,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:59:13,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:59:13,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:59:13,037 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:59:13,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:59:13,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:59:13,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:59:13,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:59:13,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:59:13,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:59:13,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:59:13,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:59:13,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:59:13,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:59:13,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:59:13,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:59:13,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:59:13,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:59:13,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:59:13,041 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:59:13,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:59:13,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:59:13,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:59:13,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:59:13,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:59:13,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:59:13,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:59:13,041 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 -> 8261a53c19f43c038d6c9bf7efdae8a565c27af3d0b11334f16494326c28bf76 [2025-01-08 23:59:13,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:59:13,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:59:13,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:59:13,256 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:59:13,257 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:59:13,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label48.c [2025-01-08 23:59:14,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e05a8711/9bfb044cc7e64161b9c95faa34deee66/FLAG697f4fee9 [2025-01-08 23:59:14,658 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:59:14,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label48.c [2025-01-08 23:59:14,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e05a8711/9bfb044cc7e64161b9c95faa34deee66/FLAG697f4fee9 [2025-01-08 23:59:14,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e05a8711/9bfb044cc7e64161b9c95faa34deee66 [2025-01-08 23:59:14,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:59:14,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:59:14,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:59:14,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:59:14,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:59:14,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:59:14" (1/1) ... [2025-01-08 23:59:14,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d89d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:14, skipping insertion in model container [2025-01-08 23:59:14,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:59:14" (1/1) ... [2025-01-08 23:59:14,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:59:14,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label48.c[4040,4053] [2025-01-08 23:59:15,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:59:15,029 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:59:15,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label48.c[4040,4053] [2025-01-08 23:59:15,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:59:15,110 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:59:15,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:15 WrapperNode [2025-01-08 23:59:15,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:59:15,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:59:15,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:59:15,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:59:15,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:15" (1/1) ... [2025-01-08 23:59:15,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:15" (1/1) ... [2025-01-08 23:59:15,195 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-01-08 23:59:15,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:59:15,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:59:15,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:59:15,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:59:15,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:15" (1/1) ... [2025-01-08 23:59:15,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:15" (1/1) ... [2025-01-08 23:59:15,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:15" (1/1) ... [2025-01-08 23:59:15,239 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-01-08 23:59:15,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:15" (1/1) ... [2025-01-08 23:59:15,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:15" (1/1) ... [2025-01-08 23:59:15,269 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:15" (1/1) ... [2025-01-08 23:59:15,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:15" (1/1) ... [2025-01-08 23:59:15,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:15" (1/1) ... [2025-01-08 23:59:15,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:15" (1/1) ... [2025-01-08 23:59:15,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:15" (1/1) ... [2025-01-08 23:59:15,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:59:15,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:59:15,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:59:15,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:59:15,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:15" (1/1) ... [2025-01-08 23:59:15,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:59:15,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:15,327 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-01-08 23:59:15,329 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-01-08 23:59:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:59:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:59:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:59:15,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:59:15,384 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:59:15,386 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:59:16,280 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-01-08 23:59:16,283 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:59:16,296 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:59:16,296 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:59:16,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:59:16 BoogieIcfgContainer [2025-01-08 23:59:16,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:59:16,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:59:16,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:59:16,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:59:16,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:59:14" (1/3) ... [2025-01-08 23:59:16,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e9bb1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:59:16, skipping insertion in model container [2025-01-08 23:59:16,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:15" (2/3) ... [2025-01-08 23:59:16,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e9bb1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:59:16, skipping insertion in model container [2025-01-08 23:59:16,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:59:16" (3/3) ... [2025-01-08 23:59:16,303 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label48.c [2025-01-08 23:59:16,312 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:59:16,314 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label48.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:59:16,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:59:16,367 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;@47086abd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:59:16,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:59:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-08 23:59:16,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:16,376 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] [2025-01-08 23:59:16,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:16,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:16,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1878469622, now seen corresponding path program 1 times [2025-01-08 23:59:16,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:16,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626610914] [2025-01-08 23:59:16,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:16,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:16,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-08 23:59:16,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-08 23:59:16,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:16,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:59:16,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:16,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626610914] [2025-01-08 23:59:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626610914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:16,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:16,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:16,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685070069] [2025-01-08 23:59:16,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:16,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:16,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:16,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:16,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:16,659 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 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 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:17,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:17,795 INFO L93 Difference]: Finished difference Result 852 states and 1556 transitions. [2025-01-08 23:59:17,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:17,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-01-08 23:59:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:17,803 INFO L225 Difference]: With dead ends: 852 [2025-01-08 23:59:17,804 INFO L226 Difference]: Without dead ends: 538 [2025-01-08 23:59:17,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:59:17,807 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 558 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:17,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 44 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 23:59:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-01-08 23:59:17,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-01-08 23:59:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.4487895716945995) internal successors, (778), 537 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2025-01-08 23:59:17,881 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 38 [2025-01-08 23:59:17,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:17,881 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2025-01-08 23:59:17,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2025-01-08 23:59:17,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-08 23:59:17,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:17,885 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:17,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:59:17,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:17,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:17,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1145575104, now seen corresponding path program 1 times [2025-01-08 23:59:17,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:17,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944259536] [2025-01-08 23:59:17,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:17,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:17,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-08 23:59:17,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-08 23:59:17,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:17,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-08 23:59:18,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:18,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944259536] [2025-01-08 23:59:18,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944259536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:18,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:18,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:59:18,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718098893] [2025-01-08 23:59:18,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:18,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:18,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:18,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:18,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:18,192 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:18,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:18,834 INFO L93 Difference]: Finished difference Result 1074 states and 1656 transitions. [2025-01-08 23:59:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:18,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 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 186 [2025-01-08 23:59:18,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:18,836 INFO L225 Difference]: With dead ends: 1074 [2025-01-08 23:59:18,837 INFO L226 Difference]: Without dead ends: 716 [2025-01-08 23:59:18,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:18,842 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:18,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:59:18,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-08 23:59:18,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-01-08 23:59:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.353846153846154) internal successors, (968), 715 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2025-01-08 23:59:18,871 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 186 [2025-01-08 23:59:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:18,871 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2025-01-08 23:59:18,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2025-01-08 23:59:18,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-08 23:59:18,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:18,876 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:18,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:59:18,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:18,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:18,877 INFO L85 PathProgramCache]: Analyzing trace with hash 686303822, now seen corresponding path program 1 times [2025-01-08 23:59:18,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:18,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533557053] [2025-01-08 23:59:18,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:18,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:18,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-08 23:59:18,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-08 23:59:18,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:18,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 23:59:19,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:19,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533557053] [2025-01-08 23:59:19,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533557053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:19,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:19,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:19,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170355938] [2025-01-08 23:59:19,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:19,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:19,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:19,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:19,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:19,140 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:19,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:19,915 INFO L93 Difference]: Finished difference Result 1637 states and 2268 transitions. [2025-01-08 23:59:19,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:19,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 209 [2025-01-08 23:59:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:19,923 INFO L225 Difference]: With dead ends: 1637 [2025-01-08 23:59:19,923 INFO L226 Difference]: Without dead ends: 1072 [2025-01-08 23:59:19,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:19,926 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 101 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:19,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 114 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:59:19,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-01-08 23:59:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 894. [2025-01-08 23:59:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.1724524076147815) internal successors, (1047), 893 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1047 transitions. [2025-01-08 23:59:19,943 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1047 transitions. Word has length 209 [2025-01-08 23:59:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:19,943 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1047 transitions. [2025-01-08 23:59:19,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1047 transitions. [2025-01-08 23:59:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-01-08 23:59:19,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:19,948 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:19,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:59:19,948 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:19,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:19,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1439565400, now seen corresponding path program 1 times [2025-01-08 23:59:19,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:19,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330537547] [2025-01-08 23:59:19,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:19,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:19,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-08 23:59:20,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-08 23:59:20,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:20,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 171 proven. 130 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-01-08 23:59:20,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:20,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330537547] [2025-01-08 23:59:20,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330537547] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:20,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266710768] [2025-01-08 23:59:20,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:20,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:20,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:20,597 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-01-08 23:59:20,599 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-01-08 23:59:20,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-08 23:59:20,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-08 23:59:20,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:20,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:20,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:59:20,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2025-01-08 23:59:20,803 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266710768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:20,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:20,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:59:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916279355] [2025-01-08 23:59:20,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:20,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:20,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:20,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:20,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:20,804 INFO L87 Difference]: Start difference. First operand 894 states and 1047 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:21,257 INFO L93 Difference]: Finished difference Result 2320 states and 2778 transitions. [2025-01-08 23:59:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:21,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 340 [2025-01-08 23:59:21,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:21,264 INFO L225 Difference]: With dead ends: 2320 [2025-01-08 23:59:21,264 INFO L226 Difference]: Without dead ends: 1606 [2025-01-08 23:59:21,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:21,267 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 143 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:21,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 265 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-01-08 23:59:21,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2025-01-08 23:59:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.1401541695865451) internal successors, (1627), 1427 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:21,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1627 transitions. [2025-01-08 23:59:21,303 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1627 transitions. Word has length 340 [2025-01-08 23:59:21,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:21,304 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1627 transitions. [2025-01-08 23:59:21,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1627 transitions. [2025-01-08 23:59:21,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-01-08 23:59:21,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:21,308 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:21,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 23:59:21,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:21,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:21,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:21,509 INFO L85 PathProgramCache]: Analyzing trace with hash 765319033, now seen corresponding path program 1 times [2025-01-08 23:59:21,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:21,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914715004] [2025-01-08 23:59:21,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:21,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:21,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-01-08 23:59:21,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-01-08 23:59:21,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:21,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 431 proven. 130 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-01-08 23:59:22,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:22,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914715004] [2025-01-08 23:59:22,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914715004] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:22,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063980961] [2025-01-08 23:59:22,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:22,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:22,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:22,120 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-01-08 23:59:22,124 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-01-08 23:59:22,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-01-08 23:59:22,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-01-08 23:59:22,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:22,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:22,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:59:22,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-08 23:59:22,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:22,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063980961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:22,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:22,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-08 23:59:22,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909862166] [2025-01-08 23:59:22,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:22,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:22,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:22,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:22,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:22,552 INFO L87 Difference]: Start difference. First operand 1428 states and 1627 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:22,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:22,928 INFO L93 Difference]: Finished difference Result 3210 states and 3663 transitions. [2025-01-08 23:59:22,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:22,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 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 439 [2025-01-08 23:59:22,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:22,934 INFO L225 Difference]: With dead ends: 3210 [2025-01-08 23:59:22,934 INFO L226 Difference]: Without dead ends: 1962 [2025-01-08 23:59:22,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:22,936 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 78 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:22,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 55 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:22,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-01-08 23:59:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2025-01-08 23:59:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.135165451486259) internal successors, (2024), 1783 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2024 transitions. [2025-01-08 23:59:22,959 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2024 transitions. Word has length 439 [2025-01-08 23:59:22,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:22,960 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2024 transitions. [2025-01-08 23:59:22,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2024 transitions. [2025-01-08 23:59:22,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-01-08 23:59:22,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:22,965 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:22,973 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-01-08 23:59:23,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:23,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:23,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash 48059245, now seen corresponding path program 1 times [2025-01-08 23:59:23,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:23,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184893340] [2025-01-08 23:59:23,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:23,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-08 23:59:23,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-08 23:59:23,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:23,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-08 23:59:23,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:23,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184893340] [2025-01-08 23:59:23,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184893340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:23,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:23,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:23,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965477461] [2025-01-08 23:59:23,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:23,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:23,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:23,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:23,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:23,528 INFO L87 Difference]: Start difference. First operand 1784 states and 2024 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:23,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:23,976 INFO L93 Difference]: Finished difference Result 4100 states and 4760 transitions. [2025-01-08 23:59:23,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:23,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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 506 [2025-01-08 23:59:23,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:23,983 INFO L225 Difference]: With dead ends: 4100 [2025-01-08 23:59:23,983 INFO L226 Difference]: Without dead ends: 2496 [2025-01-08 23:59:23,985 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-01-08 23:59:23,985 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:23,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-01-08 23:59:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2318. [2025-01-08 23:59:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.1419939577039275) internal successors, (2646), 2317 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2646 transitions. [2025-01-08 23:59:24,013 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2646 transitions. Word has length 506 [2025-01-08 23:59:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:24,014 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2646 transitions. [2025-01-08 23:59:24,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2646 transitions. [2025-01-08 23:59:24,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-01-08 23:59:24,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:24,019 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:24,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:59:24,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:24,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:24,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1979296508, now seen corresponding path program 1 times [2025-01-08 23:59:24,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:24,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280387793] [2025-01-08 23:59:24,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:24,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:24,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-01-08 23:59:24,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-01-08 23:59:24,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:24,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 755 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2025-01-08 23:59:24,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:24,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280387793] [2025-01-08 23:59:24,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280387793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:24,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:24,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:24,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424469594] [2025-01-08 23:59:24,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:24,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:24,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:24,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:24,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:24,366 INFO L87 Difference]: Start difference. First operand 2318 states and 2646 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:24,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:24,792 INFO L93 Difference]: Finished difference Result 4456 states and 5111 transitions. [2025-01-08 23:59:24,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:24,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 508 [2025-01-08 23:59:24,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:24,798 INFO L225 Difference]: With dead ends: 4456 [2025-01-08 23:59:24,799 INFO L226 Difference]: Without dead ends: 2318 [2025-01-08 23:59:24,800 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-01-08 23:59:24,800 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:24,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 77 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-01-08 23:59:24,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2025-01-08 23:59:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.1309022907900887) internal successors, (2419), 2139 states have internal predecessors, (2419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2419 transitions. [2025-01-08 23:59:24,827 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2419 transitions. Word has length 508 [2025-01-08 23:59:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:24,827 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2419 transitions. [2025-01-08 23:59:24,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2419 transitions. [2025-01-08 23:59:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-08 23:59:24,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:24,833 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:24,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:59:24,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:24,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash -301647131, now seen corresponding path program 1 times [2025-01-08 23:59:24,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:24,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317872715] [2025-01-08 23:59:24,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:24,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:24,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-08 23:59:24,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-08 23:59:24,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:24,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 698 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2025-01-08 23:59:25,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:25,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317872715] [2025-01-08 23:59:25,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317872715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:25,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:25,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:25,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864946192] [2025-01-08 23:59:25,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:25,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:25,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:25,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:25,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:25,086 INFO L87 Difference]: Start difference. First operand 2140 states and 2419 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:25,580 INFO L93 Difference]: Finished difference Result 4307 states and 4880 transitions. [2025-01-08 23:59:25,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:25,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 519 [2025-01-08 23:59:25,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:25,587 INFO L225 Difference]: With dead ends: 4307 [2025-01-08 23:59:25,587 INFO L226 Difference]: Without dead ends: 2318 [2025-01-08 23:59:25,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:25,589 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:25,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 17 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:25,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-01-08 23:59:25,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2025-01-08 23:59:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.0920991117344554) internal successors, (2336), 2139 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2336 transitions. [2025-01-08 23:59:25,615 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2336 transitions. Word has length 519 [2025-01-08 23:59:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:25,615 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2336 transitions. [2025-01-08 23:59:25,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2336 transitions. [2025-01-08 23:59:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-01-08 23:59:25,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:25,618 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:59:25,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:59:25,619 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:25,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1851441321, now seen corresponding path program 1 times [2025-01-08 23:59:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:25,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952997339] [2025-01-08 23:59:25,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:25,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-08 23:59:25,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-08 23:59:25,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:25,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 550 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-01-08 23:59:25,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:25,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952997339] [2025-01-08 23:59:25,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952997339] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:25,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246530549] [2025-01-08 23:59:25,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:25,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:25,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:25,962 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-01-08 23:59:25,965 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-01-08 23:59:26,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-08 23:59:26,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-08 23:59:26,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:26,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:26,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:59:26,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-01-08 23:59:26,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:26,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246530549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:26,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:26,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:59:26,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747683335] [2025-01-08 23:59:26,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:26,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:26,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:26,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:26,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:26,573 INFO L87 Difference]: Start difference. First operand 2140 states and 2336 transitions. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:27,141 INFO L93 Difference]: Finished difference Result 4634 states and 5080 transitions. [2025-01-08 23:59:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:27,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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 530 [2025-01-08 23:59:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:27,149 INFO L225 Difference]: With dead ends: 4634 [2025-01-08 23:59:27,149 INFO L226 Difference]: Without dead ends: 2496 [2025-01-08 23:59:27,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:27,153 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:27,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 46 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:27,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-01-08 23:59:27,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2318. [2025-01-08 23:59:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.0889080707811825) internal successors, (2523), 2317 states have internal predecessors, (2523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2523 transitions. [2025-01-08 23:59:27,179 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2523 transitions. Word has length 530 [2025-01-08 23:59:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:27,179 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2523 transitions. [2025-01-08 23:59:27,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2523 transitions. [2025-01-08 23:59:27,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2025-01-08 23:59:27,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:27,183 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:59:27,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 23:59:27,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:27,384 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:27,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:27,384 INFO L85 PathProgramCache]: Analyzing trace with hash 849774968, now seen corresponding path program 1 times [2025-01-08 23:59:27,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:27,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026918971] [2025-01-08 23:59:27,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:27,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:27,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 619 statements into 1 equivalence classes. [2025-01-08 23:59:27,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 619 of 619 statements. [2025-01-08 23:59:27,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:27,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 700 proven. 93 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-08 23:59:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026918971] [2025-01-08 23:59:27,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026918971] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764033570] [2025-01-08 23:59:27,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:27,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:27,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:27,751 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-01-08 23:59:27,752 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-01-08 23:59:27,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 619 statements into 1 equivalence classes. [2025-01-08 23:59:27,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 619 of 619 statements. [2025-01-08 23:59:27,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:27,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:27,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:59:27,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-08 23:59:28,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:28,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764033570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:28,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:28,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:59:28,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749603947] [2025-01-08 23:59:28,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:28,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:28,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:28,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:28,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:28,208 INFO L87 Difference]: Start difference. First operand 2318 states and 2523 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:28,855 INFO L93 Difference]: Finished difference Result 5346 states and 5870 transitions. [2025-01-08 23:59:28,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:28,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 619 [2025-01-08 23:59:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:28,864 INFO L225 Difference]: With dead ends: 5346 [2025-01-08 23:59:28,864 INFO L226 Difference]: Without dead ends: 3208 [2025-01-08 23:59:28,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:28,866 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:28,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 50 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:59:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2025-01-08 23:59:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3208. [2025-01-08 23:59:28,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3207 states have (on average 1.084502650452136) internal successors, (3478), 3207 states have internal predecessors, (3478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3478 transitions. [2025-01-08 23:59:28,899 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3478 transitions. Word has length 619 [2025-01-08 23:59:28,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:28,900 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 3478 transitions. [2025-01-08 23:59:28,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3478 transitions. [2025-01-08 23:59:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2025-01-08 23:59:28,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:28,904 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:28,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 23:59:29,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-08 23:59:29,105 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:29,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:29,107 INFO L85 PathProgramCache]: Analyzing trace with hash -666006969, now seen corresponding path program 1 times [2025-01-08 23:59:29,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:29,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814306197] [2025-01-08 23:59:29,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:29,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:29,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 621 statements into 1 equivalence classes. [2025-01-08 23:59:29,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 621 of 621 statements. [2025-01-08 23:59:29,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:29,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 1050 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-01-08 23:59:29,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:29,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814306197] [2025-01-08 23:59:29,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814306197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:29,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:29,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:29,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765499183] [2025-01-08 23:59:29,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:29,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:29,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:29,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:29,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:29,384 INFO L87 Difference]: Start difference. First operand 3208 states and 3478 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:29,745 INFO L93 Difference]: Finished difference Result 6414 states and 6978 transitions. [2025-01-08 23:59:29,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:29,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 621 [2025-01-08 23:59:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:29,752 INFO L225 Difference]: With dead ends: 6414 [2025-01-08 23:59:29,752 INFO L226 Difference]: Without dead ends: 3386 [2025-01-08 23:59:29,754 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-01-08 23:59:29,754 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:29,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 240 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:59:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2025-01-08 23:59:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3030. [2025-01-08 23:59:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3030 states, 3029 states have (on average 1.0831957741828986) internal successors, (3281), 3029 states have internal predecessors, (3281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3281 transitions. [2025-01-08 23:59:29,781 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3281 transitions. Word has length 621 [2025-01-08 23:59:29,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:29,782 INFO L471 AbstractCegarLoop]: Abstraction has 3030 states and 3281 transitions. [2025-01-08 23:59:29,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3281 transitions. [2025-01-08 23:59:29,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2025-01-08 23:59:29,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:29,786 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:29,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:59:29,787 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:29,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:29,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1254362890, now seen corresponding path program 1 times [2025-01-08 23:59:29,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:29,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427049501] [2025-01-08 23:59:29,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:29,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:29,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 774 statements into 1 equivalence classes. [2025-01-08 23:59:29,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 774 of 774 statements. [2025-01-08 23:59:29,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:29,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 1234 proven. 155 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-08 23:59:30,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:30,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427049501] [2025-01-08 23:59:30,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427049501] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:30,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192339734] [2025-01-08 23:59:30,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:30,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:30,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:30,078 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:59:30,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 23:59:30,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 774 statements into 1 equivalence classes. [2025-01-08 23:59:30,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 774 of 774 statements. [2025-01-08 23:59:30,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:30,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:30,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:59:30,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 1234 proven. 155 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-08 23:59:30,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:59:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 1234 proven. 155 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-08 23:59:30,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192339734] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:59:30,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:59:30,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-08 23:59:30,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419840971] [2025-01-08 23:59:30,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:59:30,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 23:59:30,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:30,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 23:59:30,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:30,825 INFO L87 Difference]: Start difference. First operand 3030 states and 3281 transitions. Second operand has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:31,677 INFO L93 Difference]: Finished difference Result 7660 states and 8367 transitions. [2025-01-08 23:59:31,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:59:31,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 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 774 [2025-01-08 23:59:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:31,692 INFO L225 Difference]: With dead ends: 7660 [2025-01-08 23:59:31,692 INFO L226 Difference]: Without dead ends: 4810 [2025-01-08 23:59:31,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1550 GetRequests, 1546 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:31,696 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 78 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:31,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 56 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:59:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-01-08 23:59:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3920. [2025-01-08 23:59:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3919 states have (on average 1.0908394998724165) internal successors, (4275), 3919 states have internal predecessors, (4275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4275 transitions. [2025-01-08 23:59:31,745 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4275 transitions. Word has length 774 [2025-01-08 23:59:31,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:31,745 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 4275 transitions. [2025-01-08 23:59:31,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4275 transitions. [2025-01-08 23:59:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 777 [2025-01-08 23:59:31,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:31,755 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:31,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 23:59:31,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-08 23:59:31,956 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:31,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:31,957 INFO L85 PathProgramCache]: Analyzing trace with hash 187107909, now seen corresponding path program 1 times [2025-01-08 23:59:31,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:31,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220521879] [2025-01-08 23:59:31,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:31,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:32,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 776 statements into 1 equivalence classes. [2025-01-08 23:59:32,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 776 of 776 statements. [2025-01-08 23:59:32,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:32,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2136 backedges. 1345 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2025-01-08 23:59:32,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:32,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220521879] [2025-01-08 23:59:32,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220521879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:32,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:32,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:32,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525636325] [2025-01-08 23:59:32,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:32,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:32,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:32,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:32,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:32,356 INFO L87 Difference]: Start difference. First operand 3920 states and 4275 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:32,762 INFO L93 Difference]: Finished difference Result 8550 states and 9390 transitions. [2025-01-08 23:59:32,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:32,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 776 [2025-01-08 23:59:32,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:32,782 INFO L225 Difference]: With dead ends: 8550 [2025-01-08 23:59:32,783 INFO L226 Difference]: Without dead ends: 4810 [2025-01-08 23:59:32,787 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-01-08 23:59:32,787 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:32,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 240 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:32,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-01-08 23:59:32,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4454. [2025-01-08 23:59:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0759038850213338) internal successors, (4791), 4453 states have internal predecessors, (4791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4791 transitions. [2025-01-08 23:59:32,827 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4791 transitions. Word has length 776 [2025-01-08 23:59:32,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:32,827 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4791 transitions. [2025-01-08 23:59:32,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4791 transitions. [2025-01-08 23:59:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2025-01-08 23:59:32,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:32,833 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:32,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:59:32,833 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:32,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:32,834 INFO L85 PathProgramCache]: Analyzing trace with hash -511963150, now seen corresponding path program 1 times [2025-01-08 23:59:32,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:32,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874223360] [2025-01-08 23:59:32,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:32,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:32,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-01-08 23:59:32,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-01-08 23:59:32,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:32,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2136 backedges. 1494 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2025-01-08 23:59:33,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:33,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874223360] [2025-01-08 23:59:33,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874223360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:33,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:33,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:33,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158703504] [2025-01-08 23:59:33,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:33,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:33,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:33,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:33,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:33,177 INFO L87 Difference]: Start difference. First operand 4454 states and 4791 transitions. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:33,534 INFO L93 Difference]: Finished difference Result 9262 states and 9952 transitions. [2025-01-08 23:59:33,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:33,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 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 794 [2025-01-08 23:59:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:33,542 INFO L225 Difference]: With dead ends: 9262 [2025-01-08 23:59:33,542 INFO L226 Difference]: Without dead ends: 4988 [2025-01-08 23:59:33,545 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-01-08 23:59:33,545 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:33,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 64 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:59:33,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-01-08 23:59:33,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4810. [2025-01-08 23:59:33,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0731960906633395) internal successors, (5161), 4809 states have internal predecessors, (5161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5161 transitions. [2025-01-08 23:59:33,577 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5161 transitions. Word has length 794 [2025-01-08 23:59:33,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:33,577 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 5161 transitions. [2025-01-08 23:59:33,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5161 transitions. [2025-01-08 23:59:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2025-01-08 23:59:33,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:33,583 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:33,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:59:33,584 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:33,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:33,584 INFO L85 PathProgramCache]: Analyzing trace with hash -124594409, now seen corresponding path program 1 times [2025-01-08 23:59:33,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:33,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376906321] [2025-01-08 23:59:33,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:33,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:33,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 871 statements into 1 equivalence classes. [2025-01-08 23:59:33,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 871 of 871 statements. [2025-01-08 23:59:33,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:33,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2702 backedges. 1604 proven. 0 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2025-01-08 23:59:33,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:33,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376906321] [2025-01-08 23:59:33,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376906321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:33,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:33,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:33,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20935637] [2025-01-08 23:59:33,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:33,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:33,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:33,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:33,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:33,954 INFO L87 Difference]: Start difference. First operand 4810 states and 5161 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 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-01-08 23:59:34,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:34,380 INFO L93 Difference]: Finished difference Result 10330 states and 11156 transitions. [2025-01-08 23:59:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:34,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 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) Word has length 871 [2025-01-08 23:59:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:34,390 INFO L225 Difference]: With dead ends: 10330 [2025-01-08 23:59:34,390 INFO L226 Difference]: Without dead ends: 5700 [2025-01-08 23:59:34,392 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-01-08 23:59:34,393 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:34,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 225 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:34,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2025-01-08 23:59:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 4988. [2025-01-08 23:59:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4987 states have (on average 1.0721876879887708) internal successors, (5347), 4987 states have internal predecessors, (5347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5347 transitions. [2025-01-08 23:59:34,441 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5347 transitions. Word has length 871 [2025-01-08 23:59:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:34,441 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 5347 transitions. [2025-01-08 23:59:34,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 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-01-08 23:59:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5347 transitions. [2025-01-08 23:59:34,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 942 [2025-01-08 23:59:34,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:34,447 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:34,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:59:34,447 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:34,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:34,448 INFO L85 PathProgramCache]: Analyzing trace with hash -685371448, now seen corresponding path program 1 times [2025-01-08 23:59:34,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:34,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566627449] [2025-01-08 23:59:34,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:34,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:34,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 941 statements into 1 equivalence classes. [2025-01-08 23:59:34,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 941 of 941 statements. [2025-01-08 23:59:34,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:34,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1777 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-01-08 23:59:35,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:35,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566627449] [2025-01-08 23:59:35,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566627449] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:35,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38842462] [2025-01-08 23:59:35,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:35,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:35,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:35,282 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:59:35,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 23:59:35,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 941 statements into 1 equivalence classes. [2025-01-08 23:59:35,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 941 of 941 statements. [2025-01-08 23:59:35,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:35,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:35,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 23:59:35,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1777 proven. 625 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2025-01-08 23:59:36,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:59:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1849 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-01-08 23:59:36,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38842462] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:36,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 23:59:36,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-01-08 23:59:36,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091882709] [2025-01-08 23:59:36,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:36,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:59:36,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:36,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:59:36,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:59:36,469 INFO L87 Difference]: Start difference. First operand 4988 states and 5347 transitions. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:36,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:36,935 INFO L93 Difference]: Finished difference Result 10508 states and 11292 transitions. [2025-01-08 23:59:36,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:36,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 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 941 [2025-01-08 23:59:36,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:36,942 INFO L225 Difference]: With dead ends: 10508 [2025-01-08 23:59:36,942 INFO L226 Difference]: Without dead ends: 5700 [2025-01-08 23:59:36,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1885 GetRequests, 1877 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:59:36,946 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 158 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:36,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 9 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:36,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2025-01-08 23:59:36,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5166. [2025-01-08 23:59:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5166 states, 5165 states have (on average 1.0735721200387223) internal successors, (5545), 5165 states have internal predecessors, (5545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5545 transitions. [2025-01-08 23:59:36,977 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5545 transitions. Word has length 941 [2025-01-08 23:59:36,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:36,977 INFO L471 AbstractCegarLoop]: Abstraction has 5166 states and 5545 transitions. [2025-01-08 23:59:36,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:36,977 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5545 transitions. [2025-01-08 23:59:36,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2025-01-08 23:59:36,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:36,983 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-01-08 23:59:36,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-08 23:59:37,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-08 23:59:37,184 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:37,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1356340669, now seen corresponding path program 1 times [2025-01-08 23:59:37,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:37,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471611159] [2025-01-08 23:59:37,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:37,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 963 statements into 1 equivalence classes. [2025-01-08 23:59:37,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 963 of 963 statements. [2025-01-08 23:59:37,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:37,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2950 backedges. 1423 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2025-01-08 23:59:37,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:37,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471611159] [2025-01-08 23:59:37,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471611159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:37,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:37,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:59:37,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468632701] [2025-01-08 23:59:37,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:37,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:59:37,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:37,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:59:37,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:37,748 INFO L87 Difference]: Start difference. First operand 5166 states and 5545 transitions. Second operand has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 6 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:38,275 INFO L93 Difference]: Finished difference Result 10124 states and 10869 transitions. [2025-01-08 23:59:38,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 23:59:38,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 6 states have internal predecessors, (355), 0 states have call successors, (0), 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 963 [2025-01-08 23:59:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:38,281 INFO L225 Difference]: With dead ends: 10124 [2025-01-08 23:59:38,281 INFO L226 Difference]: Without dead ends: 4988 [2025-01-08 23:59:38,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:38,285 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:38,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 28 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-01-08 23:59:38,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4810. [2025-01-08 23:59:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0603035974215014) internal successors, (5099), 4809 states have internal predecessors, (5099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5099 transitions. [2025-01-08 23:59:38,312 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5099 transitions. Word has length 963 [2025-01-08 23:59:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:38,312 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 5099 transitions. [2025-01-08 23:59:38,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 6 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5099 transitions. [2025-01-08 23:59:38,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1168 [2025-01-08 23:59:38,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:38,320 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:38,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:59:38,320 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:38,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash 117207227, now seen corresponding path program 1 times [2025-01-08 23:59:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:38,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410257349] [2025-01-08 23:59:38,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:38,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:38,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1167 statements into 1 equivalence classes. [2025-01-08 23:59:38,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1167 of 1167 statements. [2025-01-08 23:59:38,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:38,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4501 backedges. 1795 proven. 0 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2025-01-08 23:59:38,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:38,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410257349] [2025-01-08 23:59:38,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410257349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:38,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:38,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:38,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020874883] [2025-01-08 23:59:38,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:38,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:38,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:38,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:38,981 INFO L87 Difference]: Start difference. First operand 4810 states and 5099 transitions. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:39,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:39,421 INFO L93 Difference]: Finished difference Result 9284 states and 9845 transitions. [2025-01-08 23:59:39,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:39,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 1167 [2025-01-08 23:59:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:39,428 INFO L225 Difference]: With dead ends: 9284 [2025-01-08 23:59:39,428 INFO L226 Difference]: Without dead ends: 4632 [2025-01-08 23:59:39,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:39,431 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 40 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:39,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 17 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-01-08 23:59:39,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2025-01-08 23:59:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.0580868063053337) internal successors, (4900), 4631 states have internal predecessors, (4900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4900 transitions. [2025-01-08 23:59:39,462 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4900 transitions. Word has length 1167 [2025-01-08 23:59:39,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:39,462 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4900 transitions. [2025-01-08 23:59:39,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4900 transitions. [2025-01-08 23:59:39,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1186 [2025-01-08 23:59:39,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:39,472 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:39,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 23:59:39,472 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:39,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:39,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1465694163, now seen corresponding path program 1 times [2025-01-08 23:59:39,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:39,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566196506] [2025-01-08 23:59:39,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:39,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:39,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1185 statements into 1 equivalence classes. [2025-01-08 23:59:39,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1185 of 1185 statements. [2025-01-08 23:59:39,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:39,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4582 backedges. 3412 proven. 72 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2025-01-08 23:59:40,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:40,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566196506] [2025-01-08 23:59:40,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566196506] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:40,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194760652] [2025-01-08 23:59:40,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:40,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:40,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:40,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:59:40,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-08 23:59:40,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1185 statements into 1 equivalence classes. [2025-01-08 23:59:40,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1185 of 1185 statements. [2025-01-08 23:59:40,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:40,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:40,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 23:59:40,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4582 backedges. 3371 proven. 666 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2025-01-08 23:59:41,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:59:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4582 backedges. 3484 proven. 0 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2025-01-08 23:59:41,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194760652] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:41,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 23:59:41,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-01-08 23:59:41,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922680451] [2025-01-08 23:59:41,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:41,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:59:41,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:41,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:59:41,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:59:41,652 INFO L87 Difference]: Start difference. First operand 4632 states and 4900 transitions. Second operand has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:42,029 INFO L93 Difference]: Finished difference Result 9618 states and 10169 transitions. [2025-01-08 23:59:42,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:42,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1185 [2025-01-08 23:59:42,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:42,035 INFO L225 Difference]: With dead ends: 9618 [2025-01-08 23:59:42,035 INFO L226 Difference]: Without dead ends: 5166 [2025-01-08 23:59:42,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2373 GetRequests, 2366 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:59:42,038 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 79 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:42,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 9 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:42,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-01-08 23:59:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4810. [2025-01-08 23:59:42,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0557288417550426) internal successors, (5077), 4809 states have internal predecessors, (5077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5077 transitions. [2025-01-08 23:59:42,063 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5077 transitions. Word has length 1185 [2025-01-08 23:59:42,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:42,064 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 5077 transitions. [2025-01-08 23:59:42,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5077 transitions. [2025-01-08 23:59:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1356 [2025-01-08 23:59:42,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:42,073 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:42,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-08 23:59:42,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:42,274 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:42,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:42,275 INFO L85 PathProgramCache]: Analyzing trace with hash 198977497, now seen corresponding path program 1 times [2025-01-08 23:59:42,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:42,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917778540] [2025-01-08 23:59:42,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:42,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:42,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1355 statements into 1 equivalence classes. [2025-01-08 23:59:42,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1355 of 1355 statements. [2025-01-08 23:59:42,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:42,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5744 backedges. 3559 proven. 83 refuted. 0 times theorem prover too weak. 2102 trivial. 0 not checked. [2025-01-08 23:59:43,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:43,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917778540] [2025-01-08 23:59:43,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917778540] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:43,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709180477] [2025-01-08 23:59:43,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:43,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:43,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:43,306 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:59:43,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-08 23:59:43,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1355 statements into 1 equivalence classes. [2025-01-08 23:59:43,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1355 of 1355 statements. [2025-01-08 23:59:43,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:43,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:43,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 1642 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:59:43,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5744 backedges. 2942 proven. 0 refuted. 0 times theorem prover too weak. 2802 trivial. 0 not checked. [2025-01-08 23:59:43,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:43,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709180477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:43,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:43,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:59:43,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650838615] [2025-01-08 23:59:43,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:43,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:43,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:43,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:43,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:43,727 INFO L87 Difference]: Start difference. First operand 4810 states and 5077 transitions. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:44,070 INFO L93 Difference]: Finished difference Result 9618 states and 10162 transitions. [2025-01-08 23:59:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:44,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 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 1355 [2025-01-08 23:59:44,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:44,077 INFO L225 Difference]: With dead ends: 9618 [2025-01-08 23:59:44,077 INFO L226 Difference]: Without dead ends: 4988 [2025-01-08 23:59:44,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1359 GetRequests, 1354 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:44,081 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:44,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 55 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:59:44,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-01-08 23:59:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4988. [2025-01-08 23:59:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4987 states have (on average 1.0543412873471025) internal successors, (5258), 4987 states have internal predecessors, (5258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5258 transitions. [2025-01-08 23:59:44,152 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5258 transitions. Word has length 1355 [2025-01-08 23:59:44,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:44,152 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 5258 transitions. [2025-01-08 23:59:44,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:44,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5258 transitions. [2025-01-08 23:59:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1420 [2025-01-08 23:59:44,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:44,163 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:44,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-08 23:59:44,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:44,367 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:44,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:44,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1659526969, now seen corresponding path program 1 times [2025-01-08 23:59:44,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:44,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651287393] [2025-01-08 23:59:44,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:44,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:44,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1419 statements into 1 equivalence classes. [2025-01-08 23:59:44,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1419 of 1419 statements. [2025-01-08 23:59:44,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:44,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5936 backedges. 1420 proven. 2169 refuted. 0 times theorem prover too weak. 2347 trivial. 0 not checked. [2025-01-08 23:59:45,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:45,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651287393] [2025-01-08 23:59:45,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651287393] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:45,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880124903] [2025-01-08 23:59:45,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:45,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:45,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:45,815 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:59:45,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-08 23:59:45,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1419 statements into 1 equivalence classes. [2025-01-08 23:59:46,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1419 of 1419 statements. [2025-01-08 23:59:46,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:46,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:46,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 1708 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:59:46,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5936 backedges. 2139 proven. 0 refuted. 0 times theorem prover too weak. 3797 trivial. 0 not checked. [2025-01-08 23:59:47,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:47,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880124903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:47,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:47,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-08 23:59:47,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862922022] [2025-01-08 23:59:47,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:47,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:47,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:47,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:47,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-08 23:59:47,274 INFO L87 Difference]: Start difference. First operand 4988 states and 5258 transitions. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:47,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:47,830 INFO L93 Difference]: Finished difference Result 9796 states and 10335 transitions. [2025-01-08 23:59:47,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:47,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 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 1419 [2025-01-08 23:59:47,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:47,837 INFO L225 Difference]: With dead ends: 9796 [2025-01-08 23:59:47,838 INFO L226 Difference]: Without dead ends: 4988 [2025-01-08 23:59:47,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1425 GetRequests, 1417 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-08 23:59:47,841 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 91 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:47,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 17 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:47,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-01-08 23:59:47,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4810. [2025-01-08 23:59:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0517779164067373) internal successors, (5058), 4809 states have internal predecessors, (5058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5058 transitions. [2025-01-08 23:59:47,874 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5058 transitions. Word has length 1419 [2025-01-08 23:59:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:47,874 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 5058 transitions. [2025-01-08 23:59:47,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5058 transitions. [2025-01-08 23:59:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1473 [2025-01-08 23:59:47,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:47,885 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:47,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-08 23:59:48,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:48,087 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:48,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:48,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1690697003, now seen corresponding path program 1 times [2025-01-08 23:59:48,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:48,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130520699] [2025-01-08 23:59:48,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:48,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1472 statements into 1 equivalence classes. [2025-01-08 23:59:48,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1472 of 1472 statements. [2025-01-08 23:59:48,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:48,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6895 backedges. 5384 proven. 304 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2025-01-08 23:59:49,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:49,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130520699] [2025-01-08 23:59:49,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130520699] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:49,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431158445] [2025-01-08 23:59:49,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:49,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:49,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:49,574 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:59:49,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-08 23:59:49,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1472 statements into 1 equivalence classes. [2025-01-08 23:59:49,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1472 of 1472 statements. [2025-01-08 23:59:49,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:49,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:49,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 1781 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 23:59:49,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6895 backedges. 5059 proven. 716 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2025-01-08 23:59:50,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:59:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6895 backedges. 5222 proven. 0 refuted. 0 times theorem prover too weak. 1673 trivial. 0 not checked. [2025-01-08 23:59:50,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431158445] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:50,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 23:59:50,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 10 [2025-01-08 23:59:50,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229462833] [2025-01-08 23:59:50,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:50,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:59:50,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:50,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:59:50,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-08 23:59:50,955 INFO L87 Difference]: Start difference. First operand 4810 states and 5058 transitions. Second operand has 5 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:51,440 INFO L93 Difference]: Finished difference Result 9796 states and 10297 transitions. [2025-01-08 23:59:51,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:51,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 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 1472 [2025-01-08 23:59:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:51,447 INFO L225 Difference]: With dead ends: 9796 [2025-01-08 23:59:51,448 INFO L226 Difference]: Without dead ends: 5166 [2025-01-08 23:59:51,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2948 GetRequests, 2940 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-08 23:59:51,453 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:51,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 10 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-01-08 23:59:51,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4988. [2025-01-08 23:59:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4987 states have (on average 1.0493282534589934) internal successors, (5233), 4987 states have internal predecessors, (5233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5233 transitions. [2025-01-08 23:59:51,515 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5233 transitions. Word has length 1472 [2025-01-08 23:59:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:51,516 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 5233 transitions. [2025-01-08 23:59:51,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5233 transitions. [2025-01-08 23:59:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1728 [2025-01-08 23:59:51,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:51,529 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:51,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-08 23:59:51,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:51,730 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:51,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1076312065, now seen corresponding path program 1 times [2025-01-08 23:59:51,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:51,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227694884] [2025-01-08 23:59:51,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:51,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1727 statements into 1 equivalence classes. [2025-01-08 23:59:51,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1727 of 1727 statements. [2025-01-08 23:59:51,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:51,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9684 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 9181 trivial. 0 not checked. [2025-01-08 23:59:52,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:52,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227694884] [2025-01-08 23:59:52,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227694884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:52,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:52,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:52,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008376898] [2025-01-08 23:59:52,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:52,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:52,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:52,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:52,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:52,731 INFO L87 Difference]: Start difference. First operand 4988 states and 5233 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:53,174 INFO L93 Difference]: Finished difference Result 9806 states and 10279 transitions. [2025-01-08 23:59:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:53,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 1727 [2025-01-08 23:59:53,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:53,175 INFO L225 Difference]: With dead ends: 9806 [2025-01-08 23:59:53,175 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:59:53,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:53,179 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:53,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 15 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:59:53,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:59:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:59:53,180 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1727 [2025-01-08 23:59:53,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:53,180 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:59:53,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:59:53,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:59:53,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:59:53,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-08 23:59:53,185 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:53,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:59:53,570 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:59:53,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:59:53 BoogieIcfgContainer [2025-01-08 23:59:53,582 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:59:53,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:59:53,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:59:53,583 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:59:53,583 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:59:16" (3/4) ... [2025-01-08 23:59:53,584 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:59:53,602 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:59:53,603 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:59:53,603 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:59:53,604 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:59:53,707 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:59:53,707 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:59:53,707 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:59:53,708 INFO L158 Benchmark]: Toolchain (without parser) took 39022.01ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 103.0MB in the beginning and 196.1MB in the end (delta: -93.1MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2025-01-08 23:59:53,708 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:59:53,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.06ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 71.4MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-08 23:59:53,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.04ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 62.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:59:53,709 INFO L158 Benchmark]: Boogie Preprocessor took 104.28ms. Allocated memory is still 142.6MB. Free memory was 62.3MB in the beginning and 50.0MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:59:53,709 INFO L158 Benchmark]: RCFGBuilder took 993.89ms. Allocated memory is still 142.6MB. Free memory was 50.0MB in the beginning and 63.1MB in the end (delta: -13.1MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2025-01-08 23:59:53,709 INFO L158 Benchmark]: TraceAbstraction took 37284.15ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 63.1MB in the beginning and 212.5MB in the end (delta: -149.4MB). Peak memory consumption was 187.0MB. Max. memory is 16.1GB. [2025-01-08 23:59:53,709 INFO L158 Benchmark]: Witness Printer took 125.21ms. Allocated memory is still 310.4MB. Free memory was 212.5MB in the beginning and 196.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:59:53,710 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.06ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 71.4MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.04ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 62.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.28ms. Allocated memory is still 142.6MB. Free memory was 62.3MB in the beginning and 50.0MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 993.89ms. Allocated memory is still 142.6MB. Free memory was 50.0MB in the beginning and 63.1MB in the end (delta: -13.1MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * TraceAbstraction took 37284.15ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 63.1MB in the beginning and 212.5MB in the end (delta: -149.4MB). Peak memory consumption was 187.0MB. Max. memory is 16.1GB. * Witness Printer took 125.21ms. Allocated memory is still 310.4MB. Free memory was 212.5MB in the beginning and 196.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 128]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.8s, OverallIterations: 23, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2310 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2310 mSDsluCounter, 1775 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 1636 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13106 IncrementalHoareTripleChecker+Invalid, 14742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1636 mSolverCounterUnsat, 1628 mSDtfsCounter, 13106 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13524 GetRequests, 13442 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5166occurred in iteration=16, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 5162 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 27033 NumberOfCodeBlocks, 27033 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 31368 ConstructedInterpolants, 0 QuantifiedInterpolants, 86796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 11182 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 37 InterpolantComputations, 22 PerfectInterpolantSequences, 100452/106000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((((((((((((long long) a12 + 43) <= 0) && (a24 == 1)) || (((a21 == 8) && (a24 == 1)) && (a12 <= 600006))) || (((a24 == 1) && (a21 == 9)) && (a12 <= 600006))) || ((((a24 == 1) && (5 == a15)) && (a21 == 6)) && (a12 <= 600129))) || (((a24 == 1) && (a21 <= 6)) && (a12 <= 600006))) || (((((long long) a12 + 43) <= 0) && (a15 <= 8)) && (a21 <= 6))) || (((a12 <= 80) && (a24 == 1)) && (7 == a21))) || (((a24 == 1) && (7 != a15)) && (a12 <= 600006))) || ((((a24 == 1) && (a12 <= 600006)) && (a21 == 10)) && (81 <= a12))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:59:53,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE