./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label28.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/Problem16_label28.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 b327f04e85816300a772fdcab90c62f95ac5a620d1563dfbe08b64473c277d33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:07:33,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:07:34,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:07:34,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:07:34,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:07:34,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:07:34,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:07:34,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:07:34,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:07:34,090 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:07:34,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:07:34,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:07:34,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:07:34,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:07:34,091 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:07:34,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:07:34,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:07:34,091 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:07:34,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:07:34,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:07:34,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:07:34,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:07:34,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:07:34,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:07:34,094 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:07:34,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:07:34,094 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:07:34,094 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:07:34,094 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:07:34,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:07:34,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:07:34,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:07:34,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:07:34,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:07:34,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:07:34,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:07:34,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:07:34,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:07:34,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:07:34,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:07:34,096 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:07:34,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:07:34,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:07:34,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:07:34,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:07:34,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:07:34,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:07:34,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:07:34,097 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 -> b327f04e85816300a772fdcab90c62f95ac5a620d1563dfbe08b64473c277d33 [2025-01-09 00:07:34,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:07:34,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:07:34,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:07:34,426 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:07:34,427 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:07:34,428 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label28.c [2025-01-09 00:07:35,739 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7fbf8be41/d3eae12b9a2b4c2caf629dfe9f670952/FLAGd34a2742e [2025-01-09 00:07:36,177 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:07:36,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label28.c [2025-01-09 00:07:36,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7fbf8be41/d3eae12b9a2b4c2caf629dfe9f670952/FLAGd34a2742e [2025-01-09 00:07:36,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7fbf8be41/d3eae12b9a2b4c2caf629dfe9f670952 [2025-01-09 00:07:36,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:07:36,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:07:36,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:07:36,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:07:36,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:07:36,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:36,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5f0da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36, skipping insertion in model container [2025-01-09 00:07:36,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:36,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:07:36,551 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/Problem16_label28.c[6890,6903] [2025-01-09 00:07:36,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:07:36,921 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:07:36,946 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/Problem16_label28.c[6890,6903] [2025-01-09 00:07:37,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:07:37,118 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:07:37,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:37 WrapperNode [2025-01-09 00:07:37,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:07:37,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:07:37,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:07:37,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:07:37,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:37" (1/1) ... [2025-01-09 00:07:37,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:37" (1/1) ... [2025-01-09 00:07:37,303 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-01-09 00:07:37,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:07:37,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:07:37,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:07:37,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:07:37,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:37" (1/1) ... [2025-01-09 00:07:37,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:37" (1/1) ... [2025-01-09 00:07:37,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:37" (1/1) ... [2025-01-09 00:07:37,400 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-09 00:07:37,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:37" (1/1) ... [2025-01-09 00:07:37,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:37" (1/1) ... [2025-01-09 00:07:37,441 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:37" (1/1) ... [2025-01-09 00:07:37,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:37" (1/1) ... [2025-01-09 00:07:37,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:37" (1/1) ... [2025-01-09 00:07:37,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:37" (1/1) ... [2025-01-09 00:07:37,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:37" (1/1) ... [2025-01-09 00:07:37,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:07:37,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:07:37,512 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:07:37,512 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:07:37,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:37" (1/1) ... [2025-01-09 00:07:37,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:07:37,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:07:37,545 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-09 00:07:37,551 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-09 00:07:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:07:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:07:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:07:37,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:07:37,641 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:07:37,642 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:07:39,715 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-01-09 00:07:39,715 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:07:39,744 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:07:39,744 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:07:39,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:07:39 BoogieIcfgContainer [2025-01-09 00:07:39,745 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:07:39,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:07:39,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:07:39,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:07:39,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:07:36" (1/3) ... [2025-01-09 00:07:39,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f17b595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:07:39, skipping insertion in model container [2025-01-09 00:07:39,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:37" (2/3) ... [2025-01-09 00:07:39,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f17b595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:07:39, skipping insertion in model container [2025-01-09 00:07:39,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:07:39" (3/3) ... [2025-01-09 00:07:39,757 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label28.c [2025-01-09 00:07:39,773 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:07:39,775 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label28.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:07:39,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:07:39,869 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;@284dd967, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:07:39,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:07:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 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:07:39,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 00:07:39,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:39,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:39,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:39,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:39,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1864169478, now seen corresponding path program 1 times [2025-01-09 00:07:39,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:39,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22999209] [2025-01-09 00:07:39,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:39,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:39,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 00:07:40,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 00:07:40,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:40,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:40,421 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-09 00:07:40,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:40,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22999209] [2025-01-09 00:07:40,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22999209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:40,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:40,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:40,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911371355] [2025-01-09 00:07:40,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:40,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:07:40,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:40,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:07:40,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:07:40,451 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:07:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:43,096 INFO L93 Difference]: Finished difference Result 1456 states and 2760 transitions. [2025-01-09 00:07:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:07:43,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 00:07:43,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:43,123 INFO L225 Difference]: With dead ends: 1456 [2025-01-09 00:07:43,124 INFO L226 Difference]: Without dead ends: 991 [2025-01-09 00:07:43,128 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-09 00:07:43,132 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 1023 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:43,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 96 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 00:07:43,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-01-09 00:07:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2025-01-09 00:07:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.497979797979798) internal successors, (1483), 990 states have internal predecessors, (1483), 0 states have call successors, (0), 0 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:07:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1483 transitions. [2025-01-09 00:07:43,210 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1483 transitions. Word has length 66 [2025-01-09 00:07:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:43,210 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1483 transitions. [2025-01-09 00:07:43,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:07:43,211 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1483 transitions. [2025-01-09 00:07:43,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-01-09 00:07:43,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:43,224 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:43,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:07:43,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:43,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1939189870, now seen corresponding path program 1 times [2025-01-09 00:07:43,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:43,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718829329] [2025-01-09 00:07:43,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:43,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:43,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-01-09 00:07:43,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-01-09 00:07:43,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:43,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:07:43,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:43,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718829329] [2025-01-09 00:07:43,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718829329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:43,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:43,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:43,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234274361] [2025-01-09 00:07:43,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:43,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:43,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:43,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:43,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:43,652 INFO L87 Difference]: Start difference. First operand 991 states and 1483 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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:07:45,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:45,016 INFO L93 Difference]: Finished difference Result 1980 states and 3168 transitions. [2025-01-09 00:07:45,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:45,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2025-01-09 00:07:45,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:45,025 INFO L225 Difference]: With dead ends: 1980 [2025-01-09 00:07:45,025 INFO L226 Difference]: Without dead ends: 1320 [2025-01-09 00:07:45,028 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-09 00:07:45,031 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 279 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:45,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 539 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:07:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-01-09 00:07:45,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-01-09 00:07:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.423805913570887) internal successors, (1878), 1319 states have internal predecessors, (1878), 0 states have call successors, (0), 0 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:07:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1878 transitions. [2025-01-09 00:07:45,081 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1878 transitions. Word has length 256 [2025-01-09 00:07:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:45,084 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1878 transitions. [2025-01-09 00:07:45,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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:07:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1878 transitions. [2025-01-09 00:07:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-01-09 00:07:45,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:45,091 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:07:45,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:07:45,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:45,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:45,096 INFO L85 PathProgramCache]: Analyzing trace with hash 239059007, now seen corresponding path program 1 times [2025-01-09 00:07:45,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:45,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175641100] [2025-01-09 00:07:45,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:45,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:45,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-01-09 00:07:45,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-01-09 00:07:45,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:45,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:45,417 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-01-09 00:07:45,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:45,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175641100] [2025-01-09 00:07:45,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175641100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:45,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:45,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:07:45,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603738500] [2025-01-09 00:07:45,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:45,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:45,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:45,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:45,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:45,420 INFO L87 Difference]: Start difference. First operand 1320 states and 1878 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 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:07:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:46,859 INFO L93 Difference]: Finished difference Result 3296 states and 4947 transitions. [2025-01-09 00:07:46,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:46,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2025-01-09 00:07:46,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:46,870 INFO L225 Difference]: With dead ends: 3296 [2025-01-09 00:07:46,870 INFO L226 Difference]: Without dead ends: 1978 [2025-01-09 00:07:46,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:46,876 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 339 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:46,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 156 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:07:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2025-01-09 00:07:46,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2025-01-09 00:07:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1978 states, 1977 states have (on average 1.1335356600910471) internal successors, (2241), 1977 states have internal predecessors, (2241), 0 states have call successors, (0), 0 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:07:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2241 transitions. [2025-01-09 00:07:46,925 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2241 transitions. Word has length 259 [2025-01-09 00:07:46,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:46,925 INFO L471 AbstractCegarLoop]: Abstraction has 1978 states and 2241 transitions. [2025-01-09 00:07:46,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 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:07:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2241 transitions. [2025-01-09 00:07:46,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-01-09 00:07:46,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:46,931 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:46,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:07:46,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:46,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:46,932 INFO L85 PathProgramCache]: Analyzing trace with hash 748417278, now seen corresponding path program 1 times [2025-01-09 00:07:46,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:46,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589954265] [2025-01-09 00:07:46,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:46,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:46,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-01-09 00:07:46,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-01-09 00:07:46,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:46,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-01-09 00:07:47,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:47,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589954265] [2025-01-09 00:07:47,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589954265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:47,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:47,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:07:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519462237] [2025-01-09 00:07:47,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:47,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:47,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:47,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:47,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:47,246 INFO L87 Difference]: Start difference. First operand 1978 states and 2241 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 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:07:48,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:48,114 INFO L93 Difference]: Finished difference Result 3954 states and 4508 transitions. [2025-01-09 00:07:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:48,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 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 385 [2025-01-09 00:07:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:48,123 INFO L225 Difference]: With dead ends: 3954 [2025-01-09 00:07:48,123 INFO L226 Difference]: Without dead ends: 2307 [2025-01-09 00:07:48,125 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-09 00:07:48,126 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 262 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:48,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 31 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:07:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-01-09 00:07:48,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-01-09 00:07:48,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.092801387684302) internal successors, (2520), 2306 states have internal predecessors, (2520), 0 states have call successors, (0), 0 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:07:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 2520 transitions. [2025-01-09 00:07:48,176 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 2520 transitions. Word has length 385 [2025-01-09 00:07:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:48,177 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 2520 transitions. [2025-01-09 00:07:48,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 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:07:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 2520 transitions. [2025-01-09 00:07:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-01-09 00:07:48,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:48,191 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:48,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:07:48,192 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:48,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1074289520, now seen corresponding path program 1 times [2025-01-09 00:07:48,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:48,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398208522] [2025-01-09 00:07:48,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:48,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:48,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-01-09 00:07:48,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-01-09 00:07:48,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:48,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 729 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-09 00:07:48,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:48,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398208522] [2025-01-09 00:07:48,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398208522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:48,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:48,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:48,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021105428] [2025-01-09 00:07:48,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:48,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:48,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:48,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:48,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:48,890 INFO L87 Difference]: Start difference. First operand 2307 states and 2520 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 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:07:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:49,876 INFO L93 Difference]: Finished difference Result 5928 states and 6509 transitions. [2025-01-09 00:07:49,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:49,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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 643 [2025-01-09 00:07:49,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:49,892 INFO L225 Difference]: With dead ends: 5928 [2025-01-09 00:07:49,892 INFO L226 Difference]: Without dead ends: 3952 [2025-01-09 00:07:49,895 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-09 00:07:49,896 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:49,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 427 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:07:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-01-09 00:07:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2025-01-09 00:07:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.0627689192609466) internal successors, (4199), 3951 states have internal predecessors, (4199), 0 states have call successors, (0), 0 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:07:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4199 transitions. [2025-01-09 00:07:49,979 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4199 transitions. Word has length 643 [2025-01-09 00:07:49,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:49,980 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4199 transitions. [2025-01-09 00:07:49,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 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:07:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4199 transitions. [2025-01-09 00:07:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-01-09 00:07:50,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:50,010 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:50,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:07:50,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:50,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:50,012 INFO L85 PathProgramCache]: Analyzing trace with hash 765905561, now seen corresponding path program 1 times [2025-01-09 00:07:50,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:50,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854066011] [2025-01-09 00:07:50,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:50,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:50,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-01-09 00:07:50,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-01-09 00:07:50,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:50,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 775 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-01-09 00:07:50,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:50,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854066011] [2025-01-09 00:07:50,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854066011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:50,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:50,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:50,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876781144] [2025-01-09 00:07:50,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:50,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:50,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:50,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:50,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:50,559 INFO L87 Difference]: Start difference. First operand 3952 states and 4199 transitions. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 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:07:51,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:51,519 INFO L93 Difference]: Finished difference Result 9218 states and 9907 transitions. [2025-01-09 00:07:51,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:51,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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 706 [2025-01-09 00:07:51,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:51,540 INFO L225 Difference]: With dead ends: 9218 [2025-01-09 00:07:51,540 INFO L226 Difference]: Without dead ends: 5597 [2025-01-09 00:07:51,546 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-09 00:07:51,547 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 171 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:51,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 432 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:07:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-01-09 00:07:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2025-01-09 00:07:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.0546819156540386) internal successors, (5902), 5596 states have internal predecessors, (5902), 0 states have call successors, (0), 0 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:07:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 5902 transitions. [2025-01-09 00:07:51,655 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 5902 transitions. Word has length 706 [2025-01-09 00:07:51,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:51,656 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 5902 transitions. [2025-01-09 00:07:51,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 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:07:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 5902 transitions. [2025-01-09 00:07:51,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-01-09 00:07:51,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:51,666 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:51,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:07:51,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:51,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:51,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1255024108, now seen corresponding path program 1 times [2025-01-09 00:07:51,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:51,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450135655] [2025-01-09 00:07:51,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:51,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:51,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-01-09 00:07:51,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-01-09 00:07:51,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:51,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:52,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1011 backedges. 569 proven. 3 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-01-09 00:07:52,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:52,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450135655] [2025-01-09 00:07:52,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450135655] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:07:52,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60198937] [2025-01-09 00:07:52,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:52,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:07:52,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:07:52,842 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-09 00:07:52,843 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-09 00:07:52,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-01-09 00:07:53,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-01-09 00:07:53,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:53,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:53,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:07:53,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:07:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1011 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 503 trivial. 0 not checked. [2025-01-09 00:07:53,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:07:53,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60198937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:53,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:07:53,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:07:53,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955223192] [2025-01-09 00:07:53,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:53,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:53,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:53,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:53,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:07:53,402 INFO L87 Difference]: Start difference. First operand 5597 states and 5902 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 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-09 00:07:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:54,256 INFO L93 Difference]: Finished difference Result 10863 states and 11471 transitions. [2025-01-09 00:07:54,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:54,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 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 731 [2025-01-09 00:07:54,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:54,272 INFO L225 Difference]: With dead ends: 10863 [2025-01-09 00:07:54,272 INFO L226 Difference]: Without dead ends: 5597 [2025-01-09 00:07:54,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 731 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:07:54,280 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 258 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:54,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 377 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:07:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-01-09 00:07:54,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2025-01-09 00:07:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.046819156540386) internal successors, (5858), 5596 states have internal predecessors, (5858), 0 states have call successors, (0), 0 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:07:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 5858 transitions. [2025-01-09 00:07:54,376 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 5858 transitions. Word has length 731 [2025-01-09 00:07:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:54,377 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 5858 transitions. [2025-01-09 00:07:54,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 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-09 00:07:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 5858 transitions. [2025-01-09 00:07:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2025-01-09 00:07:54,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:54,388 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:54,398 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-09 00:07:54,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:07:54,589 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:54,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:54,590 INFO L85 PathProgramCache]: Analyzing trace with hash 181140898, now seen corresponding path program 1 times [2025-01-09 00:07:54,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:54,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744401245] [2025-01-09 00:07:54,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:54,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:54,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 834 statements into 1 equivalence classes. [2025-01-09 00:07:54,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 834 of 834 statements. [2025-01-09 00:07:54,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:54,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 983 proven. 0 refuted. 0 times theorem prover too weak. 503 trivial. 0 not checked. [2025-01-09 00:07:55,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:55,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744401245] [2025-01-09 00:07:55,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744401245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:55,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:55,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:55,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427397110] [2025-01-09 00:07:55,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:55,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:55,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:55,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:55,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:55,472 INFO L87 Difference]: Start difference. First operand 5597 states and 5858 transitions. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 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:07:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:56,344 INFO L93 Difference]: Finished difference Result 12508 states and 13170 transitions. [2025-01-09 00:07:56,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:56,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 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 834 [2025-01-09 00:07:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:56,366 INFO L225 Difference]: With dead ends: 12508 [2025-01-09 00:07:56,366 INFO L226 Difference]: Without dead ends: 7242 [2025-01-09 00:07:56,373 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-09 00:07:56,374 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 233 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:56,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 81 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:07:56,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7242 states. [2025-01-09 00:07:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7242 to 6913. [2025-01-09 00:07:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6913 states, 6912 states have (on average 1.0418113425925926) internal successors, (7201), 6912 states have internal predecessors, (7201), 0 states have call successors, (0), 0 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:07:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 7201 transitions. [2025-01-09 00:07:56,482 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 7201 transitions. Word has length 834 [2025-01-09 00:07:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:56,484 INFO L471 AbstractCegarLoop]: Abstraction has 6913 states and 7201 transitions. [2025-01-09 00:07:56,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 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:07:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 7201 transitions. [2025-01-09 00:07:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1107 [2025-01-09 00:07:56,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:56,500 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:07:56,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:07:56,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:56,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:56,501 INFO L85 PathProgramCache]: Analyzing trace with hash 947909450, now seen corresponding path program 1 times [2025-01-09 00:07:56,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:56,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482884046] [2025-01-09 00:07:56,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:56,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:56,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1106 statements into 1 equivalence classes. [2025-01-09 00:07:56,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1106 of 1106 statements. [2025-01-09 00:07:56,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:56,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2707 backedges. 1450 proven. 0 refuted. 0 times theorem prover too weak. 1257 trivial. 0 not checked. [2025-01-09 00:07:57,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:57,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482884046] [2025-01-09 00:07:57,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482884046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:57,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:57,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:57,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019146492] [2025-01-09 00:07:57,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:57,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:57,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:57,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:57,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:57,733 INFO L87 Difference]: Start difference. First operand 6913 states and 7201 transitions. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 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:07:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:58,504 INFO L93 Difference]: Finished difference Result 14811 states and 15465 transitions. [2025-01-09 00:07:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:58,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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 1106 [2025-01-09 00:07:58,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:58,524 INFO L225 Difference]: With dead ends: 14811 [2025-01-09 00:07:58,525 INFO L226 Difference]: Without dead ends: 8229 [2025-01-09 00:07:58,532 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-09 00:07:58,532 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:58,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 439 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:07:58,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2025-01-09 00:07:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 7900. [2025-01-09 00:07:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.0374730978604887) internal successors, (8195), 7899 states have internal predecessors, (8195), 0 states have call successors, (0), 0 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:07:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8195 transitions. [2025-01-09 00:07:58,642 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8195 transitions. Word has length 1106 [2025-01-09 00:07:58,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:58,643 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 8195 transitions. [2025-01-09 00:07:58,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 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:07:58,644 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8195 transitions. [2025-01-09 00:07:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1125 [2025-01-09 00:07:58,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:58,661 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:58,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:07:58,662 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:58,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:58,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1944991019, now seen corresponding path program 1 times [2025-01-09 00:07:58,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:58,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383076581] [2025-01-09 00:07:58,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:58,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:58,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1124 statements into 1 equivalence classes. [2025-01-09 00:07:58,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1124 of 1124 statements. [2025-01-09 00:07:58,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:58,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2720 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2025-01-09 00:07:59,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:59,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383076581] [2025-01-09 00:07:59,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383076581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:59,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:59,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:59,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454270015] [2025-01-09 00:07:59,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:59,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:59,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:59,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:59,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:59,386 INFO L87 Difference]: Start difference. First operand 7900 states and 8195 transitions. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 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:08:00,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:00,052 INFO L93 Difference]: Finished difference Result 16127 states and 16721 transitions. [2025-01-09 00:08:00,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:00,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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 1124 [2025-01-09 00:08:00,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:00,066 INFO L225 Difference]: With dead ends: 16127 [2025-01-09 00:08:00,066 INFO L226 Difference]: Without dead ends: 7900 [2025-01-09 00:08:00,074 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-09 00:08:00,075 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 240 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:00,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 410 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:08:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-01-09 00:08:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7571. [2025-01-09 00:08:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7571 states, 7570 states have (on average 1.0276089828269486) internal successors, (7779), 7570 states have internal predecessors, (7779), 0 states have call successors, (0), 0 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:08:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 7779 transitions. [2025-01-09 00:08:00,203 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 7779 transitions. Word has length 1124 [2025-01-09 00:08:00,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:00,204 INFO L471 AbstractCegarLoop]: Abstraction has 7571 states and 7779 transitions. [2025-01-09 00:08:00,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 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:08:00,204 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 7779 transitions. [2025-01-09 00:08:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1236 [2025-01-09 00:08:00,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:00,225 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:00,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:08:00,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:00,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:00,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2145068046, now seen corresponding path program 1 times [2025-01-09 00:08:00,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:00,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950010571] [2025-01-09 00:08:00,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:00,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:00,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1235 statements into 1 equivalence classes. [2025-01-09 00:08:00,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1235 of 1235 statements. [2025-01-09 00:08:00,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:00,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3034 backedges. 2147 proven. 121 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-01-09 00:08:02,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:02,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950010571] [2025-01-09 00:08:02,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950010571] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:02,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085457562] [2025-01-09 00:08:02,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:02,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:02,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:02,489 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-09 00:08:02,492 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-09 00:08:02,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1235 statements into 1 equivalence classes. [2025-01-09 00:08:02,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1235 of 1235 statements. [2025-01-09 00:08:02,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:02,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:02,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:08:02,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3034 backedges. 1484 proven. 201 refuted. 0 times theorem prover too weak. 1349 trivial. 0 not checked. [2025-01-09 00:08:05,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:08:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3034 backedges. 1484 proven. 201 refuted. 0 times theorem prover too weak. 1349 trivial. 0 not checked. [2025-01-09 00:08:09,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085457562] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:08:09,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:08:09,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 11 [2025-01-09 00:08:09,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049256004] [2025-01-09 00:08:09,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:08:09,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 00:08:09,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:09,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 00:08:09,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 00:08:09,829 INFO L87 Difference]: Start difference. First operand 7571 states and 7779 transitions. Second operand has 11 states, 11 states have (on average 162.36363636363637) internal successors, (1786), 11 states have internal predecessors, (1786), 0 states have call successors, (0), 0 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:08:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:13,614 INFO L93 Difference]: Finished difference Result 15799 states and 16246 transitions. [2025-01-09 00:08:13,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 00:08:13,615 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 162.36363636363637) internal successors, (1786), 11 states have internal predecessors, (1786), 0 states have call successors, (0), 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 1235 [2025-01-09 00:08:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:13,630 INFO L225 Difference]: With dead ends: 15799 [2025-01-09 00:08:13,630 INFO L226 Difference]: Without dead ends: 8559 [2025-01-09 00:08:13,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2484 GetRequests, 2472 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-09 00:08:13,639 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 985 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 7761 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 7885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 7761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:13,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 104 Invalid, 7885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 7761 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-09 00:08:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8559 states. [2025-01-09 00:08:13,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8559 to 7900. [2025-01-09 00:08:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.026459045448791) internal successors, (8108), 7899 states have internal predecessors, (8108), 0 states have call successors, (0), 0 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:08:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8108 transitions. [2025-01-09 00:08:13,714 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8108 transitions. Word has length 1235 [2025-01-09 00:08:13,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:13,715 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 8108 transitions. [2025-01-09 00:08:13,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 162.36363636363637) internal successors, (1786), 11 states have internal predecessors, (1786), 0 states have call successors, (0), 0 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:08:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8108 transitions. [2025-01-09 00:08:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1531 [2025-01-09 00:08:13,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:13,737 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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:08:13,746 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-09 00:08:13,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:13,941 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:13,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:13,942 INFO L85 PathProgramCache]: Analyzing trace with hash -79332961, now seen corresponding path program 1 times [2025-01-09 00:08:13,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:13,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856873637] [2025-01-09 00:08:13,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:13,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:14,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1530 statements into 1 equivalence classes. [2025-01-09 00:08:14,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1530 of 1530 statements. [2025-01-09 00:08:14,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:14,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4482 backedges. 2124 proven. 0 refuted. 0 times theorem prover too weak. 2358 trivial. 0 not checked. [2025-01-09 00:08:15,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:15,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856873637] [2025-01-09 00:08:15,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856873637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:15,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:15,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:15,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666782314] [2025-01-09 00:08:15,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:15,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:08:15,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:15,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:08:15,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:08:15,125 INFO L87 Difference]: Start difference. First operand 7900 states and 8108 transitions. Second operand has 4 states, 4 states have (on average 167.5) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 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:08:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:16,177 INFO L93 Difference]: Finished difference Result 20735 states and 21319 transitions. [2025-01-09 00:08:16,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:08:16,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 167.5) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 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 1530 [2025-01-09 00:08:16,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:16,202 INFO L225 Difference]: With dead ends: 20735 [2025-01-09 00:08:16,203 INFO L226 Difference]: Without dead ends: 13166 [2025-01-09 00:08:16,213 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:08:16,214 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 369 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:16,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 78 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:08:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13166 states. [2025-01-09 00:08:16,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13166 to 12506. [2025-01-09 00:08:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0274290283886445) internal successors, (12848), 12505 states have internal predecessors, (12848), 0 states have call successors, (0), 0 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:08:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12848 transitions. [2025-01-09 00:08:16,358 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12848 transitions. Word has length 1530 [2025-01-09 00:08:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:16,358 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 12848 transitions. [2025-01-09 00:08:16,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 167.5) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 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:08:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12848 transitions. [2025-01-09 00:08:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1702 [2025-01-09 00:08:16,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:16,387 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:16,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:08:16,388 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:16,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:16,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1271622851, now seen corresponding path program 1 times [2025-01-09 00:08:16,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:16,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631589706] [2025-01-09 00:08:16,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:16,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:16,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1701 statements into 1 equivalence classes. [2025-01-09 00:08:16,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1701 of 1701 statements. [2025-01-09 00:08:16,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:16,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5601 backedges. 1719 proven. 0 refuted. 0 times theorem prover too weak. 3882 trivial. 0 not checked. [2025-01-09 00:08:17,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:17,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631589706] [2025-01-09 00:08:17,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631589706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:17,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:17,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:17,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365490494] [2025-01-09 00:08:17,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:17,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:17,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:17,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:17,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:17,431 INFO L87 Difference]: Start difference. First operand 12506 states and 12848 transitions. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 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:08:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:18,131 INFO L93 Difference]: Finished difference Result 26984 states and 27796 transitions. [2025-01-09 00:08:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:18,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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 1701 [2025-01-09 00:08:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:18,165 INFO L225 Difference]: With dead ends: 26984 [2025-01-09 00:08:18,165 INFO L226 Difference]: Without dead ends: 14480 [2025-01-09 00:08:18,179 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-09 00:08:18,180 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 162 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:18,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 429 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:08:18,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-01-09 00:08:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14151. [2025-01-09 00:08:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0255123674911661) internal successors, (14511), 14150 states have internal predecessors, (14511), 0 states have call successors, (0), 0 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:08:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14511 transitions. [2025-01-09 00:08:18,342 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14511 transitions. Word has length 1701 [2025-01-09 00:08:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:18,344 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14511 transitions. [2025-01-09 00:08:18,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 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:08:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14511 transitions. [2025-01-09 00:08:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1908 [2025-01-09 00:08:18,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:18,379 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, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:18,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:08:18,379 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:18,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:18,380 INFO L85 PathProgramCache]: Analyzing trace with hash -493960540, now seen corresponding path program 1 times [2025-01-09 00:08:18,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:18,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842119828] [2025-01-09 00:08:18,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:18,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:18,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1907 statements into 1 equivalence classes. [2025-01-09 00:08:18,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1907 of 1907 statements. [2025-01-09 00:08:18,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:18,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7132 backedges. 4680 proven. 174 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-01-09 00:08:21,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:21,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842119828] [2025-01-09 00:08:21,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842119828] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:21,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636054861] [2025-01-09 00:08:21,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:21,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:21,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:21,141 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-09 00:08:21,144 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-09 00:08:21,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1907 statements into 1 equivalence classes. [2025-01-09 00:08:21,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1907 of 1907 statements. [2025-01-09 00:08:21,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:21,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:21,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 2176 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:08:21,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 7132 backedges. 4709 proven. 0 refuted. 0 times theorem prover too weak. 2423 trivial. 0 not checked. [2025-01-09 00:08:22,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:08:22,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636054861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:22,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:08:22,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:08:22,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066192019] [2025-01-09 00:08:22,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:22,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:22,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:22,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:22,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:08:22,248 INFO L87 Difference]: Start difference. First operand 14151 states and 14511 transitions. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 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:08:23,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:23,098 INFO L93 Difference]: Finished difference Result 27971 states and 28689 transitions. [2025-01-09 00:08:23,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:23,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 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 1907 [2025-01-09 00:08:23,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:23,124 INFO L225 Difference]: With dead ends: 27971 [2025-01-09 00:08:23,124 INFO L226 Difference]: Without dead ends: 14151 [2025-01-09 00:08:23,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1915 GetRequests, 1911 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:08:23,135 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 62 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:23,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 430 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:08:23,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-01-09 00:08:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 13822. [2025-01-09 00:08:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0254684899790174) internal successors, (14173), 13821 states have internal predecessors, (14173), 0 states have call successors, (0), 0 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:08:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14173 transitions. [2025-01-09 00:08:23,285 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14173 transitions. Word has length 1907 [2025-01-09 00:08:23,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:23,287 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14173 transitions. [2025-01-09 00:08:23,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 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:08:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14173 transitions. [2025-01-09 00:08:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2032 [2025-01-09 00:08:23,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:23,323 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 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-09 00:08:23,334 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-09 00:08:23,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:23,524 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:23,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:23,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1307387992, now seen corresponding path program 1 times [2025-01-09 00:08:23,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:23,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838862835] [2025-01-09 00:08:23,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:23,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:23,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2031 statements into 1 equivalence classes. [2025-01-09 00:08:23,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2031 of 2031 statements. [2025-01-09 00:08:23,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:23,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8086 backedges. 3907 proven. 0 refuted. 0 times theorem prover too weak. 4179 trivial. 0 not checked. [2025-01-09 00:08:25,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:25,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838862835] [2025-01-09 00:08:25,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838862835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:25,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:25,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:25,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747726645] [2025-01-09 00:08:25,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:25,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:25,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:25,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:25,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:25,825 INFO L87 Difference]: Start difference. First operand 13822 states and 14173 transitions. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 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:08:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:26,529 INFO L93 Difference]: Finished difference Result 31261 states and 32037 transitions. [2025-01-09 00:08:26,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:26,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 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 2031 [2025-01-09 00:08:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:26,551 INFO L225 Difference]: With dead ends: 31261 [2025-01-09 00:08:26,551 INFO L226 Difference]: Without dead ends: 17770 [2025-01-09 00:08:26,565 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-09 00:08:26,565 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 208 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:26,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 54 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:08:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2025-01-09 00:08:26,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 15138. [2025-01-09 00:08:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15138 states, 15137 states have (on average 1.0255664927000065) internal successors, (15524), 15137 states have internal predecessors, (15524), 0 states have call successors, (0), 0 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:08:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15524 transitions. [2025-01-09 00:08:26,753 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15524 transitions. Word has length 2031 [2025-01-09 00:08:26,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:26,753 INFO L471 AbstractCegarLoop]: Abstraction has 15138 states and 15524 transitions. [2025-01-09 00:08:26,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 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:08:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15524 transitions. [2025-01-09 00:08:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2073 [2025-01-09 00:08:26,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:26,789 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 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] [2025-01-09 00:08:26,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:08:26,790 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:26,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash 734500602, now seen corresponding path program 1 times [2025-01-09 00:08:26,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:26,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769630458] [2025-01-09 00:08:26,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:26,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:26,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2072 statements into 1 equivalence classes. [2025-01-09 00:08:26,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2072 of 2072 statements. [2025-01-09 00:08:26,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:26,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8859 backedges. 6263 proven. 153 refuted. 0 times theorem prover too weak. 2443 trivial. 0 not checked. [2025-01-09 00:08:29,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:29,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769630458] [2025-01-09 00:08:29,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769630458] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:29,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601485919] [2025-01-09 00:08:29,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:29,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:29,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:29,320 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-09 00:08:29,323 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-09 00:08:29,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2072 statements into 1 equivalence classes. [2025-01-09 00:08:29,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2072 of 2072 statements. [2025-01-09 00:08:29,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:29,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:29,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 2383 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:08:29,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8859 backedges. 5156 proven. 0 refuted. 0 times theorem prover too weak. 3703 trivial. 0 not checked. [2025-01-09 00:08:30,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:08:30,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601485919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:30,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:08:30,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:08:30,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136858180] [2025-01-09 00:08:30,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:30,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:30,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:30,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:30,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:08:30,041 INFO L87 Difference]: Start difference. First operand 15138 states and 15524 transitions. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 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:08:30,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:30,791 INFO L93 Difference]: Finished difference Result 32906 states and 33761 transitions. [2025-01-09 00:08:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:30,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 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 2072 [2025-01-09 00:08:30,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:30,809 INFO L225 Difference]: With dead ends: 32906 [2025-01-09 00:08:30,809 INFO L226 Difference]: Without dead ends: 17770 [2025-01-09 00:08:30,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2077 GetRequests, 2072 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:08:30,821 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 221 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:30,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 429 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:08:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2025-01-09 00:08:30,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 17441. [2025-01-09 00:08:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17441 states, 17440 states have (on average 1.0237385321100918) internal successors, (17854), 17440 states have internal predecessors, (17854), 0 states have call successors, (0), 0 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:08:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17441 states to 17441 states and 17854 transitions. [2025-01-09 00:08:30,996 INFO L78 Accepts]: Start accepts. Automaton has 17441 states and 17854 transitions. Word has length 2072 [2025-01-09 00:08:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:30,997 INFO L471 AbstractCegarLoop]: Abstraction has 17441 states and 17854 transitions. [2025-01-09 00:08:30,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 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:08:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 17441 states and 17854 transitions. [2025-01-09 00:08:31,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2150 [2025-01-09 00:08:31,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:31,026 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 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, 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, 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, 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, 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-09 00:08:31,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 00:08:31,227 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,SelfDestructingSolverStorable15 [2025-01-09 00:08:31,227 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:31,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:31,228 INFO L85 PathProgramCache]: Analyzing trace with hash -248508841, now seen corresponding path program 1 times [2025-01-09 00:08:31,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:31,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296420021] [2025-01-09 00:08:31,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:31,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:31,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2149 statements into 1 equivalence classes. [2025-01-09 00:08:31,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2149 of 2149 statements. [2025-01-09 00:08:31,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:31,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9004 backedges. 6449 proven. 153 refuted. 0 times theorem prover too weak. 2402 trivial. 0 not checked. [2025-01-09 00:08:34,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:34,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296420021] [2025-01-09 00:08:34,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296420021] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:34,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866007660] [2025-01-09 00:08:34,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:34,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:34,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:34,129 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-09 00:08:34,133 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-09 00:08:34,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2149 statements into 1 equivalence classes. [2025-01-09 00:08:34,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2149 of 2149 statements. [2025-01-09 00:08:34,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:34,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:34,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 2441 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:08:34,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9004 backedges. 703 proven. 0 refuted. 0 times theorem prover too weak. 8301 trivial. 0 not checked. [2025-01-09 00:08:34,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:08:34,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866007660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:34,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:08:34,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:08:34,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817062760] [2025-01-09 00:08:34,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:34,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:34,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:34,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:34,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:08:34,946 INFO L87 Difference]: Start difference. First operand 17441 states and 17854 transitions. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 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:08:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:35,769 INFO L93 Difference]: Finished difference Result 18101 states and 18516 transitions. [2025-01-09 00:08:35,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:35,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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 2149 [2025-01-09 00:08:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:35,784 INFO L225 Difference]: With dead ends: 18101 [2025-01-09 00:08:35,785 INFO L226 Difference]: Without dead ends: 17770 [2025-01-09 00:08:35,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2154 GetRequests, 2149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:08:35,790 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 268 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:35,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 428 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:08:35,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2025-01-09 00:08:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 17441. [2025-01-09 00:08:35,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17441 states, 17440 states have (on average 1.0235091743119267) internal successors, (17850), 17440 states have internal predecessors, (17850), 0 states have call successors, (0), 0 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:08:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17441 states to 17441 states and 17850 transitions. [2025-01-09 00:08:35,945 INFO L78 Accepts]: Start accepts. Automaton has 17441 states and 17850 transitions. Word has length 2149 [2025-01-09 00:08:35,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:35,946 INFO L471 AbstractCegarLoop]: Abstraction has 17441 states and 17850 transitions. [2025-01-09 00:08:35,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 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:08:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 17441 states and 17850 transitions. [2025-01-09 00:08:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2218 [2025-01-09 00:08:35,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:35,985 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:08:35,993 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-09 00:08:36,185 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,SelfDestructingSolverStorable16 [2025-01-09 00:08:36,185 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:36,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:36,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1541047763, now seen corresponding path program 1 times [2025-01-09 00:08:36,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:36,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270255662] [2025-01-09 00:08:36,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:36,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:36,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2217 statements into 1 equivalence classes. [2025-01-09 00:08:36,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2217 of 2217 statements. [2025-01-09 00:08:36,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:36,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9153 backedges. 5453 proven. 0 refuted. 0 times theorem prover too weak. 3700 trivial. 0 not checked. [2025-01-09 00:08:38,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:38,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270255662] [2025-01-09 00:08:38,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270255662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:38,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:38,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 00:08:38,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691686143] [2025-01-09 00:08:38,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:38,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 00:08:38,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:38,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 00:08:38,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:08:38,703 INFO L87 Difference]: Start difference. First operand 17441 states and 17850 transitions. Second operand has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 0 states have call successors, (0), 0 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:08:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:40,175 INFO L93 Difference]: Finished difference Result 34569 states and 35385 transitions. [2025-01-09 00:08:40,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:08:40,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 0 states have call successors, (0), 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 2217 [2025-01-09 00:08:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:40,188 INFO L225 Difference]: With dead ends: 34569 [2025-01-09 00:08:40,188 INFO L226 Difference]: Without dead ends: 17441 [2025-01-09 00:08:40,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:08:40,198 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:40,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 429 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:08:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2025-01-09 00:08:40,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 16454. [2025-01-09 00:08:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.0220628456816385) internal successors, (16816), 16453 states have internal predecessors, (16816), 0 states have call successors, (0), 0 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:08:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 16816 transitions. [2025-01-09 00:08:40,332 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 16816 transitions. Word has length 2217 [2025-01-09 00:08:40,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:40,332 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 16816 transitions. [2025-01-09 00:08:40,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 0 states have call successors, (0), 0 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:08:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 16816 transitions. [2025-01-09 00:08:40,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2240 [2025-01-09 00:08:40,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:40,370 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:08:40,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:08:40,370 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:40,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1244413247, now seen corresponding path program 1 times [2025-01-09 00:08:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:40,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180974256] [2025-01-09 00:08:40,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:40,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:40,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2239 statements into 1 equivalence classes. [2025-01-09 00:08:40,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2239 of 2239 statements. [2025-01-09 00:08:40,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:40,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10099 backedges. 767 proven. 0 refuted. 0 times theorem prover too weak. 9332 trivial. 0 not checked. [2025-01-09 00:08:42,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:42,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180974256] [2025-01-09 00:08:42,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180974256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:42,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:42,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:42,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015570765] [2025-01-09 00:08:42,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:42,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:42,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:42,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:42,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:42,819 INFO L87 Difference]: Start difference. First operand 16454 states and 16816 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:43,312 INFO L93 Difference]: Finished difference Result 16464 states and 16826 transitions. [2025-01-09 00:08:43,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:43,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2239 [2025-01-09 00:08:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:43,315 INFO L225 Difference]: With dead ends: 16464 [2025-01-09 00:08:43,315 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:08:43,320 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-09 00:08:43,320 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:43,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 00:08:43,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:08:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:08:43,321 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:08:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:08:43,322 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2239 [2025-01-09 00:08:43,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:43,322 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:08:43,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:08:43,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:08:43,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:08:43,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:08:43,344 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] [2025-01-09 00:08:43,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.