./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label45.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_label45.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 d284e8efd4e45ee6ae258c3b376fc8f91ce52940016142658227b0ca393b3ff2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:59:01,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:59:01,358 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:01,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:59:01,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:59:01,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:59:01,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:59:01,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:59:01,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:59:01,392 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:59:01,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:59:01,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:59:01,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:59:01,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:59:01,392 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:59:01,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:59:01,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:59:01,393 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:59:01,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:59:01,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:59:01,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:59:01,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:59:01,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:59:01,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:59:01,393 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:59:01,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:59:01,393 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:59:01,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:59:01,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:59:01,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:59:01,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:59:01,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:59:01,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:59:01,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:59:01,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:59:01,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:59:01,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:59:01,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:59:01,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:59:01,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:59:01,395 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:59:01,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:59:01,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:59:01,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:59:01,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:59:01,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:59:01,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:59:01,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:59:01,395 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 -> d284e8efd4e45ee6ae258c3b376fc8f91ce52940016142658227b0ca393b3ff2 [2025-01-08 23:59:01,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:59:01,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:59:01,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:59:01,672 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:59:01,672 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:59:01,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label45.c [2025-01-08 23:59:02,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcf0d8b9f/a630081611d3420fa6e85c626cd56ed1/FLAG57dceb078 [2025-01-08 23:59:03,173 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:59:03,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label45.c [2025-01-08 23:59:03,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcf0d8b9f/a630081611d3420fa6e85c626cd56ed1/FLAG57dceb078 [2025-01-08 23:59:03,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcf0d8b9f/a630081611d3420fa6e85c626cd56ed1 [2025-01-08 23:59:03,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:59:03,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:59:03,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:59:03,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:59:03,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:59:03,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:59:03" (1/1) ... [2025-01-08 23:59:03,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32bad907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:03, skipping insertion in model container [2025-01-08 23:59:03,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:59:03" (1/1) ... [2025-01-08 23:59:03,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:59:03,631 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_label45.c[3828,3841] [2025-01-08 23:59:03,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:59:03,802 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:59:03,815 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_label45.c[3828,3841] [2025-01-08 23:59:03,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:59:03,880 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:59:03,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:03 WrapperNode [2025-01-08 23:59:03,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:59:03,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:59:03,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:59:03,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:59:03,885 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:03" (1/1) ... [2025-01-08 23:59:03,896 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:03" (1/1) ... [2025-01-08 23:59:03,935 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-01-08 23:59:03,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:59:03,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:59:03,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:59:03,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:59:03,942 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:03" (1/1) ... [2025-01-08 23:59:03,943 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:03" (1/1) ... [2025-01-08 23:59:03,950 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:03" (1/1) ... [2025-01-08 23:59:03,971 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:03,972 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:03" (1/1) ... [2025-01-08 23:59:03,972 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:03" (1/1) ... [2025-01-08 23:59:03,988 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:03" (1/1) ... [2025-01-08 23:59:03,989 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:03" (1/1) ... [2025-01-08 23:59:03,994 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:03" (1/1) ... [2025-01-08 23:59:03,997 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:03" (1/1) ... [2025-01-08 23:59:03,999 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:03" (1/1) ... [2025-01-08 23:59:04,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:59:04,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:59:04,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:59:04,015 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:59:04,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:03" (1/1) ... [2025-01-08 23:59:04,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:59:04,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:04,040 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:04,044 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:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:59:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:59:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:59:04,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:59:04,095 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:59:04,097 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:59:05,004 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-01-08 23:59:05,005 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:59:05,014 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:59:05,014 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:59:05,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:59:05 BoogieIcfgContainer [2025-01-08 23:59:05,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:59:05,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:59:05,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:59:05,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:59:05,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:59:03" (1/3) ... [2025-01-08 23:59:05,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3db2ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:59:05, skipping insertion in model container [2025-01-08 23:59:05,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:03" (2/3) ... [2025-01-08 23:59:05,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3db2ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:59:05, skipping insertion in model container [2025-01-08 23:59:05,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:59:05" (3/3) ... [2025-01-08 23:59:05,023 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label45.c [2025-01-08 23:59:05,034 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:59:05,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label45.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:59:05,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:59:05,093 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;@7367a0dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:59:05,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:59:05,098 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:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-08 23:59:05,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:05,103 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] [2025-01-08 23:59:05,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:05,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:05,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1973461954, now seen corresponding path program 1 times [2025-01-08 23:59:05,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:05,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198748686] [2025-01-08 23:59:05,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:05,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:05,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-08 23:59:05,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-08 23:59:05,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:05,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:05,373 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:05,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:05,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198748686] [2025-01-08 23:59:05,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198748686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:05,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:05,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:59:05,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467693928] [2025-01-08 23:59:05,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:05,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:05,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:05,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:05,410 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 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:06,267 INFO L93 Difference]: Finished difference Result 685 states and 1213 transitions. [2025-01-08 23:59:06,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:06,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-01-08 23:59:06,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:06,278 INFO L225 Difference]: With dead ends: 685 [2025-01-08 23:59:06,279 INFO L226 Difference]: Without dead ends: 360 [2025-01-08 23:59:06,284 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:06,286 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:06,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 139 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:59:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-08 23:59:06,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-01-08 23:59:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.4206128133704736) internal successors, (510), 359 states have internal predecessors, (510), 0 states have call successors, (0), 0 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:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2025-01-08 23:59:06,322 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 36 [2025-01-08 23:59:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:06,322 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2025-01-08 23:59:06,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2025-01-08 23:59:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-08 23:59:06,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:06,325 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:59:06,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:06,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash -2073662416, now seen corresponding path program 1 times [2025-01-08 23:59:06,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:06,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850448953] [2025-01-08 23:59:06,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:06,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:06,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-08 23:59:06,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-08 23:59:06,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:06,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:59:06,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:06,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850448953] [2025-01-08 23:59:06,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850448953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:06,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:06,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:06,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456226651] [2025-01-08 23:59:06,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:06,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:06,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:06,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:06,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:06,726 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:07,596 INFO L93 Difference]: Finished difference Result 1074 states and 1446 transitions. [2025-01-08 23:59:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:07,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-01-08 23:59:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:07,600 INFO L225 Difference]: With dead ends: 1074 [2025-01-08 23:59:07,601 INFO L226 Difference]: Without dead ends: 716 [2025-01-08 23:59:07,602 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:07,604 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 434 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:07,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 122 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:59:07,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-08 23:59:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-01-08 23:59:07,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.26993006993007) internal successors, (908), 715 states have internal predecessors, (908), 0 states have call successors, (0), 0 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:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 908 transitions. [2025-01-08 23:59:07,647 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 908 transitions. Word has length 115 [2025-01-08 23:59:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:07,647 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 908 transitions. [2025-01-08 23:59:07,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 908 transitions. [2025-01-08 23:59:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-08 23:59:07,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:07,656 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:59:07,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:59:07,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:07,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash 740399905, now seen corresponding path program 1 times [2025-01-08 23:59:07,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:07,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493955452] [2025-01-08 23:59:07,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:07,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:07,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-08 23:59:07,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-08 23:59:07,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:07,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 23:59:07,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:07,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493955452] [2025-01-08 23:59:07,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493955452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:07,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:07,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:59:07,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583341585] [2025-01-08 23:59:07,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:07,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:07,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:07,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:07,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:07,854 INFO L87 Difference]: Start difference. First operand 716 states and 908 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:08,356 INFO L93 Difference]: Finished difference Result 1430 states and 1917 transitions. [2025-01-08 23:59:08,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:08,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 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 181 [2025-01-08 23:59:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:08,359 INFO L225 Difference]: With dead ends: 1430 [2025-01-08 23:59:08,360 INFO L226 Difference]: Without dead ends: 894 [2025-01-08 23:59:08,360 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:08,361 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:08,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-01-08 23:59:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2025-01-08 23:59:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.257558790593505) internal successors, (1123), 893 states have internal predecessors, (1123), 0 states have call successors, (0), 0 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:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1123 transitions. [2025-01-08 23:59:08,375 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1123 transitions. Word has length 181 [2025-01-08 23:59:08,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:08,376 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1123 transitions. [2025-01-08 23:59:08,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1123 transitions. [2025-01-08 23:59:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-08 23:59:08,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:08,378 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:59:08,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:59:08,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:08,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:08,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1527616732, now seen corresponding path program 1 times [2025-01-08 23:59:08,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:08,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228981893] [2025-01-08 23:59:08,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:08,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:08,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-08 23:59:08,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-08 23:59:08,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:08,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 23:59:08,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:08,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228981893] [2025-01-08 23:59:08,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228981893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:08,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:08,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:08,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594914510] [2025-01-08 23:59:08,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:08,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:08,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:08,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:08,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:08,627 INFO L87 Difference]: Start difference. First operand 894 states and 1123 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 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:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:09,194 INFO L93 Difference]: Finished difference Result 1815 states and 2291 transitions. [2025-01-08 23:59:09,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:09,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 195 [2025-01-08 23:59:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:09,198 INFO L225 Difference]: With dead ends: 1815 [2025-01-08 23:59:09,199 INFO L226 Difference]: Without dead ends: 1072 [2025-01-08 23:59:09,200 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:09,202 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 110 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:09,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 113 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-01-08 23:59:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 894. [2025-01-08 23:59:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.1590145576707727) internal successors, (1035), 893 states have internal predecessors, (1035), 0 states have call successors, (0), 0 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:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1035 transitions. [2025-01-08 23:59:09,216 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1035 transitions. Word has length 195 [2025-01-08 23:59:09,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:09,217 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1035 transitions. [2025-01-08 23:59:09,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 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:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1035 transitions. [2025-01-08 23:59:09,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-08 23:59:09,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:09,219 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:59:09,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:59:09,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:09,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:09,219 INFO L85 PathProgramCache]: Analyzing trace with hash -682597724, now seen corresponding path program 1 times [2025-01-08 23:59:09,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:09,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994238092] [2025-01-08 23:59:09,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:09,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:09,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-08 23:59:09,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-08 23:59:09,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:09,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-01-08 23:59:09,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:09,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994238092] [2025-01-08 23:59:09,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994238092] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:09,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125046236] [2025-01-08 23:59:09,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:09,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:09,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:09,480 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:09,481 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:09,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-08 23:59:09,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-08 23:59:09,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:09,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:09,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:59:09,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-01-08 23:59:09,996 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:09,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125046236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:09,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:09,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 23:59:09,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858380483] [2025-01-08 23:59:09,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:09,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:09,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:09,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:09,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:59:09,998 INFO L87 Difference]: Start difference. First operand 894 states and 1035 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:10,563 INFO L93 Difference]: Finished difference Result 1430 states and 1635 transitions. [2025-01-08 23:59:10,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:10,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 247 [2025-01-08 23:59:10,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:10,569 INFO L225 Difference]: With dead ends: 1430 [2025-01-08 23:59:10,569 INFO L226 Difference]: Without dead ends: 1428 [2025-01-08 23:59:10,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:59:10,571 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 91 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:10,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 11 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:10,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-01-08 23:59:10,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1072. [2025-01-08 23:59:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.1661998132586369) internal successors, (1249), 1071 states have internal predecessors, (1249), 0 states have call successors, (0), 0 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:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1249 transitions. [2025-01-08 23:59:10,587 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1249 transitions. Word has length 247 [2025-01-08 23:59:10,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:10,588 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1249 transitions. [2025-01-08 23:59:10,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:10,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1249 transitions. [2025-01-08 23:59:10,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-01-08 23:59:10,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:10,590 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:10,597 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:10,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:10,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:10,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1427376775, now seen corresponding path program 1 times [2025-01-08 23:59:10,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:10,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929181489] [2025-01-08 23:59:10,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:10,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:10,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-01-08 23:59:10,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-01-08 23:59:10,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:10,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:59:11,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:11,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929181489] [2025-01-08 23:59:11,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929181489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:11,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:11,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:11,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177562446] [2025-01-08 23:59:11,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:11,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:11,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:11,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:11,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:11,056 INFO L87 Difference]: Start difference. First operand 1072 states and 1249 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:11,490 INFO L93 Difference]: Finished difference Result 2498 states and 3001 transitions. [2025-01-08 23:59:11,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:11,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2025-01-08 23:59:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:11,495 INFO L225 Difference]: With dead ends: 2498 [2025-01-08 23:59:11,495 INFO L226 Difference]: Without dead ends: 1606 [2025-01-08 23:59:11,496 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:11,497 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 112 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:11,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 76 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:11,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-01-08 23:59:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2025-01-08 23:59:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.142056074766355) internal successors, (1833), 1605 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1833 transitions. [2025-01-08 23:59:11,518 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1833 transitions. Word has length 316 [2025-01-08 23:59:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:11,518 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1833 transitions. [2025-01-08 23:59:11,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1833 transitions. [2025-01-08 23:59:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-08 23:59:11,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:11,521 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:11,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:59:11,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:11,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:11,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1918818768, now seen corresponding path program 1 times [2025-01-08 23:59:11,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:11,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316560056] [2025-01-08 23:59:11,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:11,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:11,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-08 23:59:11,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-08 23:59:11,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:11,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-01-08 23:59:11,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:11,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316560056] [2025-01-08 23:59:11,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316560056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:11,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:11,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:11,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454103254] [2025-01-08 23:59:11,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:11,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:11,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:11,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:11,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:11,774 INFO L87 Difference]: Start difference. First operand 1606 states and 1833 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:12,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:12,268 INFO L93 Difference]: Finished difference Result 3268 states and 3745 transitions. [2025-01-08 23:59:12,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:12,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 327 [2025-01-08 23:59:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:12,275 INFO L225 Difference]: With dead ends: 3268 [2025-01-08 23:59:12,275 INFO L226 Difference]: Without dead ends: 1784 [2025-01-08 23:59:12,276 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:12,277 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:12,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 17 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-01-08 23:59:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1606. [2025-01-08 23:59:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.0928348909657322) internal successors, (1754), 1605 states have internal predecessors, (1754), 0 states have call successors, (0), 0 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:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1754 transitions. [2025-01-08 23:59:12,301 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1754 transitions. Word has length 327 [2025-01-08 23:59:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:12,301 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1754 transitions. [2025-01-08 23:59:12,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1754 transitions. [2025-01-08 23:59:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-01-08 23:59:12,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:12,306 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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:12,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:59:12,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:12,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:12,307 INFO L85 PathProgramCache]: Analyzing trace with hash -134874941, now seen corresponding path program 1 times [2025-01-08 23:59:12,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:12,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794616373] [2025-01-08 23:59:12,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:12,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:12,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-08 23:59:12,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-08 23:59:12,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:12,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 286 proven. 23 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 23:59:12,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:12,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794616373] [2025-01-08 23:59:12,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794616373] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:12,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498669722] [2025-01-08 23:59:12,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:12,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:12,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:12,634 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:12,636 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:12,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-08 23:59:12,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-08 23:59:12,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:12,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:12,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:59:12,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-08 23:59:12,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:12,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498669722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:12,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:12,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:59:12,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885917050] [2025-01-08 23:59:12,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:12,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:12,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:12,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:12,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:12,809 INFO L87 Difference]: Start difference. First operand 1606 states and 1754 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 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:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:13,226 INFO L93 Difference]: Finished difference Result 3744 states and 4148 transitions. [2025-01-08 23:59:13,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:13,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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:13,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:13,232 INFO L225 Difference]: With dead ends: 3744 [2025-01-08 23:59:13,232 INFO L226 Difference]: Without dead ends: 2318 [2025-01-08 23:59:13,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:13,234 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 145 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:13,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 247 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:13,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-01-08 23:59:13,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2025-01-08 23:59:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.0874240299205236) internal successors, (2326), 2139 states have internal predecessors, (2326), 0 states have call successors, (0), 0 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:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2326 transitions. [2025-01-08 23:59:13,283 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2326 transitions. Word has length 340 [2025-01-08 23:59:13,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:13,283 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2326 transitions. [2025-01-08 23:59:13,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 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:13,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2326 transitions. [2025-01-08 23:59:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-08 23:59:13,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:13,286 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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:13,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 23:59:13,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:13,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:13,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:13,495 INFO L85 PathProgramCache]: Analyzing trace with hash -21155766, now seen corresponding path program 1 times [2025-01-08 23:59:13,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:13,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830711680] [2025-01-08 23:59:13,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:13,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:13,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-08 23:59:13,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-08 23:59:13,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:13,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 306 proven. 23 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 23:59:13,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:13,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830711680] [2025-01-08 23:59:13,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830711680] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:13,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062879722] [2025-01-08 23:59:13,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:13,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:13,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:13,867 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:13,870 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:13,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-08 23:59:13,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-08 23:59:13,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:13,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:13,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:59:13,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-01-08 23:59:14,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:14,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062879722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:14,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:14,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:59:14,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307188046] [2025-01-08 23:59:14,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:14,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:14,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:14,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:14,036 INFO L87 Difference]: Start difference. First operand 2140 states and 2326 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 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:14,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:14,642 INFO L93 Difference]: Finished difference Result 4812 states and 5229 transitions. [2025-01-08 23:59:14,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:14,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 350 [2025-01-08 23:59:14,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:14,647 INFO L225 Difference]: With dead ends: 4812 [2025-01-08 23:59:14,648 INFO L226 Difference]: Without dead ends: 2496 [2025-01-08 23:59:14,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:14,649 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 145 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:14,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 247 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:59:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-01-08 23:59:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2140. [2025-01-08 23:59:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.0822814399251988) internal successors, (2315), 2139 states have internal predecessors, (2315), 0 states have call successors, (0), 0 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:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2315 transitions. [2025-01-08 23:59:14,673 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2315 transitions. Word has length 350 [2025-01-08 23:59:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:14,673 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2315 transitions. [2025-01-08 23:59:14,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 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:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2315 transitions. [2025-01-08 23:59:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-01-08 23:59:14,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:14,678 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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:14,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 23:59:14,878 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:14,878 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:14,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:14,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2028014539, now seen corresponding path program 1 times [2025-01-08 23:59:14,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:14,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387997027] [2025-01-08 23:59:14,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:14,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:14,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-01-08 23:59:14,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-01-08 23:59:14,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:14,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 525 proven. 23 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-01-08 23:59:15,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:15,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387997027] [2025-01-08 23:59:15,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387997027] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:15,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641943417] [2025-01-08 23:59:15,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:15,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:15,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:15,242 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:15,245 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:15,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-01-08 23:59:15,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-01-08 23:59:15,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:15,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:15,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:59:15,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2025-01-08 23:59:15,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:15,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641943417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:15,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:15,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:59:15,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195285142] [2025-01-08 23:59:15,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:15,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:15,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:15,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:15,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:15,405 INFO L87 Difference]: Start difference. First operand 2140 states and 2315 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:15,808 INFO L93 Difference]: Finished difference Result 4812 states and 5268 transitions. [2025-01-08 23:59:15,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:15,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 461 [2025-01-08 23:59:15,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:15,815 INFO L225 Difference]: With dead ends: 4812 [2025-01-08 23:59:15,815 INFO L226 Difference]: Without dead ends: 2852 [2025-01-08 23:59:15,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 460 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:15,817 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 145 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:15,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 233 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:15,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2025-01-08 23:59:15,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2496. [2025-01-08 23:59:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.0845691382765532) internal successors, (2706), 2495 states have internal predecessors, (2706), 0 states have call successors, (0), 0 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:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2706 transitions. [2025-01-08 23:59:15,844 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2706 transitions. Word has length 461 [2025-01-08 23:59:15,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:15,845 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 2706 transitions. [2025-01-08 23:59:15,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2706 transitions. [2025-01-08 23:59:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-08 23:59:15,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:15,848 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 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:15,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 23:59:16,049 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:16,049 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:16,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:16,050 INFO L85 PathProgramCache]: Analyzing trace with hash 603682541, now seen corresponding path program 1 times [2025-01-08 23:59:16,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:16,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767744965] [2025-01-08 23:59:16,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:16,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:16,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-08 23:59:16,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-08 23:59:16,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:16,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 563 proven. 23 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-01-08 23:59:16,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:16,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767744965] [2025-01-08 23:59:16,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767744965] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:16,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998479021] [2025-01-08 23:59:16,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:16,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:16,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:16,386 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:16,395 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:16,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-08 23:59:16,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-08 23:59:16,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:16,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:16,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:59:16,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2025-01-08 23:59:16,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:16,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998479021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:16,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:16,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:59:16,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196196081] [2025-01-08 23:59:16,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:16,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:16,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:16,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:16,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:16,570 INFO L87 Difference]: Start difference. First operand 2496 states and 2706 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:17,034 INFO L93 Difference]: Finished difference Result 4812 states and 5234 transitions. [2025-01-08 23:59:17,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:17,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 480 [2025-01-08 23:59:17,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:17,041 INFO L225 Difference]: With dead ends: 4812 [2025-01-08 23:59:17,041 INFO L226 Difference]: Without dead ends: 2674 [2025-01-08 23:59:17,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 479 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:17,043 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 148 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:17,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 193 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2025-01-08 23:59:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2025-01-08 23:59:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.0798446266724213) internal successors, (2502), 2317 states have internal predecessors, (2502), 0 states have call successors, (0), 0 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,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2502 transitions. [2025-01-08 23:59:17,070 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2502 transitions. Word has length 480 [2025-01-08 23:59:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:17,071 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2502 transitions. [2025-01-08 23:59:17,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2502 transitions. [2025-01-08 23:59:17,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-08 23:59:17,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:17,074 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 23:59:17,275 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,SelfDestructingSolverStorable10 [2025-01-08 23:59:17,275 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:17,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:17,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1384147754, now seen corresponding path program 1 times [2025-01-08 23:59:17,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:17,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072393901] [2025-01-08 23:59:17,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:17,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:17,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-08 23:59:17,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-08 23:59:17,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:17,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 582 proven. 23 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-08 23:59:17,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:17,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072393901] [2025-01-08 23:59:17,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072393901] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:17,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849332384] [2025-01-08 23:59:17,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:17,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:17,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:17,645 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:17,646 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:17,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-08 23:59:17,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-08 23:59:17,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:17,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:17,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:59:17,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-08 23:59:18,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:18,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849332384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:18,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:18,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:59:18,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128108612] [2025-01-08 23:59:18,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:18,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:18,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:18,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:18,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:18,195 INFO L87 Difference]: Start difference. First operand 2318 states and 2502 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:18,727 INFO L93 Difference]: Finished difference Result 4634 states and 5016 transitions. [2025-01-08 23:59:18,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:18,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 494 [2025-01-08 23:59:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:18,732 INFO L225 Difference]: With dead ends: 4634 [2025-01-08 23:59:18,733 INFO L226 Difference]: Without dead ends: 2496 [2025-01-08 23:59:18,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 492 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:18,734 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:18,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 45 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-01-08 23:59:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2318. [2025-01-08 23:59:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.080276219249029) internal successors, (2503), 2317 states have internal predecessors, (2503), 0 states have call successors, (0), 0 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,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2503 transitions. [2025-01-08 23:59:18,757 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2503 transitions. Word has length 494 [2025-01-08 23:59:18,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:18,757 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2503 transitions. [2025-01-08 23:59:18,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2503 transitions. [2025-01-08 23:59:18,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-08 23:59:18,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:18,761 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:18,768 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:18,965 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,SelfDestructingSolverStorable11 [2025-01-08 23:59:18,965 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:18,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:18,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1930554947, now seen corresponding path program 1 times [2025-01-08 23:59:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:18,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849793636] [2025-01-08 23:59:18,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:18,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:18,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-08 23:59:19,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-08 23:59:19,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:19,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 864 proven. 11 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-01-08 23:59:19,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:19,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849793636] [2025-01-08 23:59:19,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849793636] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:19,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632685751] [2025-01-08 23:59:19,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:19,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:19,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:19,284 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:19,285 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:19,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-08 23:59:19,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-08 23:59:19,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:19,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:19,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:59:19,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2025-01-08 23:59:19,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:19,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632685751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:19,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:19,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-08 23:59:19,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607845274] [2025-01-08 23:59:19,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:19,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:19,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:19,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:19,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:19,747 INFO L87 Difference]: Start difference. First operand 2318 states and 2503 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:20,064 INFO L93 Difference]: Finished difference Result 4812 states and 5226 transitions. [2025-01-08 23:59:20,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:20,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 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 576 [2025-01-08 23:59:20,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:20,070 INFO L225 Difference]: With dead ends: 4812 [2025-01-08 23:59:20,070 INFO L226 Difference]: Without dead ends: 2852 [2025-01-08 23:59:20,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:20,071 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 78 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:20,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 47 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:59:20,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2025-01-08 23:59:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2025-01-08 23:59:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 1.0789375233819678) internal successors, (2884), 2673 states have internal predecessors, (2884), 0 states have call successors, (0), 0 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:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2884 transitions. [2025-01-08 23:59:20,098 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2884 transitions. Word has length 576 [2025-01-08 23:59:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:20,099 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 2884 transitions. [2025-01-08 23:59:20,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2884 transitions. [2025-01-08 23:59:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-01-08 23:59:20,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:20,103 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-08 23:59:20,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:20,304 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:20,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash 458409519, now seen corresponding path program 1 times [2025-01-08 23:59:20,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:20,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420509738] [2025-01-08 23:59:20,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:20,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:20,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-01-08 23:59:20,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-01-08 23:59:20,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:20,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 803 proven. 93 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-01-08 23:59:20,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:20,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420509738] [2025-01-08 23:59:20,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420509738] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:20,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847557532] [2025-01-08 23:59:20,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:20,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:20,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:20,666 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:20,670 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:20,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-01-08 23:59:20,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-01-08 23:59:20,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:20,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:20,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:59:20,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 896 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-01-08 23:59:20,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:20,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847557532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:20,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:20,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:59:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9492253] [2025-01-08 23:59:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:20,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:20,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:20,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:20,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:20,952 INFO L87 Difference]: Start difference. First operand 2674 states and 2884 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 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,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:21,355 INFO L93 Difference]: Finished difference Result 6236 states and 6773 transitions. [2025-01-08 23:59:21,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:21,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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 650 [2025-01-08 23:59:21,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:21,364 INFO L225 Difference]: With dead ends: 6236 [2025-01-08 23:59:21,364 INFO L226 Difference]: Without dead ends: 3742 [2025-01-08 23:59:21,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 649 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:21,367 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:21,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2025-01-08 23:59:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3564. [2025-01-08 23:59:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.076901487510525) internal successors, (3837), 3563 states have internal predecessors, (3837), 0 states have call successors, (0), 0 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,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3837 transitions. [2025-01-08 23:59:21,417 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3837 transitions. Word has length 650 [2025-01-08 23:59:21,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:21,417 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 3837 transitions. [2025-01-08 23:59:21,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 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,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3837 transitions. [2025-01-08 23:59:21,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2025-01-08 23:59:21,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:21,424 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, 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, 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] [2025-01-08 23:59:21,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-08 23:59:21,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:21,625 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:21,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:21,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1116973216, now seen corresponding path program 1 times [2025-01-08 23:59:21,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:21,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297168465] [2025-01-08 23:59:21,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:21,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:21,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 652 statements into 1 equivalence classes. [2025-01-08 23:59:21,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 652 of 652 statements. [2025-01-08 23:59:21,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:21,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 1120 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-01-08 23:59:21,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:21,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297168465] [2025-01-08 23:59:21,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297168465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:21,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:21,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:21,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232978957] [2025-01-08 23:59:21,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:21,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:21,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:21,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:21,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:21,947 INFO L87 Difference]: Start difference. First operand 3564 states and 3837 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:22,330 INFO L93 Difference]: Finished difference Result 7126 states and 7676 transitions. [2025-01-08 23:59:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:22,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 652 [2025-01-08 23:59:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:22,339 INFO L225 Difference]: With dead ends: 7126 [2025-01-08 23:59:22,339 INFO L226 Difference]: Without dead ends: 3564 [2025-01-08 23:59:22,341 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:22,343 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:22,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 239 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2025-01-08 23:59:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2025-01-08 23:59:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.0670783047993264) internal successors, (3802), 3563 states have internal predecessors, (3802), 0 states have call successors, (0), 0 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,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3802 transitions. [2025-01-08 23:59:22,379 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3802 transitions. Word has length 652 [2025-01-08 23:59:22,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:22,379 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 3802 transitions. [2025-01-08 23:59:22,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3802 transitions. [2025-01-08 23:59:22,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-01-08 23:59:22,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:22,386 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:22,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:59:22,386 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:22,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:22,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1657063057, now seen corresponding path program 1 times [2025-01-08 23:59:22,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:22,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348865953] [2025-01-08 23:59:22,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:22,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:22,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-01-08 23:59:22,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-01-08 23:59:22,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:22,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 1368 proven. 155 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-01-08 23:59:22,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:22,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348865953] [2025-01-08 23:59:22,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348865953] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:22,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943130924] [2025-01-08 23:59:22,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:22,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:22,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:22,709 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:22,712 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:22,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-01-08 23:59:22,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-01-08 23:59:22,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:22,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:22,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:59:22,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 1368 proven. 155 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-01-08 23:59:23,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:59:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 1368 proven. 155 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-01-08 23:59:23,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943130924] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:59:23,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:59:23,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-08 23:59:23,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167151957] [2025-01-08 23:59:23,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:59:23,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 23:59:23,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:23,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 23:59:23,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:23,466 INFO L87 Difference]: Start difference. First operand 3564 states and 3802 transitions. Second operand has 6 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 0 states have call successors, (0), 0 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,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:24,177 INFO L93 Difference]: Finished difference Result 8372 states and 8972 transitions. [2025-01-08 23:59:24,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:59:24,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 0 states have call successors, (0), 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 805 [2025-01-08 23:59:24,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:24,185 INFO L225 Difference]: With dead ends: 8372 [2025-01-08 23:59:24,185 INFO L226 Difference]: Without dead ends: 4988 [2025-01-08 23:59:24,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1612 GetRequests, 1608 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:24,188 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 44 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:24,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 52 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:59:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-01-08 23:59:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4276. [2025-01-08 23:59:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0711111111111111) internal successors, (4579), 4275 states have internal predecessors, (4579), 0 states have call successors, (0), 0 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,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4579 transitions. [2025-01-08 23:59:24,216 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4579 transitions. Word has length 805 [2025-01-08 23:59:24,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:24,217 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4579 transitions. [2025-01-08 23:59:24,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 0 states have call successors, (0), 0 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,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4579 transitions. [2025-01-08 23:59:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2025-01-08 23:59:24,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:24,222 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, 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, 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, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:24,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-08 23:59:24,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:24,423 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:24,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash -262158526, now seen corresponding path program 1 times [2025-01-08 23:59:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:24,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355120800] [2025-01-08 23:59:24,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:24,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:24,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 807 statements into 1 equivalence classes. [2025-01-08 23:59:24,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 807 of 807 statements. [2025-01-08 23:59:24,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:24,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2259 backedges. 1446 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2025-01-08 23:59:24,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:24,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355120800] [2025-01-08 23:59:24,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355120800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:24,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:24,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:24,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972638876] [2025-01-08 23:59:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:24,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:24,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:24,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:24,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:24,787 INFO L87 Difference]: Start difference. First operand 4276 states and 4579 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 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,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:25,131 INFO L93 Difference]: Finished difference Result 8906 states and 9594 transitions. [2025-01-08 23:59:25,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:25,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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 807 [2025-01-08 23:59:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:25,137 INFO L225 Difference]: With dead ends: 8906 [2025-01-08 23:59:25,137 INFO L226 Difference]: Without dead ends: 4632 [2025-01-08 23:59:25,140 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:25,140 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:25,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 234 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:59:25,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-01-08 23:59:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2025-01-08 23:59:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0592858746912195) internal successors, (4717), 4453 states have internal predecessors, (4717), 0 states have call successors, (0), 0 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,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4717 transitions. [2025-01-08 23:59:25,167 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4717 transitions. Word has length 807 [2025-01-08 23:59:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:25,168 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4717 transitions. [2025-01-08 23:59:25,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 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,168 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4717 transitions. [2025-01-08 23:59:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 826 [2025-01-08 23:59:25,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:25,173 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, 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, 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, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:25,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:59:25,173 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:25,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:25,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1604723723, now seen corresponding path program 1 times [2025-01-08 23:59:25,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:25,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967339490] [2025-01-08 23:59:25,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:25,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:25,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 825 statements into 1 equivalence classes. [2025-01-08 23:59:25,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 825 of 825 statements. [2025-01-08 23:59:25,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:25,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2259 backedges. 1597 proven. 0 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2025-01-08 23:59:25,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:25,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967339490] [2025-01-08 23:59:25,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967339490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:25,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:25,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:25,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199258269] [2025-01-08 23:59:25,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:25,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:25,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:25,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:25,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:25,617 INFO L87 Difference]: Start difference. First operand 4454 states and 4717 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 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,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:25,947 INFO L93 Difference]: Finished difference Result 8906 states and 9435 transitions. [2025-01-08 23:59:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:25,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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 825 [2025-01-08 23:59:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:25,953 INFO L225 Difference]: With dead ends: 8906 [2025-01-08 23:59:25,953 INFO L226 Difference]: Without dead ends: 4632 [2025-01-08 23:59:25,956 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:25,956 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:25,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 55 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:59:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-01-08 23:59:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2025-01-08 23:59:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.058836739276892) internal successors, (4715), 4453 states have internal predecessors, (4715), 0 states have call successors, (0), 0 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,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4715 transitions. [2025-01-08 23:59:25,983 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4715 transitions. Word has length 825 [2025-01-08 23:59:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:25,983 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4715 transitions. [2025-01-08 23:59:25,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 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,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4715 transitions. [2025-01-08 23:59:25,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 903 [2025-01-08 23:59:25,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:25,990 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, 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, 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, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:25,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 23:59:25,990 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:25,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:25,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1107733360, now seen corresponding path program 1 times [2025-01-08 23:59:25,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:25,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750561141] [2025-01-08 23:59:25,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:25,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:26,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 902 statements into 1 equivalence classes. [2025-01-08 23:59:26,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 902 of 902 statements. [2025-01-08 23:59:26,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:26,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2823 backedges. 1703 proven. 0 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2025-01-08 23:59:26,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:26,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750561141] [2025-01-08 23:59:26,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750561141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:26,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:26,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:26,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035441862] [2025-01-08 23:59:26,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:26,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:26,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:26,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:26,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:26,416 INFO L87 Difference]: Start difference. First operand 4454 states and 4715 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:26,698 INFO L93 Difference]: Finished difference Result 8906 states and 9431 transitions. [2025-01-08 23:59:26,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:26,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 902 [2025-01-08 23:59:26,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:26,703 INFO L225 Difference]: With dead ends: 8906 [2025-01-08 23:59:26,704 INFO L226 Difference]: Without dead ends: 4454 [2025-01-08 23:59:26,706 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:26,706 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:26,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 219 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:59:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-01-08 23:59:26,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4276. [2025-01-08 23:59:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0470175438596492) internal successors, (4476), 4275 states have internal predecessors, (4476), 0 states have call successors, (0), 0 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:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4476 transitions. [2025-01-08 23:59:26,736 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4476 transitions. Word has length 902 [2025-01-08 23:59:26,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:26,736 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4476 transitions. [2025-01-08 23:59:26,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4476 transitions. [2025-01-08 23:59:26,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2025-01-08 23:59:26,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:26,742 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, 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, 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, 5, 5, 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, 1, 1, 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:26,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 23:59:26,742 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:26,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:26,743 INFO L85 PathProgramCache]: Analyzing trace with hash -904056163, now seen corresponding path program 1 times [2025-01-08 23:59:26,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:26,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352620035] [2025-01-08 23:59:26,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:26,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:26,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 976 statements into 1 equivalence classes. [2025-01-08 23:59:26,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 976 of 976 statements. [2025-01-08 23:59:26,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:26,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3063 backedges. 1617 proven. 155 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2025-01-08 23:59:27,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:27,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352620035] [2025-01-08 23:59:27,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352620035] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:27,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271881101] [2025-01-08 23:59:27,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:27,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:27,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:27,326 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:27,327 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:27,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 976 statements into 1 equivalence classes. [2025-01-08 23:59:27,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 976 of 976 statements. [2025-01-08 23:59:27,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:27,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:27,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:59:27,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3063 backedges. 1772 proven. 0 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2025-01-08 23:59:28,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:28,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271881101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:28,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:28,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:59:28,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427135159] [2025-01-08 23:59:28,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:28,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:28,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:28,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:28,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:28,145 INFO L87 Difference]: Start difference. First operand 4276 states and 4476 transitions. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:28,659 INFO L93 Difference]: Finished difference Result 8550 states and 8953 transitions. [2025-01-08 23:59:28,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:28,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 976 [2025-01-08 23:59:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:28,664 INFO L225 Difference]: With dead ends: 8550 [2025-01-08 23:59:28,664 INFO L226 Difference]: Without dead ends: 4454 [2025-01-08 23:59:28,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 979 GetRequests, 974 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:28,668 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 127 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:28,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 41 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-01-08 23:59:28,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4276. [2025-01-08 23:59:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0442105263157895) internal successors, (4464), 4275 states have internal predecessors, (4464), 0 states have call successors, (0), 0 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,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4464 transitions. [2025-01-08 23:59:28,699 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4464 transitions. Word has length 976 [2025-01-08 23:59:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:28,699 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4464 transitions. [2025-01-08 23:59:28,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4464 transitions. [2025-01-08 23:59:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2025-01-08 23:59:28,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:28,706 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:28,713 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:28,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:28,907 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:28,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:28,908 INFO L85 PathProgramCache]: Analyzing trace with hash 404504488, now seen corresponding path program 1 times [2025-01-08 23:59:28,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:28,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280269696] [2025-01-08 23:59:28,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:28,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:28,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1015 statements into 1 equivalence classes. [2025-01-08 23:59:28,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1015 of 1015 statements. [2025-01-08 23:59:28,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:28,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 1701 proven. 0 refuted. 0 times theorem prover too weak. 1974 trivial. 0 not checked. [2025-01-08 23:59:29,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:29,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280269696] [2025-01-08 23:59:29,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280269696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:29,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:29,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:59:29,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773918621] [2025-01-08 23:59:29,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:29,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:59:29,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:29,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:59:29,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:29,589 INFO L87 Difference]: Start difference. First operand 4276 states and 4464 transitions. Second operand has 7 states, 7 states have (on average 49.857142857142854) internal successors, (349), 6 states have internal predecessors, (349), 0 states have call successors, (0), 0 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:30,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:30,005 INFO L93 Difference]: Finished difference Result 8600 states and 8979 transitions. [2025-01-08 23:59:30,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 23:59:30,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.857142857142854) internal successors, (349), 6 states have internal predecessors, (349), 0 states have call successors, (0), 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 1015 [2025-01-08 23:59:30,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:30,011 INFO L225 Difference]: With dead ends: 8600 [2025-01-08 23:59:30,012 INFO L226 Difference]: Without dead ends: 4454 [2025-01-08 23:59:30,014 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:30,015 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:30,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 20 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-01-08 23:59:30,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4276. [2025-01-08 23:59:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0369590643274853) internal successors, (4433), 4275 states have internal predecessors, (4433), 0 states have call successors, (0), 0 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:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4433 transitions. [2025-01-08 23:59:30,044 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4433 transitions. Word has length 1015 [2025-01-08 23:59:30,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:30,044 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4433 transitions. [2025-01-08 23:59:30,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.857142857142854) internal successors, (349), 6 states have internal predecessors, (349), 0 states have call successors, (0), 0 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:30,044 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4433 transitions. [2025-01-08 23:59:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2025-01-08 23:59:30,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:30,051 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:30,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 23:59:30,051 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:30,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:30,052 INFO L85 PathProgramCache]: Analyzing trace with hash -222226347, now seen corresponding path program 1 times [2025-01-08 23:59:30,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:30,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514315161] [2025-01-08 23:59:30,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:30,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:30,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1047 statements into 1 equivalence classes. [2025-01-08 23:59:30,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1047 of 1047 statements. [2025-01-08 23:59:30,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:30,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 1082 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2025-01-08 23:59:30,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:30,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514315161] [2025-01-08 23:59:30,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514315161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:30,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:30,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:30,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787054646] [2025-01-08 23:59:30,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:30,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:30,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:30,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:30,574 INFO L87 Difference]: Start difference. First operand 4276 states and 4433 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 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:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:30,909 INFO L93 Difference]: Finished difference Result 8728 states and 9053 transitions. [2025-01-08 23:59:30,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:30,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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 1047 [2025-01-08 23:59:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:30,915 INFO L225 Difference]: With dead ends: 8728 [2025-01-08 23:59:30,915 INFO L226 Difference]: Without dead ends: 4454 [2025-01-08 23:59:30,918 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:30,919 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 66 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:30,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 222 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:59:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-01-08 23:59:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 3920. [2025-01-08 23:59:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3919 states have (on average 1.028578719060985) internal successors, (4031), 3919 states have internal predecessors, (4031), 0 states have call successors, (0), 0 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:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4031 transitions. [2025-01-08 23:59:30,943 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4031 transitions. Word has length 1047 [2025-01-08 23:59:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:30,943 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 4031 transitions. [2025-01-08 23:59:30,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 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:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4031 transitions. [2025-01-08 23:59:30,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2025-01-08 23:59:30,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:30,950 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:59:30,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-08 23:59:30,951 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:30,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:30,951 INFO L85 PathProgramCache]: Analyzing trace with hash -642385203, now seen corresponding path program 1 times [2025-01-08 23:59:30,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:30,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637087303] [2025-01-08 23:59:30,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:30,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:30,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1095 statements into 1 equivalence classes. [2025-01-08 23:59:31,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1095 of 1095 statements. [2025-01-08 23:59:31,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:31,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3788 backedges. 2738 proven. 72 refuted. 0 times theorem prover too weak. 978 trivial. 0 not checked. [2025-01-08 23:59:31,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:31,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637087303] [2025-01-08 23:59:31,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637087303] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:31,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690513848] [2025-01-08 23:59:31,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:31,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:31,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:31,940 INFO L229 MonitoredProcess]: Starting monitored process 12 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:31,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-08 23:59:32,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1095 statements into 1 equivalence classes. [2025-01-08 23:59:32,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1095 of 1095 statements. [2025-01-08 23:59:32,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:32,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:32,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 23:59:32,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3788 backedges. 2697 proven. 666 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-01-08 23:59:32,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:59:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3788 backedges. 2810 proven. 0 refuted. 0 times theorem prover too weak. 978 trivial. 0 not checked. [2025-01-08 23:59:33,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690513848] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:33,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 23:59:33,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-01-08 23:59:33,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331075166] [2025-01-08 23:59:33,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:33,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:59:33,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:33,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:59:33,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:59:33,151 INFO L87 Difference]: Start difference. First operand 3920 states and 4031 transitions. Second operand has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 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,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:33,502 INFO L93 Difference]: Finished difference Result 8194 states and 8436 transitions. [2025-01-08 23:59:33,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:33,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 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 1095 [2025-01-08 23:59:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:33,507 INFO L225 Difference]: With dead ends: 8194 [2025-01-08 23:59:33,507 INFO L226 Difference]: Without dead ends: 4454 [2025-01-08 23:59:33,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2193 GetRequests, 2185 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:33,510 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:33,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 9 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:59:33,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-01-08 23:59:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4098. [2025-01-08 23:59:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.0275811569441053) internal successors, (4210), 4097 states have internal predecessors, (4210), 0 states have call successors, (0), 0 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,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4210 transitions. [2025-01-08 23:59:33,536 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4210 transitions. Word has length 1095 [2025-01-08 23:59:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:33,537 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4210 transitions. [2025-01-08 23:59:33,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 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,537 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4210 transitions. [2025-01-08 23:59:33,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1319 [2025-01-08 23:59:33,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:33,545 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, 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, 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, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:33,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-08 23:59:33,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-08 23:59:33,746 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:33,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:33,747 INFO L85 PathProgramCache]: Analyzing trace with hash -872314581, now seen corresponding path program 1 times [2025-01-08 23:59:33,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:33,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803617842] [2025-01-08 23:59:33,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:33,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:33,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1318 statements into 1 equivalence classes. [2025-01-08 23:59:33,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1318 of 1318 statements. [2025-01-08 23:59:33,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:33,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 2966 proven. 0 refuted. 0 times theorem prover too weak. 2831 trivial. 0 not checked. [2025-01-08 23:59:34,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:34,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803617842] [2025-01-08 23:59:34,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803617842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:34,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:34,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:34,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654346950] [2025-01-08 23:59:34,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:34,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:34,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:34,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:34,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:34,172 INFO L87 Difference]: Start difference. First operand 4098 states and 4210 transitions. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 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,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:34,502 INFO L93 Difference]: Finished difference Result 8372 states and 8605 transitions. [2025-01-08 23:59:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:34,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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 1318 [2025-01-08 23:59:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:34,508 INFO L225 Difference]: With dead ends: 8372 [2025-01-08 23:59:34,508 INFO L226 Difference]: Without dead ends: 4454 [2025-01-08 23:59:34,510 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,511 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 72 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:34,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 44 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:59:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-01-08 23:59:34,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4276. [2025-01-08 23:59:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0269005847953216) internal successors, (4390), 4275 states have internal predecessors, (4390), 0 states have call successors, (0), 0 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,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4390 transitions. [2025-01-08 23:59:34,550 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4390 transitions. Word has length 1318 [2025-01-08 23:59:34,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:34,550 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4390 transitions. [2025-01-08 23:59:34,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 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,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4390 transitions. [2025-01-08 23:59:34,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1383 [2025-01-08 23:59:34,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:34,569 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, 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, 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, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:34,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-08 23:59:34,570 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:34,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:34,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1306610229, now seen corresponding path program 1 times [2025-01-08 23:59:34,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:34,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971934932] [2025-01-08 23:59:34,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:34,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:34,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1382 statements into 1 equivalence classes. [2025-01-08 23:59:34,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1382 of 1382 statements. [2025-01-08 23:59:34,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:34,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5927 backedges. 4476 proven. 72 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2025-01-08 23:59:35,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:35,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971934932] [2025-01-08 23:59:35,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971934932] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:35,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848671367] [2025-01-08 23:59:35,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:35,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:35,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:35,834 INFO L229 MonitoredProcess]: Starting monitored process 13 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,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-08 23:59:35,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1382 statements into 1 equivalence classes. [2025-01-08 23:59:36,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1382 of 1382 statements. [2025-01-08 23:59:36,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:36,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:36,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 1670 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 23:59:36,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5927 backedges. 4385 proven. 716 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2025-01-08 23:59:36,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:59:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5927 backedges. 4548 proven. 0 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2025-01-08 23:59:37,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848671367] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:37,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 23:59:37,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-01-08 23:59:37,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124778854] [2025-01-08 23:59:37,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:37,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:59:37,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:37,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:59:37,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:59:37,278 INFO L87 Difference]: Start difference. First operand 4276 states and 4390 transitions. Second operand has 5 states, 5 states have (on average 146.2) internal successors, (731), 5 states have internal predecessors, (731), 0 states have call successors, (0), 0 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:37,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:37,664 INFO L93 Difference]: Finished difference Result 8726 states and 8962 transitions. [2025-01-08 23:59:37,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:37,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 146.2) internal successors, (731), 5 states have internal predecessors, (731), 0 states have call successors, (0), 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 1382 [2025-01-08 23:59:37,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:37,666 INFO L225 Difference]: With dead ends: 8726 [2025-01-08 23:59:37,666 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:59:37,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2767 GetRequests, 2760 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:37,670 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 42 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:37,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 8 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:37,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:59:37,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:59:37,671 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:37,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:59:37,671 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1382 [2025-01-08 23:59:37,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:37,671 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:59:37,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.2) internal successors, (731), 5 states have internal predecessors, (731), 0 states have call successors, (0), 0 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:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:59:37,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:59:37,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:59:37,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-08 23:59:37,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:37,877 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, 1, 1] [2025-01-08 23:59:37,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:59:48,822 WARN L286 SmtUtils]: Spent 10.94s on a formula simplification. DAG size of input: 151 DAG size of output: 142 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-08 23:59:49,341 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:59:49,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:59:49 BoogieIcfgContainer [2025-01-08 23:59:49,369 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:59:49,370 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:59:49,370 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:59:49,370 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:59:49,371 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:05" (3/4) ... [2025-01-08 23:59:49,384 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:59:49,422 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:59:49,423 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:59:49,423 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:59:49,424 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:59:49,607 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:59:49,611 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:59:49,611 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:59:49,611 INFO L158 Benchmark]: Toolchain (without parser) took 46147.37ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 109.0MB in the beginning and 140.2MB in the end (delta: -31.3MB). Peak memory consumption was 944.5MB. Max. memory is 16.1GB. [2025-01-08 23:59:49,611 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:59:49,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.68ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 77.3MB in the end (delta: 31.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 23:59:49,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.64ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 68.0MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:59:49,612 INFO L158 Benchmark]: Boogie Preprocessor took 78.32ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 56.1MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:59:49,612 INFO L158 Benchmark]: RCFGBuilder took 999.88ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 55.6MB in the beginning and 345.5MB in the end (delta: -289.8MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2025-01-08 23:59:49,612 INFO L158 Benchmark]: TraceAbstraction took 44353.17ms. Allocated memory was 419.4MB in the beginning and 1.7GB in the end (delta: 1.2GB). Free memory was 345.5MB in the beginning and 689.7MB in the end (delta: -344.2MB). Peak memory consumption was 967.1MB. Max. memory is 16.1GB. [2025-01-08 23:59:49,612 INFO L158 Benchmark]: Witness Printer took 240.65ms. Allocated memory was 1.7GB in the beginning and 201.3MB in the end (delta: -1.5GB). Free memory was 689.7MB in the beginning and 140.2MB in the end (delta: 549.4MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2025-01-08 23:59:49,613 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.14ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.68ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 77.3MB in the end (delta: 31.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.64ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 68.0MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.32ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 56.1MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 999.88ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 55.6MB in the beginning and 345.5MB in the end (delta: -289.8MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. * TraceAbstraction took 44353.17ms. Allocated memory was 419.4MB in the beginning and 1.7GB in the end (delta: 1.2GB). Free memory was 345.5MB in the beginning and 689.7MB in the end (delta: -344.2MB). Peak memory consumption was 967.1MB. Max. memory is 16.1GB. * Witness Printer took 240.65ms. Allocated memory was 1.7GB in the beginning and 201.3MB in the end (delta: -1.5GB). Free memory was 689.7MB in the beginning and 140.2MB in the end (delta: 549.4MB). Peak memory consumption was 9.3MB. 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: 122]: 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: 32.8s, OverallIterations: 25, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2835 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2835 mSDsluCounter, 2739 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 1327 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13189 IncrementalHoareTripleChecker+Invalid, 14516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1327 mSolverCounterUnsat, 2597 mSDtfsCounter, 13189 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11214 GetRequests, 11136 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4454occurred in iteration=17, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 5162 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 23448 NumberOfCodeBlocks, 23448 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 26690 ConstructedInterpolants, 0 QuantifiedInterpolants, 75451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 9835 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 40 InterpolantComputations, 24 PerfectInterpolantSequences, 72633/75030 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: ((((((((((((((((a24 == 1) && (a12 <= 600006)) && (81 <= a12)) && (8 <= a15)) || ((((a12 <= 11) && (a24 == 1)) && (10 <= a21)) && (8 <= a15))) || (((((long long) a12 + 43) <= 0) && (a24 == 1)) && (a15 <= 8))) || (((a21 == 8) && (a24 == 1)) && (a12 <= 600006))) || ((((a24 == 1) && (10 <= a21)) && (81 <= a12)) && (a15 == 8))) || (((a24 == 1) && (7 == a21)) && (a15 <= 6))) || (((a24 == 1) && (5 == a15)) && (a21 == 6))) || ((((a24 == 1) && (7 == a21)) && (a12 <= 600006)) && (8 <= a15))) || (((a24 == 1) && (a21 == 9)) && (a15 <= 6))) || (((a24 == 1) && (a21 <= 6)) && (a12 <= 600006))) || (((((a24 == 1) && (a15 <= 6)) || (((a24 == 1) && (10 <= a21)) && (81 <= a12))) || (((a15 <= 6) && (a21 <= 6)) && (((long long) 49 + a12) <= 0))) && (a12 <= 600006))) || (((a21 == 8) && (a24 == 1)) && (a15 <= 6))) || ((((a24 == 1) && (a15 <= 8)) && (a21 == 9)) && (a12 <= 600006))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:59:49,642 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