./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label53.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_label53.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 f09951f8169d75602552a0c69d410baacae8493e4742c50eb18d4008647dffd9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:59:26,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:59:26,741 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:26,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:59:26,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:59:26,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:59:26,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:59:26,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:59:26,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:59:26,776 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:59:26,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:59:26,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:59:26,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:59:26,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:59:26,777 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:59:26,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:59:26,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:59:26,777 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:59:26,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:59:26,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:59:26,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:59:26,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:59:26,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:59:26,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:59:26,778 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:59:26,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:59:26,778 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:59:26,779 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:59:26,779 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:59:26,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:59:26,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:59:26,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:59:26,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:59:26,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:59:26,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:59:26,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:59:26,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:59:26,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:59:26,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:59:26,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:59:26,780 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:59:26,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:59:26,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:59:26,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:59:26,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:59:26,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:59:26,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:59:26,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:59:26,780 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 -> f09951f8169d75602552a0c69d410baacae8493e4742c50eb18d4008647dffd9 [2025-01-08 23:59:27,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:59:27,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:59:27,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:59:27,051 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:59:27,051 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:59:27,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2025-01-08 23:59:28,417 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83e25f3b7/5ec2f5bfaf8e42b6bc4e7d781f511586/FLAG7ffe75b96 [2025-01-08 23:59:28,827 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:59:28,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2025-01-08 23:59:28,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83e25f3b7/5ec2f5bfaf8e42b6bc4e7d781f511586/FLAG7ffe75b96 [2025-01-08 23:59:28,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83e25f3b7/5ec2f5bfaf8e42b6bc4e7d781f511586 [2025-01-08 23:59:28,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:59:28,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:59:28,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:59:28,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:59:28,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:59:28,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:59:28" (1/1) ... [2025-01-08 23:59:28,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed7a08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:28, skipping insertion in model container [2025-01-08 23:59:28,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:59:28" (1/1) ... [2025-01-08 23:59:28,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:59:29,117 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_label53.c[5103,5116] [2025-01-08 23:59:29,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:59:29,267 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:59:29,294 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_label53.c[5103,5116] [2025-01-08 23:59:29,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:59:29,389 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:59:29,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:29 WrapperNode [2025-01-08 23:59:29,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:59:29,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:59:29,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:59:29,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:59:29,399 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:29" (1/1) ... [2025-01-08 23:59:29,423 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:29" (1/1) ... [2025-01-08 23:59:29,501 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-01-08 23:59:29,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:59:29,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:59:29,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:59:29,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:59:29,512 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:29" (1/1) ... [2025-01-08 23:59:29,513 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:29" (1/1) ... [2025-01-08 23:59:29,522 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:29" (1/1) ... [2025-01-08 23:59:29,557 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:29,563 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:29" (1/1) ... [2025-01-08 23:59:29,563 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:29" (1/1) ... [2025-01-08 23:59:29,582 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:29" (1/1) ... [2025-01-08 23:59:29,585 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:29" (1/1) ... [2025-01-08 23:59:29,598 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:29" (1/1) ... [2025-01-08 23:59:29,607 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:29" (1/1) ... [2025-01-08 23:59:29,618 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:29" (1/1) ... [2025-01-08 23:59:29,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:59:29,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:59:29,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:59:29,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:59:29,629 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:29" (1/1) ... [2025-01-08 23:59:29,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:59:29,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:29,664 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:29,668 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:29,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:59:29,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:59:29,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:59:29,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:59:29,755 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:59:29,756 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:59:31,148 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-01-08 23:59:31,148 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:59:31,168 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:59:31,169 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:59:31,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:59:31 BoogieIcfgContainer [2025-01-08 23:59:31,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:59:31,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:59:31,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:59:31,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:59:31,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:59:28" (1/3) ... [2025-01-08 23:59:31,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639caf9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:59:31, skipping insertion in model container [2025-01-08 23:59:31,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:29" (2/3) ... [2025-01-08 23:59:31,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639caf9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:59:31, skipping insertion in model container [2025-01-08 23:59:31,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:59:31" (3/3) ... [2025-01-08 23:59:31,179 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label53.c [2025-01-08 23:59:31,191 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:59:31,192 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label53.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:59:31,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:59:31,262 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;@6fc2ebfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:59:31,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:59:31,266 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:31,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-08 23:59:31,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:31,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:31,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:31,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:31,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2007430668, now seen corresponding path program 1 times [2025-01-08 23:59:31,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:31,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902951425] [2025-01-08 23:59:31,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:31,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:31,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-08 23:59:31,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-08 23:59:31,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:31,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:31,651 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:31,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:31,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902951425] [2025-01-08 23:59:31,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902951425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:31,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:31,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:59:31,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455161015] [2025-01-08 23:59:31,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:31,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:31,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:31,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:31,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:31,683 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 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:32,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:32,674 INFO L93 Difference]: Finished difference Result 669 states and 1197 transitions. [2025-01-08 23:59:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:32,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-01-08 23:59:32,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:32,691 INFO L225 Difference]: With dead ends: 669 [2025-01-08 23:59:32,691 INFO L226 Difference]: Without dead ends: 360 [2025-01-08 23:59:32,696 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:32,699 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:32,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 94 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:59:32,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-08 23:59:32,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-01-08 23:59:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.5208913649025069) internal successors, (546), 359 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 546 transitions. [2025-01-08 23:59:32,779 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 546 transitions. Word has length 49 [2025-01-08 23:59:32,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:32,780 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 546 transitions. [2025-01-08 23:59:32,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 546 transitions. [2025-01-08 23:59:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-08 23:59:32,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:32,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:32,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:59:32,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:32,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:32,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1868269219, now seen corresponding path program 1 times [2025-01-08 23:59:32,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:32,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218131077] [2025-01-08 23:59:32,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:32,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:32,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-08 23:59:32,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-08 23:59:32,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:32,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:59:33,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:33,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218131077] [2025-01-08 23:59:33,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218131077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:33,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:33,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:59:33,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624511597] [2025-01-08 23:59:33,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:33,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:33,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:33,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:33,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:33,053 INFO L87 Difference]: Start difference. First operand 360 states and 546 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 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,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:33,762 INFO L93 Difference]: Finished difference Result 1074 states and 1633 transitions. [2025-01-08 23:59:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:33,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-01-08 23:59:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:33,766 INFO L225 Difference]: With dead ends: 1074 [2025-01-08 23:59:33,767 INFO L226 Difference]: Without dead ends: 716 [2025-01-08 23:59:33,768 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:33,768 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:33,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 95 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:59:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-08 23:59:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-01-08 23:59:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.353846153846154) internal successors, (968), 715 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2025-01-08 23:59:33,808 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 124 [2025-01-08 23:59:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:33,809 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2025-01-08 23:59:33,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 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,809 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2025-01-08 23:59:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-08 23:59:33,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:33,813 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:33,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:59:33,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:33,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:33,816 INFO L85 PathProgramCache]: Analyzing trace with hash 741548391, now seen corresponding path program 1 times [2025-01-08 23:59:33,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:33,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624002750] [2025-01-08 23:59:33,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:33,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:33,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-08 23:59:33,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-08 23:59:33,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:33,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:59:34,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:34,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624002750] [2025-01-08 23:59:34,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624002750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:34,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:34,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:34,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284284422] [2025-01-08 23:59:34,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:34,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:34,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:34,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:34,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:34,244 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:35,201 INFO L93 Difference]: Finished difference Result 1964 states and 2564 transitions. [2025-01-08 23:59:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:35,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-01-08 23:59:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:35,209 INFO L225 Difference]: With dead ends: 1964 [2025-01-08 23:59:35,209 INFO L226 Difference]: Without dead ends: 1250 [2025-01-08 23:59:35,211 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:35,211 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 434 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:35,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 116 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:59:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-01-08 23:59:35,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2025-01-08 23:59:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.255404323458767) internal successors, (1568), 1249 states have internal predecessors, (1568), 0 states have call successors, (0), 0 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:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1568 transitions. [2025-01-08 23:59:35,243 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1568 transitions. Word has length 128 [2025-01-08 23:59:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:35,243 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1568 transitions. [2025-01-08 23:59:35,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1568 transitions. [2025-01-08 23:59:35,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-08 23:59:35,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:35,250 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:35,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:59:35,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:35,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:35,251 INFO L85 PathProgramCache]: Analyzing trace with hash -352750857, now seen corresponding path program 1 times [2025-01-08 23:59:35,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:35,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809695590] [2025-01-08 23:59:35,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:35,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:35,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-08 23:59:35,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-08 23:59:35,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:35,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-08 23:59:35,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:35,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809695590] [2025-01-08 23:59:35,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809695590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:35,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:35,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:59:35,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75205788] [2025-01-08 23:59:35,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:35,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:35,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:35,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:35,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:35,506 INFO L87 Difference]: Start difference. First operand 1250 states and 1568 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:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:36,192 INFO L93 Difference]: Finished difference Result 2676 states and 3487 transitions. [2025-01-08 23:59:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:36,193 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 194 [2025-01-08 23:59:36,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:36,200 INFO L225 Difference]: With dead ends: 2676 [2025-01-08 23:59:36,201 INFO L226 Difference]: Without dead ends: 1606 [2025-01-08 23:59:36,203 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:36,206 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:36,206 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.6s Time] [2025-01-08 23:59:36,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-01-08 23:59:36,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2025-01-08 23:59:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.2330218068535825) internal successors, (1979), 1605 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1979 transitions. [2025-01-08 23:59:36,239 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1979 transitions. Word has length 194 [2025-01-08 23:59:36,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:36,239 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1979 transitions. [2025-01-08 23:59:36,239 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:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1979 transitions. [2025-01-08 23:59:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-08 23:59:36,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:36,242 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:36,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:59:36,242 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:36,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:36,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1614257644, now seen corresponding path program 1 times [2025-01-08 23:59:36,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:36,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234539071] [2025-01-08 23:59:36,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:36,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:36,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-08 23:59:36,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-08 23:59:36,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:36,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 23:59:36,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:36,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234539071] [2025-01-08 23:59:36,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234539071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:36,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:36,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:36,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963453151] [2025-01-08 23:59:36,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:36,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:36,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:36,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:36,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:36,531 INFO L87 Difference]: Start difference. First operand 1606 states and 1979 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:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:37,268 INFO L93 Difference]: Finished difference Result 3239 states and 4003 transitions. [2025-01-08 23:59:37,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:37,269 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 208 [2025-01-08 23:59:37,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:37,275 INFO L225 Difference]: With dead ends: 3239 [2025-01-08 23:59:37,275 INFO L226 Difference]: Without dead ends: 1784 [2025-01-08 23:59:37,277 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:37,279 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 110 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:37,279 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.7s Time] [2025-01-08 23:59:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-01-08 23:59:37,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1606. [2025-01-08 23:59:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.145171339563863) internal successors, (1838), 1605 states have internal predecessors, (1838), 0 states have call successors, (0), 0 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,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1838 transitions. [2025-01-08 23:59:37,309 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1838 transitions. Word has length 208 [2025-01-08 23:59:37,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:37,310 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1838 transitions. [2025-01-08 23:59:37,310 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:37,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1838 transitions. [2025-01-08 23:59:37,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-01-08 23:59:37,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:37,314 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:59:37,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:59:37,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:37,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:37,315 INFO L85 PathProgramCache]: Analyzing trace with hash 837669136, now seen corresponding path program 1 times [2025-01-08 23:59:37,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:37,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627374869] [2025-01-08 23:59:37,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:37,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:37,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-01-08 23:59:37,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-01-08 23:59:37,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:37,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 175 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:59:37,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:37,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627374869] [2025-01-08 23:59:37,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627374869] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:37,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137442599] [2025-01-08 23:59:37,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:37,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:37,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:37,834 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:37,837 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:37,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-01-08 23:59:37,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-01-08 23:59:37,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:37,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:37,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:59:37,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-08 23:59:38,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:38,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137442599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:38,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:38,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:59:38,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801105146] [2025-01-08 23:59:38,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:38,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:38,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:38,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:38,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:38,087 INFO L87 Difference]: Start difference. First operand 1606 states and 1838 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:38,600 INFO L93 Difference]: Finished difference Result 2142 states and 2437 transitions. [2025-01-08 23:59:38,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:38,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 284 [2025-01-08 23:59:38,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:38,608 INFO L225 Difference]: With dead ends: 2142 [2025-01-08 23:59:38,608 INFO L226 Difference]: Without dead ends: 2140 [2025-01-08 23:59:38,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:38,610 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 153 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:38,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 11 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:38,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-01-08 23:59:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1784. [2025-01-08 23:59:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1508693213684802) internal successors, (2052), 1783 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2052 transitions. [2025-01-08 23:59:38,662 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2052 transitions. Word has length 284 [2025-01-08 23:59:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:38,663 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2052 transitions. [2025-01-08 23:59:38,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2052 transitions. [2025-01-08 23:59:38,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-01-08 23:59:38,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:38,667 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 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:38,675 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:38,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:38,871 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:38,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:38,872 INFO L85 PathProgramCache]: Analyzing trace with hash 43985543, now seen corresponding path program 1 times [2025-01-08 23:59:38,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:38,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713670294] [2025-01-08 23:59:38,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:38,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:38,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-01-08 23:59:38,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-01-08 23:59:38,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:38,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 247 proven. 100 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-08 23:59:39,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:39,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713670294] [2025-01-08 23:59:39,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713670294] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:39,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927147783] [2025-01-08 23:59:39,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:39,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:39,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:39,416 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:39,418 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:39,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-01-08 23:59:39,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-01-08 23:59:39,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:39,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:39,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:59:39,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-01-08 23:59:39,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:39,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927147783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:39,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:39,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:59:39,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337765653] [2025-01-08 23:59:39,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:39,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:39,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:39,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:39,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:39,637 INFO L87 Difference]: Start difference. First operand 1784 states and 2052 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:40,160 INFO L93 Difference]: Finished difference Result 3744 states and 4319 transitions. [2025-01-08 23:59:40,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:40,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 339 [2025-01-08 23:59:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:40,167 INFO L225 Difference]: With dead ends: 3744 [2025-01-08 23:59:40,167 INFO L226 Difference]: Without dead ends: 1962 [2025-01-08 23:59:40,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:40,170 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 132 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:40,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 265 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:40,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-01-08 23:59:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1606. [2025-01-08 23:59:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1414330218068536) internal successors, (1832), 1605 states have internal predecessors, (1832), 0 states have call successors, (0), 0 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:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1832 transitions. [2025-01-08 23:59:40,203 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1832 transitions. Word has length 339 [2025-01-08 23:59:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:40,203 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1832 transitions. [2025-01-08 23:59:40,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1832 transitions. [2025-01-08 23:59:40,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-01-08 23:59:40,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:40,233 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:40,241 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:40,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:40,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:40,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:40,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1697925669, now seen corresponding path program 1 times [2025-01-08 23:59:40,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:40,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884240122] [2025-01-08 23:59:40,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:40,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:40,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-01-08 23:59:40,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-01-08 23:59:40,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:40,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 464 proven. 130 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-01-08 23:59:41,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:41,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884240122] [2025-01-08 23:59:41,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884240122] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:41,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237178927] [2025-01-08 23:59:41,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:41,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:41,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:41,231 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:41,234 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:41,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-01-08 23:59:41,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-01-08 23:59:41,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:41,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:41,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:59:41,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-01-08 23:59:41,800 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:41,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237178927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:41,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:41,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-08 23:59:41,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113291407] [2025-01-08 23:59:41,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:41,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:41,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:41,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:41,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:41,803 INFO L87 Difference]: Start difference. First operand 1606 states and 1832 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:42,299 INFO L93 Difference]: Finished difference Result 3210 states and 3683 transitions. [2025-01-08 23:59:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:42,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 450 [2025-01-08 23:59:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:42,306 INFO L225 Difference]: With dead ends: 3210 [2025-01-08 23:59:42,307 INFO L226 Difference]: Without dead ends: 1784 [2025-01-08 23:59:42,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:42,309 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 78 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:42,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 54 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:42,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-01-08 23:59:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1784. [2025-01-08 23:59:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.134043746494672) internal successors, (2022), 1783 states have internal predecessors, (2022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2022 transitions. [2025-01-08 23:59:42,343 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2022 transitions. Word has length 450 [2025-01-08 23:59:42,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:42,343 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2022 transitions. [2025-01-08 23:59:42,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2022 transitions. [2025-01-08 23:59:42,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-08 23:59:42,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:42,351 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:42,360 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:42,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:42,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:42,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:42,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1700796479, now seen corresponding path program 1 times [2025-01-08 23:59:42,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:42,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448636544] [2025-01-08 23:59:42,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:42,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:42,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-08 23:59:42,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-08 23:59:42,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:42,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 788 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-01-08 23:59:43,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:43,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448636544] [2025-01-08 23:59:43,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448636544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:43,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:43,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:43,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576727391] [2025-01-08 23:59:43,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:43,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:43,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:43,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:43,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:43,010 INFO L87 Difference]: Start difference. First operand 1784 states and 2022 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:43,544 INFO L93 Difference]: Finished difference Result 4100 states and 4666 transitions. [2025-01-08 23:59:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:43,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 519 [2025-01-08 23:59:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:43,552 INFO L225 Difference]: With dead ends: 4100 [2025-01-08 23:59:43,552 INFO L226 Difference]: Without dead ends: 2318 [2025-01-08 23:59:43,555 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:43,556 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:43,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 76 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-01-08 23:59:43,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2025-01-08 23:59:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.1294997662459092) internal successors, (2416), 2139 states have internal predecessors, (2416), 0 states have call successors, (0), 0 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:43,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2416 transitions. [2025-01-08 23:59:43,597 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2416 transitions. Word has length 519 [2025-01-08 23:59:43,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:43,597 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2416 transitions. [2025-01-08 23:59:43,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:43,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2416 transitions. [2025-01-08 23:59:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-01-08 23:59:43,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:43,606 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:43,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:59:43,606 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:43,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:43,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2011600344, now seen corresponding path program 1 times [2025-01-08 23:59:43,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:43,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842727240] [2025-01-08 23:59:43,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:43,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:43,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-08 23:59:43,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-08 23:59:43,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:43,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-01-08 23:59:44,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:44,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842727240] [2025-01-08 23:59:44,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842727240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:44,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:44,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:44,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096399461] [2025-01-08 23:59:44,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:44,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:44,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:44,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:44,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:44,037 INFO L87 Difference]: Start difference. First operand 2140 states and 2416 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:44,643 INFO L93 Difference]: Finished difference Result 4307 states and 4863 transitions. [2025-01-08 23:59:44,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:44,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 530 [2025-01-08 23:59:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:44,653 INFO L225 Difference]: With dead ends: 4307 [2025-01-08 23:59:44,653 INFO L226 Difference]: Without dead ends: 2318 [2025-01-08 23:59:44,655 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:44,656 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 123 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:44,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 17 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:59:44,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-01-08 23:59:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2025-01-08 23:59:44,688 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:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2326 transitions. [2025-01-08 23:59:44,692 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2326 transitions. Word has length 530 [2025-01-08 23:59:44,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:44,692 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2326 transitions. [2025-01-08 23:59:44,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:44,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2326 transitions. [2025-01-08 23:59:44,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-01-08 23:59:44,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:44,702 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:44,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:59:44,702 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:44,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash -191596141, now seen corresponding path program 1 times [2025-01-08 23:59:44,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:44,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346333396] [2025-01-08 23:59:44,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:44,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:44,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-01-08 23:59:44,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-01-08 23:59:44,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:44,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 572 proven. 23 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-08 23:59:45,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:45,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346333396] [2025-01-08 23:59:45,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346333396] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:45,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453999855] [2025-01-08 23:59:45,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:45,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:45,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:45,224 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:45,227 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:45,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-01-08 23:59:45,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-01-08 23:59:45,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:45,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:45,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:59:45,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-08 23:59:45,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:45,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453999855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:45,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:45,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:59:45,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236425305] [2025-01-08 23:59:45,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:45,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:45,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:45,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:45,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:45,968 INFO L87 Difference]: Start difference. First operand 2140 states and 2326 transitions. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:46,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:46,644 INFO L93 Difference]: Finished difference Result 4456 states and 4850 transitions. [2025-01-08 23:59:46,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:46,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 541 [2025-01-08 23:59:46,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:46,653 INFO L225 Difference]: With dead ends: 4456 [2025-01-08 23:59:46,654 INFO L226 Difference]: Without dead ends: 2496 [2025-01-08 23:59:46,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 539 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:46,657 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:46,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 45 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:59:46,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-01-08 23:59:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1962. [2025-01-08 23:59:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.0938296787353392) internal successors, (2145), 1961 states have internal predecessors, (2145), 0 states have call successors, (0), 0 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:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2145 transitions. [2025-01-08 23:59:46,705 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2145 transitions. Word has length 541 [2025-01-08 23:59:46,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:46,706 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2145 transitions. [2025-01-08 23:59:46,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2145 transitions. [2025-01-08 23:59:46,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2025-01-08 23:59:46,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:46,711 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:46,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 23:59:46,911 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,SelfDestructingSolverStorable10 [2025-01-08 23:59:46,912 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:46,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:46,912 INFO L85 PathProgramCache]: Analyzing trace with hash -487968953, now seen corresponding path program 1 times [2025-01-08 23:59:46,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:46,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208514950] [2025-01-08 23:59:46,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:46,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:46,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-01-08 23:59:46,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-01-08 23:59:46,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:46,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 744 proven. 93 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-01-08 23:59:47,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:47,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208514950] [2025-01-08 23:59:47,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208514950] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:47,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188251855] [2025-01-08 23:59:47,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:47,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:47,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:47,467 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:47,469 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:47,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-01-08 23:59:47,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-01-08 23:59:47,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:47,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:47,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:59:47,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 837 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-01-08 23:59:47,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:47,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188251855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:47,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:47,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:59:47,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920485527] [2025-01-08 23:59:47,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:47,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:47,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:47,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:47,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:47,906 INFO L87 Difference]: Start difference. First operand 1962 states and 2145 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:48,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:48,374 INFO L93 Difference]: Finished difference Result 4812 states and 5274 transitions. [2025-01-08 23:59:48,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:48,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 630 [2025-01-08 23:59:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:48,383 INFO L225 Difference]: With dead ends: 4812 [2025-01-08 23:59:48,383 INFO L226 Difference]: Without dead ends: 2852 [2025-01-08 23:59:48,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 629 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:48,387 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:48,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 51 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2025-01-08 23:59:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2025-01-08 23:59:48,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 1.0864197530864197) internal successors, (2904), 2673 states have internal predecessors, (2904), 0 states have call successors, (0), 0 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:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2904 transitions. [2025-01-08 23:59:48,438 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2904 transitions. Word has length 630 [2025-01-08 23:59:48,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:48,439 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 2904 transitions. [2025-01-08 23:59:48,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:48,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2904 transitions. [2025-01-08 23:59:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-01-08 23:59:48,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:48,448 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:48,457 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:48,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-08 23:59:48,652 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:48,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:48,653 INFO L85 PathProgramCache]: Analyzing trace with hash -754218185, now seen corresponding path program 1 times [2025-01-08 23:59:48,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:48,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364998175] [2025-01-08 23:59:48,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:48,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:48,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-01-08 23:59:48,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-01-08 23:59:48,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:48,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1094 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-01-08 23:59:49,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:49,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364998175] [2025-01-08 23:59:49,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364998175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:49,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:49,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:49,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759602079] [2025-01-08 23:59:49,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:49,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:49,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:49,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:49,124 INFO L87 Difference]: Start difference. First operand 2674 states and 2904 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:49,470 INFO L93 Difference]: Finished difference Result 5702 states and 6190 transitions. [2025-01-08 23:59:49,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:49,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 632 [2025-01-08 23:59:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:49,479 INFO L225 Difference]: With dead ends: 5702 [2025-01-08 23:59:49,479 INFO L226 Difference]: Without dead ends: 2852 [2025-01-08 23:59:49,483 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:49,483 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:49,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 240 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:59:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2025-01-08 23:59:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2025-01-08 23:59:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.0768151525780427) internal successors, (3070), 2851 states have internal predecessors, (3070), 0 states have call successors, (0), 0 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:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3070 transitions. [2025-01-08 23:59:49,529 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3070 transitions. Word has length 632 [2025-01-08 23:59:49,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:49,529 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 3070 transitions. [2025-01-08 23:59:49,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:49,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3070 transitions. [2025-01-08 23:59:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-01-08 23:59:49,536 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:49,537 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:49,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:59:49,537 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:49,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1128051206, now seen corresponding path program 1 times [2025-01-08 23:59:49,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:49,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350676583] [2025-01-08 23:59:49,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:49,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:49,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-08 23:59:49,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-08 23:59:49,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:49,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-01-08 23:59:49,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:49,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350676583] [2025-01-08 23:59:49,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350676583] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:49,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125455490] [2025-01-08 23:59:49,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:49,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:49,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:49,990 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:49,992 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:50,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-08 23:59:50,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-08 23:59:50,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:50,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:50,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:59:50,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-01-08 23:59:50,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:59:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-01-08 23:59:50,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125455490] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:59:50,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:59:50,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-08 23:59:50,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993480009] [2025-01-08 23:59:50,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:59:50,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 23:59:50,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:50,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 23:59:50,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:59:50,915 INFO L87 Difference]: Start difference. First operand 2852 states and 3070 transitions. Second operand has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:51,726 INFO L93 Difference]: Finished difference Result 7128 states and 7694 transitions. [2025-01-08 23:59:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:59:51,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 785 [2025-01-08 23:59:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:51,738 INFO L225 Difference]: With dead ends: 7128 [2025-01-08 23:59:51,738 INFO L226 Difference]: Without dead ends: 4278 [2025-01-08 23:59:51,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1572 GetRequests, 1568 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:51,741 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:51,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 56 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:59:51,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4278 states. [2025-01-08 23:59:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4278 to 3386. [2025-01-08 23:59:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.084490398818316) internal successors, (3671), 3385 states have internal predecessors, (3671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3671 transitions. [2025-01-08 23:59:51,794 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3671 transitions. Word has length 785 [2025-01-08 23:59:51,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:51,794 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 3671 transitions. [2025-01-08 23:59:51,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3671 transitions. [2025-01-08 23:59:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2025-01-08 23:59:51,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:51,808 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:51,817 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:52,008 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,SelfDestructingSolverStorable13 [2025-01-08 23:59:52,009 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:52,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:52,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1757960758, now seen corresponding path program 1 times [2025-01-08 23:59:52,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:52,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527282713] [2025-01-08 23:59:52,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:52,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:52,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 787 statements into 1 equivalence classes. [2025-01-08 23:59:52,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 787 of 787 statements. [2025-01-08 23:59:52,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:52,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2213 backedges. 1400 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2025-01-08 23:59:52,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:52,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527282713] [2025-01-08 23:59:52,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527282713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:52,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:52,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:52,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214217310] [2025-01-08 23:59:52,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:52,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:52,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:52,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:52,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:52,525 INFO L87 Difference]: Start difference. First operand 3386 states and 3671 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:52,877 INFO L93 Difference]: Finished difference Result 7660 states and 8339 transitions. [2025-01-08 23:59:52,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:52,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 787 [2025-01-08 23:59:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:52,886 INFO L225 Difference]: With dead ends: 7660 [2025-01-08 23:59:52,886 INFO L226 Difference]: Without dead ends: 4098 [2025-01-08 23:59:52,890 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:52,891 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:52,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 235 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:59:52,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2025-01-08 23:59:52,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3920. [2025-01-08 23:59:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3919 states have (on average 1.067619290635366) internal successors, (4184), 3919 states have internal predecessors, (4184), 0 states have call successors, (0), 0 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:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4184 transitions. [2025-01-08 23:59:52,937 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4184 transitions. Word has length 787 [2025-01-08 23:59:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:52,937 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 4184 transitions. [2025-01-08 23:59:52,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4184 transitions. [2025-01-08 23:59:52,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-01-08 23:59:52,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:52,945 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:52,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:59:52,945 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:52,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1100596503, now seen corresponding path program 1 times [2025-01-08 23:59:52,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:52,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152998736] [2025-01-08 23:59:52,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:52,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:52,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-01-08 23:59:53,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-01-08 23:59:53,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:53,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2213 backedges. 1538 proven. 0 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2025-01-08 23:59:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:53,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152998736] [2025-01-08 23:59:53,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152998736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:53,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:53,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:53,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432915835] [2025-01-08 23:59:53,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:53,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:53,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:53,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:53,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:53,512 INFO L87 Difference]: Start difference. First operand 3920 states and 4184 transitions. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:53,928 INFO L93 Difference]: Finished difference Result 8194 states and 8730 transitions. [2025-01-08 23:59:53,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:53,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 805 [2025-01-08 23:59:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:53,936 INFO L225 Difference]: With dead ends: 8194 [2025-01-08 23:59:53,936 INFO L226 Difference]: Without dead ends: 4276 [2025-01-08 23:59:53,940 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:53,940 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:53,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2025-01-08 23:59:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2025-01-08 23:59:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.065169636319258) internal successors, (4364), 4097 states have internal predecessors, (4364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4364 transitions. [2025-01-08 23:59:53,975 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4364 transitions. Word has length 805 [2025-01-08 23:59:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:53,975 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4364 transitions. [2025-01-08 23:59:53,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4364 transitions. [2025-01-08 23:59:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 883 [2025-01-08 23:59:53,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:53,984 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:53,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:59:53,984 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:53,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1637121145, now seen corresponding path program 1 times [2025-01-08 23:59:53,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:53,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369338159] [2025-01-08 23:59:53,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:53,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:54,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 882 statements into 1 equivalence classes. [2025-01-08 23:59:54,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 882 of 882 statements. [2025-01-08 23:59:54,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:54,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2790 backedges. 1670 proven. 0 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2025-01-08 23:59:54,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:54,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369338159] [2025-01-08 23:59:54,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369338159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:54,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:54,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:54,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066852708] [2025-01-08 23:59:54,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:54,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:54,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:54,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:54,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:54,616 INFO L87 Difference]: Start difference. First operand 4098 states and 4364 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:55,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:55,011 INFO L93 Difference]: Finished difference Result 8728 states and 9336 transitions. [2025-01-08 23:59:55,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:55,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 882 [2025-01-08 23:59:55,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:55,021 INFO L225 Difference]: With dead ends: 8728 [2025-01-08 23:59:55,021 INFO L226 Difference]: Without dead ends: 4454 [2025-01-08 23:59:55,024 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:55,024 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:55,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 220 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:55,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-01-08 23:59:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4276. [2025-01-08 23:59:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.063157894736842) internal successors, (4545), 4275 states have internal predecessors, (4545), 0 states have call successors, (0), 0 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:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4545 transitions. [2025-01-08 23:59:55,058 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4545 transitions. Word has length 882 [2025-01-08 23:59:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:55,059 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4545 transitions. [2025-01-08 23:59:55,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4545 transitions. [2025-01-08 23:59:55,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2025-01-08 23:59:55,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:55,067 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:55,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:59:55,068 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:55,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:55,068 INFO L85 PathProgramCache]: Analyzing trace with hash -155541736, now seen corresponding path program 1 times [2025-01-08 23:59:55,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:55,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676181395] [2025-01-08 23:59:55,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:55,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:55,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 952 statements into 1 equivalence classes. [2025-01-08 23:59:55,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 952 of 952 statements. [2025-01-08 23:59:55,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:55,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1865 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-01-08 23:59:56,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:56,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676181395] [2025-01-08 23:59:56,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676181395] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:56,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803881616] [2025-01-08 23:59:56,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:56,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:56,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:56,111 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:56,115 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:56,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 952 statements into 1 equivalence classes. [2025-01-08 23:59:56,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 952 of 952 statements. [2025-01-08 23:59:56,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:56,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:56,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 23:59:56,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1865 proven. 625 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2025-01-08 23:59:57,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:59:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1937 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-01-08 23:59:57,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803881616] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:57,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 23:59:57,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-01-08 23:59:57,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209769880] [2025-01-08 23:59:57,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:57,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:59:57,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:57,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:59:57,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:59:57,581 INFO L87 Difference]: Start difference. First operand 4276 states and 4545 transitions. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 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:58,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:58,158 INFO L93 Difference]: Finished difference Result 9262 states and 9853 transitions. [2025-01-08 23:59:58,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:58,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 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 952 [2025-01-08 23:59:58,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:58,168 INFO L225 Difference]: With dead ends: 9262 [2025-01-08 23:59:58,168 INFO L226 Difference]: Without dead ends: 4988 [2025-01-08 23:59:58,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1907 GetRequests, 1899 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:58,172 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 173 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:58,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 9 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:58,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-01-08 23:59:58,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4454. [2025-01-08 23:59:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0646754996631485) internal successors, (4741), 4453 states have internal predecessors, (4741), 0 states have call successors, (0), 0 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:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4741 transitions. [2025-01-08 23:59:58,215 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4741 transitions. Word has length 952 [2025-01-08 23:59:58,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:58,216 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4741 transitions. [2025-01-08 23:59:58,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 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:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4741 transitions. [2025-01-08 23:59:58,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 975 [2025-01-08 23:59:58,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:58,224 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:58,233 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:58,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:58,425 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:58,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:58,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1567320095, now seen corresponding path program 1 times [2025-01-08 23:59:58,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:58,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584773580] [2025-01-08 23:59:58,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:58,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:58,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 974 statements into 1 equivalence classes. [2025-01-08 23:59:58,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 974 of 974 statements. [2025-01-08 23:59:58,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:58,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 1500 proven. 0 refuted. 0 times theorem prover too weak. 1538 trivial. 0 not checked. [2025-01-08 23:59:59,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:59,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584773580] [2025-01-08 23:59:59,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584773580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:59,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:59,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:59:59,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521074793] [2025-01-08 23:59:59,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:59,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:59:59,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:59,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:59:59,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:59,182 INFO L87 Difference]: Start difference. First operand 4454 states and 4741 transitions. Second operand has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 6 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:59,902 INFO L93 Difference]: Finished difference Result 9134 states and 9712 transitions. [2025-01-08 23:59:59,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 23:59:59,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 6 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 974 [2025-01-08 23:59:59,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:59,911 INFO L225 Difference]: With dead ends: 9134 [2025-01-08 23:59:59,911 INFO L226 Difference]: Without dead ends: 4632 [2025-01-08 23:59:59,915 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:59,915 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:59,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 33 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:59:59,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-01-08 23:59:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2025-01-08 23:59:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0523242757691444) internal successors, (4686), 4453 states have internal predecessors, (4686), 0 states have call successors, (0), 0 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:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4686 transitions. [2025-01-08 23:59:59,960 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4686 transitions. Word has length 974 [2025-01-08 23:59:59,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:59,960 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4686 transitions. [2025-01-08 23:59:59,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 6 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:59,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4686 transitions. [2025-01-08 23:59:59,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1076 [2025-01-08 23:59:59,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:59,970 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, 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, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:59,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 23:59:59,970 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:59,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:59,971 INFO L85 PathProgramCache]: Analyzing trace with hash -211138015, now seen corresponding path program 1 times [2025-01-08 23:59:59,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:59,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387250000] [2025-01-08 23:59:59,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:59,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:00,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1075 statements into 1 equivalence classes. [2025-01-09 00:00:00,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1075 of 1075 statements. [2025-01-09 00:00:00,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:00,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3728 backedges. 2665 proven. 72 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2025-01-09 00:00:01,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:01,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387250000] [2025-01-09 00:00:01,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387250000] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:01,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628605945] [2025-01-09 00:00:01,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:01,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:01,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:01,102 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-09 00:00:01,103 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-09 00:00:01,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1075 statements into 1 equivalence classes. [2025-01-09 00:00:01,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1075 of 1075 statements. [2025-01-09 00:00:01,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:01,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:01,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:00:01,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3728 backedges. 1062 proven. 0 refuted. 0 times theorem prover too weak. 2666 trivial. 0 not checked. [2025-01-09 00:00:01,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:00:01,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628605945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:01,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:00:01,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:00:01,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816142901] [2025-01-09 00:00:01,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:01,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:01,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:01,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:01,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:00:01,511 INFO L87 Difference]: Start difference. First operand 4454 states and 4686 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-09 00:00:01,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:01,865 INFO L93 Difference]: Finished difference Result 9262 states and 9731 transitions. [2025-01-09 00:00:01,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:01,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 1075 [2025-01-09 00:00:01,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:01,876 INFO L225 Difference]: With dead ends: 9262 [2025-01-09 00:00:01,877 INFO L226 Difference]: Without dead ends: 4632 [2025-01-09 00:00:01,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1079 GetRequests, 1075 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:00:01,883 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 97 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:01,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 222 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 00:00:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-01-09 00:00:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2025-01-09 00:00:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0485066247473613) internal successors, (4669), 4453 states have internal predecessors, (4669), 0 states have call successors, (0), 0 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-09 00:00:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4669 transitions. [2025-01-09 00:00:01,942 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4669 transitions. Word has length 1075 [2025-01-09 00:00:01,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:01,943 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4669 transitions. [2025-01-09 00:00:01,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-09 00:00:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4669 transitions. [2025-01-09 00:00:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1179 [2025-01-09 00:00:01,955 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:01,956 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:01,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 00:00:02,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:02,157 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:02,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:02,158 INFO L85 PathProgramCache]: Analyzing trace with hash 396241347, now seen corresponding path program 1 times [2025-01-09 00:00:02,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:02,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35585212] [2025-01-09 00:00:02,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:02,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:02,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1178 statements into 1 equivalence classes. [2025-01-09 00:00:02,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1178 of 1178 statements. [2025-01-09 00:00:02,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:02,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4611 backedges. 1883 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2025-01-09 00:00:02,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:02,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35585212] [2025-01-09 00:00:02,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35585212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:02,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:02,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:02,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726927504] [2025-01-09 00:00:02,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:02,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:00:02,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:02,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:00:02,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:00:02,840 INFO L87 Difference]: Start difference. First operand 4454 states and 4669 transitions. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:03,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:03,253 INFO L93 Difference]: Finished difference Result 8928 states and 9361 transitions. [2025-01-09 00:00:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:00:03,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1178 [2025-01-09 00:00:03,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:03,260 INFO L225 Difference]: With dead ends: 8928 [2025-01-09 00:00:03,260 INFO L226 Difference]: Without dead ends: 4632 [2025-01-09 00:00:03,264 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-09 00:00:03,265 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:03,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 17 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 00:00:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-01-09 00:00:03,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2025-01-09 00:00:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0473837862115427) internal successors, (4664), 4453 states have internal predecessors, (4664), 0 states have call successors, (0), 0 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-09 00:00:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4664 transitions. [2025-01-09 00:00:03,315 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4664 transitions. Word has length 1178 [2025-01-09 00:00:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:03,316 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4664 transitions. [2025-01-09 00:00:03,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:03,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4664 transitions. [2025-01-09 00:00:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1197 [2025-01-09 00:00:03,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:03,328 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:03,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:00:03,329 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:03,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:03,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1569493645, now seen corresponding path program 1 times [2025-01-09 00:00:03,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:03,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840731721] [2025-01-09 00:00:03,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:03,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:03,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1196 statements into 1 equivalence classes. [2025-01-09 00:00:03,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1196 of 1196 statements. [2025-01-09 00:00:03,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:03,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 3500 proven. 72 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2025-01-09 00:00:04,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:04,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840731721] [2025-01-09 00:00:04,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840731721] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:04,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965140548] [2025-01-09 00:00:04,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:04,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:04,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:04,727 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-09 00:00:04,729 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-09 00:00:04,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1196 statements into 1 equivalence classes. [2025-01-09 00:00:04,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1196 of 1196 statements. [2025-01-09 00:00:04,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:04,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:05,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:00:05,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 3213 proven. 0 refuted. 0 times theorem prover too weak. 1479 trivial. 0 not checked. [2025-01-09 00:00:05,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:00:05,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965140548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:05,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:00:05,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-01-09 00:00:05,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866315011] [2025-01-09 00:00:05,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:05,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:00:05,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:05,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:00:05,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:00:05,356 INFO L87 Difference]: Start difference. First operand 4454 states and 4664 transitions. Second operand has 4 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:06,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:06,006 INFO L93 Difference]: Finished difference Result 9618 states and 10067 transitions. [2025-01-09 00:00:06,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:00:06,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1196 [2025-01-09 00:00:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:06,012 INFO L225 Difference]: With dead ends: 9618 [2025-01-09 00:00:06,012 INFO L226 Difference]: Without dead ends: 5344 [2025-01-09 00:00:06,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:00:06,018 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 67 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:06,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 41 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:00:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2025-01-09 00:00:06,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4988. [2025-01-09 00:00:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4987 states have (on average 1.04411469821536) internal successors, (5207), 4987 states have internal predecessors, (5207), 0 states have call successors, (0), 0 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-09 00:00:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5207 transitions. [2025-01-09 00:00:06,063 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5207 transitions. Word has length 1196 [2025-01-09 00:00:06,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:06,064 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 5207 transitions. [2025-01-09 00:00:06,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5207 transitions. [2025-01-09 00:00:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1328 [2025-01-09 00:00:06,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:06,078 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:06,088 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-09 00:00:06,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:06,279 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:06,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:06,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1142536197, now seen corresponding path program 1 times [2025-01-09 00:00:06,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:06,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131822278] [2025-01-09 00:00:06,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:06,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:06,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1327 statements into 1 equivalence classes. [2025-01-09 00:00:06,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1327 of 1327 statements. [2025-01-09 00:00:06,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:06,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5421 backedges. 3601 proven. 325 refuted. 0 times theorem prover too weak. 1495 trivial. 0 not checked. [2025-01-09 00:00:07,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:07,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131822278] [2025-01-09 00:00:07,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131822278] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:07,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996076797] [2025-01-09 00:00:07,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:07,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:07,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:07,587 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-09 00:00:07,588 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-09 00:00:07,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1327 statements into 1 equivalence classes. [2025-01-09 00:00:07,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1327 of 1327 statements. [2025-01-09 00:00:07,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:07,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:07,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 1594 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:00:07,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5421 backedges. 3507 proven. 0 refuted. 0 times theorem prover too weak. 1914 trivial. 0 not checked. [2025-01-09 00:00:08,780 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:00:08,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996076797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:08,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:00:08,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-09 00:00:08,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807867645] [2025-01-09 00:00:08,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:08,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:00:08,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:08,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:00:08,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:00:08,783 INFO L87 Difference]: Start difference. First operand 4988 states and 5207 transitions. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 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-09 00:00:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:09,359 INFO L93 Difference]: Finished difference Result 9974 states and 10415 transitions. [2025-01-09 00:00:09,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:00:09,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 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 1327 [2025-01-09 00:00:09,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:09,364 INFO L225 Difference]: With dead ends: 9974 [2025-01-09 00:00:09,365 INFO L226 Difference]: Without dead ends: 5166 [2025-01-09 00:00:09,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1331 GetRequests, 1325 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:00:09,369 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 67 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:09,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 43 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:00:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-01-09 00:00:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4988. [2025-01-09 00:00:09,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4987 states have (on average 1.0435131341487869) internal successors, (5204), 4987 states have internal predecessors, (5204), 0 states have call successors, (0), 0 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-09 00:00:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5204 transitions. [2025-01-09 00:00:09,409 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5204 transitions. Word has length 1327 [2025-01-09 00:00:09,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:09,410 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 5204 transitions. [2025-01-09 00:00:09,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 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-09 00:00:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5204 transitions. [2025-01-09 00:00:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1357 [2025-01-09 00:00:09,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:09,425 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:09,436 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-09 00:00:09,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 00:00:09,626 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:09,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:09,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1280153513, now seen corresponding path program 1 times [2025-01-09 00:00:09,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:09,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156817105] [2025-01-09 00:00:09,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:09,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:09,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1356 statements into 1 equivalence classes. [2025-01-09 00:00:09,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1356 of 1356 statements. [2025-01-09 00:00:09,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:09,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5505 backedges. 3233 proven. 95 refuted. 0 times theorem prover too weak. 2177 trivial. 0 not checked. [2025-01-09 00:00:10,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:10,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156817105] [2025-01-09 00:00:10,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156817105] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:10,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446117174] [2025-01-09 00:00:10,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:10,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:10,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:10,711 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-09 00:00:10,712 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-09 00:00:10,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1356 statements into 1 equivalence classes. [2025-01-09 00:00:10,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1356 of 1356 statements. [2025-01-09 00:00:10,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:10,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:10,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:00:11,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5505 backedges. 3328 proven. 0 refuted. 0 times theorem prover too weak. 2177 trivial. 0 not checked. [2025-01-09 00:00:11,237 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:00:11,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446117174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:11,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:00:11,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:00:11,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486408470] [2025-01-09 00:00:11,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:11,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:11,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:11,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:11,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:00:11,239 INFO L87 Difference]: Start difference. First operand 4988 states and 5204 transitions. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 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-09 00:00:11,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:11,673 INFO L93 Difference]: Finished difference Result 9974 states and 10409 transitions. [2025-01-09 00:00:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:11,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 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 1356 [2025-01-09 00:00:11,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:11,680 INFO L225 Difference]: With dead ends: 9974 [2025-01-09 00:00:11,680 INFO L226 Difference]: Without dead ends: 5166 [2025-01-09 00:00:11,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1359 GetRequests, 1355 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-09 00:00:11,685 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:11,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 217 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 00:00:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-01-09 00:00:11,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4810. [2025-01-09 00:00:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.033686837180287) internal successors, (4971), 4809 states have internal predecessors, (4971), 0 states have call successors, (0), 0 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-09 00:00:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4971 transitions. [2025-01-09 00:00:11,739 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4971 transitions. Word has length 1356 [2025-01-09 00:00:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:11,740 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 4971 transitions. [2025-01-09 00:00:11,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 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-09 00:00:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4971 transitions. [2025-01-09 00:00:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1617 [2025-01-09 00:00:11,758 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:11,759 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:11,769 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-09 00:00:11,959 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,SelfDestructingSolverStorable23 [2025-01-09 00:00:11,960 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:11,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:11,961 INFO L85 PathProgramCache]: Analyzing trace with hash 181179755, now seen corresponding path program 1 times [2025-01-09 00:00:11,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:11,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335218592] [2025-01-09 00:00:11,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:11,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:12,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1616 statements into 1 equivalence classes. [2025-01-09 00:00:12,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1616 of 1616 statements. [2025-01-09 00:00:12,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:12,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 8399 backedges. 5846 proven. 87 refuted. 0 times theorem prover too weak. 2466 trivial. 0 not checked. [2025-01-09 00:00:13,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:13,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335218592] [2025-01-09 00:00:13,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335218592] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:13,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374170819] [2025-01-09 00:00:13,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:13,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:13,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:13,217 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-09 00:00:13,220 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-09 00:00:13,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1616 statements into 1 equivalence classes. [2025-01-09 00:00:13,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1616 of 1616 statements. [2025-01-09 00:00:13,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:13,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:13,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 1942 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:00:13,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8399 backedges. 3789 proven. 0 refuted. 0 times theorem prover too weak. 4610 trivial. 0 not checked. [2025-01-09 00:00:13,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:00:13,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374170819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:13,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:00:13,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-09 00:00:13,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061197731] [2025-01-09 00:00:13,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:13,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:13,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:13,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:13,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:00:13,810 INFO L87 Difference]: Start difference. First operand 4810 states and 4971 transitions. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 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-09 00:00:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:14,179 INFO L93 Difference]: Finished difference Result 9796 states and 10127 transitions. [2025-01-09 00:00:14,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:14,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 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 1616 [2025-01-09 00:00:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:14,183 INFO L225 Difference]: With dead ends: 9796 [2025-01-09 00:00:14,184 INFO L226 Difference]: Without dead ends: 5166 [2025-01-09 00:00:14,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1620 GetRequests, 1615 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:00:14,187 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:14,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 45 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 00:00:14,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-01-09 00:00:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4810. [2025-01-09 00:00:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.033686837180287) internal successors, (4971), 4809 states have internal predecessors, (4971), 0 states have call successors, (0), 0 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-09 00:00:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4971 transitions. [2025-01-09 00:00:14,224 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4971 transitions. Word has length 1616 [2025-01-09 00:00:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:14,225 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 4971 transitions. [2025-01-09 00:00:14,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 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-09 00:00:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4971 transitions. [2025-01-09 00:00:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1681 [2025-01-09 00:00:14,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:14,240 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:14,248 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-09 00:00:14,442 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-09 00:00:14,442 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:14,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:14,443 INFO L85 PathProgramCache]: Analyzing trace with hash 710883851, now seen corresponding path program 1 times [2025-01-09 00:00:14,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:14,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56249358] [2025-01-09 00:00:14,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:14,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:14,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1680 statements into 1 equivalence classes. [2025-01-09 00:00:14,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1680 of 1680 statements. [2025-01-09 00:00:14,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:14,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8613 backedges. 5085 proven. 1169 refuted. 0 times theorem prover too weak. 2359 trivial. 0 not checked. [2025-01-09 00:00:16,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:16,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56249358] [2025-01-09 00:00:16,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56249358] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:16,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629715407] [2025-01-09 00:00:16,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:16,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:16,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:16,818 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:00:16,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 00:00:16,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1680 statements into 1 equivalence classes. [2025-01-09 00:00:17,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1680 of 1680 statements. [2025-01-09 00:00:17,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:17,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:17,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 2008 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:00:17,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8613 backedges. 2747 proven. 0 refuted. 0 times theorem prover too weak. 5866 trivial. 0 not checked. [2025-01-09 00:00:18,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:00:18,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629715407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:18,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:00:18,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-01-09 00:00:18,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643934213] [2025-01-09 00:00:18,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:18,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:00:18,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:18,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:00:18,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 00:00:18,703 INFO L87 Difference]: Start difference. First operand 4810 states and 4971 transitions. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 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-09 00:00:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:19,224 INFO L93 Difference]: Finished difference Result 9796 states and 10125 transitions. [2025-01-09 00:00:19,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:00:19,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 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 1680 [2025-01-09 00:00:19,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:19,229 INFO L225 Difference]: With dead ends: 9796 [2025-01-09 00:00:19,229 INFO L226 Difference]: Without dead ends: 4988 [2025-01-09 00:00:19,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1687 GetRequests, 1678 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 00:00:19,232 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 79 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:19,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 17 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:00:19,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-01-09 00:00:19,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4632. [2025-01-09 00:00:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.0304469876916433) internal successors, (4772), 4631 states have internal predecessors, (4772), 0 states have call successors, (0), 0 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-09 00:00:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4772 transitions. [2025-01-09 00:00:19,264 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4772 transitions. Word has length 1680 [2025-01-09 00:00:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:19,265 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4772 transitions. [2025-01-09 00:00:19,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 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-09 00:00:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4772 transitions. [2025-01-09 00:00:19,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1734 [2025-01-09 00:00:19,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:19,280 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 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, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:19,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 00:00:19,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:19,481 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:19,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1314377994, now seen corresponding path program 1 times [2025-01-09 00:00:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:19,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742248176] [2025-01-09 00:00:19,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:19,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1733 statements into 1 equivalence classes. [2025-01-09 00:00:19,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1733 of 1733 statements. [2025-01-09 00:00:19,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:19,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:22,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9783 backedges. 1707 proven. 0 refuted. 0 times theorem prover too weak. 8076 trivial. 0 not checked. [2025-01-09 00:00:22,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:22,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742248176] [2025-01-09 00:00:22,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742248176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:22,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:22,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:00:22,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949761526] [2025-01-09 00:00:22,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:22,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:00:22,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:22,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:00:22,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:00:22,320 INFO L87 Difference]: Start difference. First operand 4632 states and 4772 transitions. Second operand has 5 states, 5 states have (on average 64.4) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 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-09 00:00:22,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:22,879 INFO L93 Difference]: Finished difference Result 11233 states and 11606 transitions. [2025-01-09 00:00:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:00:22,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 64.4) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 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 1733 [2025-01-09 00:00:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:22,885 INFO L225 Difference]: With dead ends: 11233 [2025-01-09 00:00:22,885 INFO L226 Difference]: Without dead ends: 6768 [2025-01-09 00:00:22,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:00:22,888 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 127 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:22,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 20 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:00:22,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6768 states. [2025-01-09 00:00:22,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6768 to 5166. [2025-01-09 00:00:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5166 states, 5165 states have (on average 1.0348499515972895) internal successors, (5345), 5165 states have internal predecessors, (5345), 0 states have call successors, (0), 0 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-09 00:00:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5345 transitions. [2025-01-09 00:00:22,931 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5345 transitions. Word has length 1733 [2025-01-09 00:00:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:22,932 INFO L471 AbstractCegarLoop]: Abstraction has 5166 states and 5345 transitions. [2025-01-09 00:00:22,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.4) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 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-09 00:00:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5345 transitions. [2025-01-09 00:00:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1739 [2025-01-09 00:00:22,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:22,947 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:22,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 00:00:22,947 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:22,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:22,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1176428221, now seen corresponding path program 1 times [2025-01-09 00:00:22,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:22,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192513327] [2025-01-09 00:00:22,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:22,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:23,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1738 statements into 1 equivalence classes. [2025-01-09 00:00:23,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1738 of 1738 statements. [2025-01-09 00:00:23,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:23,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9838 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 9181 trivial. 0 not checked. [2025-01-09 00:00:23,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:23,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192513327] [2025-01-09 00:00:23,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192513327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:23,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:23,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:23,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313177938] [2025-01-09 00:00:23,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:23,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:00:23,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:23,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:00:23,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:00:23,927 INFO L87 Difference]: Start difference. First operand 5166 states and 5345 transitions. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 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-09 00:00:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:24,296 INFO L93 Difference]: Finished difference Result 10342 states and 10703 transitions. [2025-01-09 00:00:24,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:00:24,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 1738 [2025-01-09 00:00:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:24,301 INFO L225 Difference]: With dead ends: 10342 [2025-01-09 00:00:24,301 INFO L226 Difference]: Without dead ends: 5344 [2025-01-09 00:00:24,304 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-09 00:00:24,304 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:24,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 17 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 00:00:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2025-01-09 00:00:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5166. [2025-01-09 00:00:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5166 states, 5165 states have (on average 1.0340755082284607) internal successors, (5341), 5165 states have internal predecessors, (5341), 0 states have call successors, (0), 0 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-09 00:00:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5341 transitions. [2025-01-09 00:00:24,369 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5341 transitions. Word has length 1738 [2025-01-09 00:00:24,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:24,369 INFO L471 AbstractCegarLoop]: Abstraction has 5166 states and 5341 transitions. [2025-01-09 00:00:24,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 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-09 00:00:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5341 transitions. [2025-01-09 00:00:24,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1904 [2025-01-09 00:00:24,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:24,411 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 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] [2025-01-09 00:00:24,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 00:00:24,411 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:24,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:24,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1712658494, now seen corresponding path program 1 times [2025-01-09 00:00:24,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:24,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629971224] [2025-01-09 00:00:24,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:24,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:24,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1903 statements into 1 equivalence classes. [2025-01-09 00:00:24,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1903 of 1903 statements. [2025-01-09 00:00:24,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:24,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 11509 backedges. 2425 proven. 812 refuted. 0 times theorem prover too weak. 8272 trivial. 0 not checked. [2025-01-09 00:00:26,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:26,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629971224] [2025-01-09 00:00:26,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629971224] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:26,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058580772] [2025-01-09 00:00:26,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:26,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:26,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:26,016 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:00:26,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 00:00:26,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1903 statements into 1 equivalence classes. [2025-01-09 00:00:26,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1903 of 1903 statements. [2025-01-09 00:00:26,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:26,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:26,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 2273 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 00:00:26,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11509 backedges. 3204 proven. 0 refuted. 0 times theorem prover too weak. 8305 trivial. 0 not checked. [2025-01-09 00:00:28,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:00:28,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058580772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:28,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:00:28,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 8 [2025-01-09 00:00:28,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743954660] [2025-01-09 00:00:28,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:28,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 00:00:28,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:28,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 00:00:28,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:00:28,117 INFO L87 Difference]: Start difference. First operand 5166 states and 5341 transitions. Second operand has 7 states, 7 states have (on average 52.857142857142854) internal successors, (370), 6 states have internal predecessors, (370), 0 states have call successors, (0), 0 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-09 00:00:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:28,600 INFO L93 Difference]: Finished difference Result 10201 states and 10550 transitions. [2025-01-09 00:00:28,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 00:00:28,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.857142857142854) internal successors, (370), 6 states have internal predecessors, (370), 0 states have call successors, (0), 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 1903 [2025-01-09 00:00:28,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:28,605 INFO L225 Difference]: With dead ends: 10201 [2025-01-09 00:00:28,605 INFO L226 Difference]: Without dead ends: 5166 [2025-01-09 00:00:28,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1907 GetRequests, 1900 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:00:28,608 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:28,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 28 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 00:00:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-01-09 00:00:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 5166. [2025-01-09 00:00:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5166 states, 5165 states have (on average 1.0333010648596321) internal successors, (5337), 5165 states have internal predecessors, (5337), 0 states have call successors, (0), 0 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-09 00:00:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5337 transitions. [2025-01-09 00:00:28,646 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5337 transitions. Word has length 1903 [2025-01-09 00:00:28,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:28,648 INFO L471 AbstractCegarLoop]: Abstraction has 5166 states and 5337 transitions. [2025-01-09 00:00:28,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.857142857142854) internal successors, (370), 6 states have internal predecessors, (370), 0 states have call successors, (0), 0 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-09 00:00:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5337 transitions. [2025-01-09 00:00:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2036 [2025-01-09 00:00:28,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:28,669 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:28,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-09 00:00:28,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 00:00:28,869 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:28,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash -681619789, now seen corresponding path program 1 times [2025-01-09 00:00:28,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:28,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167129047] [2025-01-09 00:00:28,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:28,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:28,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2035 statements into 1 equivalence classes. [2025-01-09 00:00:29,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2035 of 2035 statements. [2025-01-09 00:00:29,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:29,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 13209 backedges. 1965 proven. 0 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2025-01-09 00:00:31,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:31,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167129047] [2025-01-09 00:00:31,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167129047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:31,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:31,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:00:31,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814912381] [2025-01-09 00:00:31,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:31,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:00:31,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:31,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:00:31,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:00:31,826 INFO L87 Difference]: Start difference. First operand 5166 states and 5337 transitions. Second operand has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 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-09 00:00:32,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:32,204 INFO L93 Difference]: Finished difference Result 9985 states and 10318 transitions. [2025-01-09 00:00:32,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:00:32,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 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 2035 [2025-01-09 00:00:32,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:32,205 INFO L225 Difference]: With dead ends: 9985 [2025-01-09 00:00:32,205 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:00:32,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09 00:00:32,209 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 110 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:32,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 15 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 00:00:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:00:32,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:00:32,210 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-09 00:00:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:00:32,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2035 [2025-01-09 00:00:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:32,211 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:00:32,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 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-09 00:00:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:00:32,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:00:32,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:00:32,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 00:00:32,217 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, 1, 1, 1, 1, 1] [2025-01-09 00:00:32,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.