./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label26.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/Problem15_label26.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 cdf2fa99034a2ce4515fc13e5b104f83251835a7a436038ebabc8d1f47f1da91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:02:14,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:02:14,227 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:02:14,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:02:14,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:02:14,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:02:14,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:02:14,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:02:14,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:02:14,245 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:02:14,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:02:14,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:02:14,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:02:14,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:02:14,246 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:02:14,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:02:14,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:02:14,246 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:02:14,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:02:14,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:02:14,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:02:14,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:02:14,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:02:14,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:02:14,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:02:14,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:02:14,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:02:14,247 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:02:14,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:02:14,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:02:14,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:02:14,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:02:14,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:02:14,248 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 -> cdf2fa99034a2ce4515fc13e5b104f83251835a7a436038ebabc8d1f47f1da91 [2025-01-09 00:02:14,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:02:14,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:02:14,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:02:14,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:02:14,437 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:02:14,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label26.c [2025-01-09 00:02:15,598 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b2b66e82/2b2ac121011f418095e3da41c5fcc698/FLAGc39bf5556 [2025-01-09 00:02:15,932 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:02:15,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label26.c [2025-01-09 00:02:15,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b2b66e82/2b2ac121011f418095e3da41c5fcc698/FLAGc39bf5556 [2025-01-09 00:02:15,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b2b66e82/2b2ac121011f418095e3da41c5fcc698 [2025-01-09 00:02:15,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:02:15,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:02:15,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:02:15,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:02:15,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:02:15,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:02:15" (1/1) ... [2025-01-09 00:02:15,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a3daa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:15, skipping insertion in model container [2025-01-09 00:02:15,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:02:15" (1/1) ... [2025-01-09 00:02:16,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:02:16,128 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/Problem15_label26.c[6541,6554] [2025-01-09 00:02:16,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:02:16,376 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:02:16,397 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/Problem15_label26.c[6541,6554] [2025-01-09 00:02:16,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:02:16,535 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:02:16,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:16 WrapperNode [2025-01-09 00:02:16,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:02:16,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:02:16,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:02:16,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:02:16,540 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:02:16" (1/1) ... [2025-01-09 00:02:16,556 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:02:16" (1/1) ... [2025-01-09 00:02:16,709 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-01-09 00:02:16,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:02:16,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:02:16,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:02:16,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:02:16,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:16" (1/1) ... [2025-01-09 00:02:16,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:16" (1/1) ... [2025-01-09 00:02:16,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:16" (1/1) ... [2025-01-09 00:02:16,786 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:02:16,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:16" (1/1) ... [2025-01-09 00:02:16,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:16" (1/1) ... [2025-01-09 00:02:16,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:16" (1/1) ... [2025-01-09 00:02:16,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:16" (1/1) ... [2025-01-09 00:02:16,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:16" (1/1) ... [2025-01-09 00:02:16,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:16" (1/1) ... [2025-01-09 00:02:16,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:16" (1/1) ... [2025-01-09 00:02:16,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:02:16,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:02:16,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:02:16,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:02:16,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:16" (1/1) ... [2025-01-09 00:02:16,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:02:16,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:02:16,936 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:02:16,941 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:02:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:02:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:02:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:02:16,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:02:16,997 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:02:16,998 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:02:18,950 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-01-09 00:02:18,951 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:02:18,971 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:02:18,974 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:02:18,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:02:18 BoogieIcfgContainer [2025-01-09 00:02:18,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:02:18,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:02:18,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:02:18,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:02:18,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:02:15" (1/3) ... [2025-01-09 00:02:18,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46720f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:02:18, skipping insertion in model container [2025-01-09 00:02:18,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:16" (2/3) ... [2025-01-09 00:02:18,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46720f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:02:18, skipping insertion in model container [2025-01-09 00:02:18,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:02:18" (3/3) ... [2025-01-09 00:02:18,986 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label26.c [2025-01-09 00:02:18,998 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:02:19,000 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label26.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:02:19,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:02:19,074 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;@2ad61811, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:02:19,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:02:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states 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:02:19,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 00:02:19,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:19,087 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] [2025-01-09 00:02:19,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:19,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:19,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1210903428, now seen corresponding path program 1 times [2025-01-09 00:02:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:19,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505654200] [2025-01-09 00:02:19,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:19,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:19,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 00:02:19,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 00:02:19,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:19,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:19,426 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:02:19,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:19,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505654200] [2025-01-09 00:02:19,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505654200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:19,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:19,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:02:19,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820017077] [2025-01-09 00:02:19,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:19,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:19,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:19,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:19,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:19,449 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:02:21,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:21,064 INFO L93 Difference]: Finished difference Result 1191 states and 2154 transitions. [2025-01-09 00:02:21,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:21,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-01-09 00:02:21,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:21,074 INFO L225 Difference]: With dead ends: 1191 [2025-01-09 00:02:21,074 INFO L226 Difference]: Without dead ends: 688 [2025-01-09 00:02:21,080 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:02:21,082 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 318 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:21,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 230 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:02:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-01-09 00:02:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680. [2025-01-09 00:02:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 1.609720176730486) internal successors, (1093), 679 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states 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:02:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1093 transitions. [2025-01-09 00:02:21,127 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1093 transitions. Word has length 53 [2025-01-09 00:02:21,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:21,127 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1093 transitions. [2025-01-09 00:02:21,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:02:21,128 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1093 transitions. [2025-01-09 00:02:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 00:02:21,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:21,130 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:02:21,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:02:21,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:21,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:21,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1198189940, now seen corresponding path program 1 times [2025-01-09 00:02:21,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:21,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882749753] [2025-01-09 00:02:21,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:21,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:21,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 00:02:21,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 00:02:21,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:21,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:02:21,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:21,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882749753] [2025-01-09 00:02:21,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882749753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:21,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:21,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:02:21,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229989226] [2025-01-09 00:02:21,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:21,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:21,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:21,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:21,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:21,353 INFO L87 Difference]: Start difference. First operand 680 states and 1093 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:02:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:22,855 INFO L93 Difference]: Finished difference Result 1962 states and 3170 transitions. [2025-01-09 00:02:22,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:22,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-01-09 00:02:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:22,860 INFO L225 Difference]: With dead ends: 1962 [2025-01-09 00:02:22,860 INFO L226 Difference]: Without dead ends: 1284 [2025-01-09 00:02:22,862 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:02:22,862 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 247 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:22,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 339 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:02:22,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2025-01-09 00:02:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1281. [2025-01-09 00:02:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.39453125) internal successors, (1785), 1280 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states 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:02:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1785 transitions. [2025-01-09 00:02:22,908 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1785 transitions. Word has length 121 [2025-01-09 00:02:22,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:22,908 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1785 transitions. [2025-01-09 00:02:22,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:02:22,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1785 transitions. [2025-01-09 00:02:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 00:02:22,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:22,910 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:02:22,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:02:22,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:22,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:22,911 INFO L85 PathProgramCache]: Analyzing trace with hash -608073336, now seen corresponding path program 1 times [2025-01-09 00:02:22,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:22,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762214118] [2025-01-09 00:02:22,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:22,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:22,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 00:02:22,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 00:02:22,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:22,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:02:23,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:23,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762214118] [2025-01-09 00:02:23,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762214118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:23,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:23,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:02:23,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721173990] [2025-01-09 00:02:23,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:23,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:23,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:23,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:23,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:23,317 INFO L87 Difference]: Start difference. First operand 1281 states and 1785 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:02:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:24,572 INFO L93 Difference]: Finished difference Result 2859 states and 3903 transitions. [2025-01-09 00:02:24,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:24,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-01-09 00:02:24,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:24,582 INFO L225 Difference]: With dead ends: 2859 [2025-01-09 00:02:24,582 INFO L226 Difference]: Without dead ends: 1580 [2025-01-09 00:02:24,583 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:02:24,585 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 225 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:24,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 359 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:02:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-01-09 00:02:24,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2025-01-09 00:02:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1579 states have (on average 1.323622545915136) internal successors, (2090), 1579 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states 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:02:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2090 transitions. [2025-01-09 00:02:24,615 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2090 transitions. Word has length 129 [2025-01-09 00:02:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:24,616 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2090 transitions. [2025-01-09 00:02:24,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:02:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2090 transitions. [2025-01-09 00:02:24,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 00:02:24,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:24,619 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:02:24,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:02:24,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:24,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1652948398, now seen corresponding path program 1 times [2025-01-09 00:02:24,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:24,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946652653] [2025-01-09 00:02:24,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:24,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:24,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 00:02:24,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 00:02:24,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:24,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 00:02:24,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:24,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946652653] [2025-01-09 00:02:24,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946652653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:24,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:24,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:02:24,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456722820] [2025-01-09 00:02:24,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:24,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:24,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:24,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:24,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:24,868 INFO L87 Difference]: Start difference. First operand 1580 states and 2090 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:02:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:25,999 INFO L93 Difference]: Finished difference Result 4065 states and 5551 transitions. [2025-01-09 00:02:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 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 212 [2025-01-09 00:02:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:26,007 INFO L225 Difference]: With dead ends: 4065 [2025-01-09 00:02:26,007 INFO L226 Difference]: Without dead ends: 2786 [2025-01-09 00:02:26,008 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:02:26,008 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:26,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 360 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:02:26,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2025-01-09 00:02:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2781. [2025-01-09 00:02:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2780 states have (on average 1.249640287769784) internal successors, (3474), 2780 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states 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:02:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3474 transitions. [2025-01-09 00:02:26,045 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3474 transitions. Word has length 212 [2025-01-09 00:02:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:26,045 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3474 transitions. [2025-01-09 00:02:26,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:02:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3474 transitions. [2025-01-09 00:02:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 00:02:26,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:26,047 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, 2, 2, 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] [2025-01-09 00:02:26,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:02:26,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:26,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1974616126, now seen corresponding path program 1 times [2025-01-09 00:02:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:26,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955547239] [2025-01-09 00:02:26,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:26,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:26,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 00:02:26,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 00:02:26,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:26,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-09 00:02:26,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:26,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955547239] [2025-01-09 00:02:26,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955547239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:26,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:26,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:26,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141704788] [2025-01-09 00:02:26,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:26,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:26,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:26,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:26,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:26,189 INFO L87 Difference]: Start difference. First operand 2781 states and 3474 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:02:27,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:27,688 INFO L93 Difference]: Finished difference Result 7364 states and 9358 transitions. [2025-01-09 00:02:27,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:27,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 220 [2025-01-09 00:02:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:27,701 INFO L225 Difference]: With dead ends: 7364 [2025-01-09 00:02:27,702 INFO L226 Difference]: Without dead ends: 4884 [2025-01-09 00:02:27,705 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:02:27,705 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 275 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:27,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 636 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:02:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4884 states. [2025-01-09 00:02:27,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4884 to 4286. [2025-01-09 00:02:27,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4286 states, 4285 states have (on average 1.1885647607934655) internal successors, (5093), 4285 states have internal predecessors, (5093), 0 states have call successors, (0), 0 states 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:02:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 5093 transitions. [2025-01-09 00:02:27,763 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 5093 transitions. Word has length 220 [2025-01-09 00:02:27,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:27,763 INFO L471 AbstractCegarLoop]: Abstraction has 4286 states and 5093 transitions. [2025-01-09 00:02:27,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:02:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 5093 transitions. [2025-01-09 00:02:27,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-09 00:02:27,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:27,766 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:02:27,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:02:27,767 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:27,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:27,767 INFO L85 PathProgramCache]: Analyzing trace with hash 538887950, now seen corresponding path program 1 times [2025-01-09 00:02:27,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:27,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443510308] [2025-01-09 00:02:27,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:27,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:27,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 00:02:27,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 00:02:27,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:27,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-09 00:02:27,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:27,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443510308] [2025-01-09 00:02:27,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443510308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:27,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:27,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:02:27,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115025797] [2025-01-09 00:02:27,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:27,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:27,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:27,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:27,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:27,926 INFO L87 Difference]: Start difference. First operand 4286 states and 5093 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:29,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:29,165 INFO L93 Difference]: Finished difference Result 9771 states and 11905 transitions. [2025-01-09 00:02:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:29,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2025-01-09 00:02:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:29,178 INFO L225 Difference]: With dead ends: 9771 [2025-01-09 00:02:29,178 INFO L226 Difference]: Without dead ends: 5786 [2025-01-09 00:02:29,182 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:02:29,184 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 220 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:29,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 364 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:02:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5786 states. [2025-01-09 00:02:29,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5786 to 5485. [2025-01-09 00:02:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5485 states, 5484 states have (on average 1.1692195477753464) internal successors, (6412), 5484 states have internal predecessors, (6412), 0 states have call successors, (0), 0 states 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:02:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5485 states to 5485 states and 6412 transitions. [2025-01-09 00:02:29,256 INFO L78 Accepts]: Start accepts. Automaton has 5485 states and 6412 transitions. Word has length 226 [2025-01-09 00:02:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:29,256 INFO L471 AbstractCegarLoop]: Abstraction has 5485 states and 6412 transitions. [2025-01-09 00:02:29,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 5485 states and 6412 transitions. [2025-01-09 00:02:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-01-09 00:02:29,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:29,263 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:29,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:02:29,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:29,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:29,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1979866579, now seen corresponding path program 1 times [2025-01-09 00:02:29,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:29,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145830253] [2025-01-09 00:02:29,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:29,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:29,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-09 00:02:29,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-09 00:02:29,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:29,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 00:02:29,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:29,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145830253] [2025-01-09 00:02:29,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145830253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:29,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:29,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:29,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125761995] [2025-01-09 00:02:29,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:29,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:29,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:29,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:29,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:29,559 INFO L87 Difference]: Start difference. First operand 5485 states and 6412 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:02:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:30,761 INFO L93 Difference]: Finished difference Result 12470 states and 14901 transitions. [2025-01-09 00:02:30,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:30,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2025-01-09 00:02:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:30,774 INFO L225 Difference]: With dead ends: 12470 [2025-01-09 00:02:30,774 INFO L226 Difference]: Without dead ends: 7286 [2025-01-09 00:02:30,777 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:02:30,777 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 274 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:30,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 638 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:02:30,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2025-01-09 00:02:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 7284. [2025-01-09 00:02:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7284 states, 7283 states have (on average 1.148427845667994) internal successors, (8364), 7283 states have internal predecessors, (8364), 0 states have call successors, (0), 0 states 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:02:30,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 8364 transitions. [2025-01-09 00:02:30,846 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 8364 transitions. Word has length 340 [2025-01-09 00:02:30,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:30,846 INFO L471 AbstractCegarLoop]: Abstraction has 7284 states and 8364 transitions. [2025-01-09 00:02:30,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:02:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 8364 transitions. [2025-01-09 00:02:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-01-09 00:02:30,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:30,850 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, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:30,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:02:30,851 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:30,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash -182900061, now seen corresponding path program 1 times [2025-01-09 00:02:30,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:30,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051593255] [2025-01-09 00:02:30,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:30,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:30,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-01-09 00:02:30,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-01-09 00:02:30,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:30,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:02:31,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:31,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051593255] [2025-01-09 00:02:31,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051593255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:31,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:31,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:31,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547041029] [2025-01-09 00:02:31,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:31,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:31,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:31,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:31,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:31,131 INFO L87 Difference]: Start difference. First operand 7284 states and 8364 transitions. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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:02:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:32,301 INFO L93 Difference]: Finished difference Result 16069 states and 18808 transitions. [2025-01-09 00:02:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:32,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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 416 [2025-01-09 00:02:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:32,329 INFO L225 Difference]: With dead ends: 16069 [2025-01-09 00:02:32,329 INFO L226 Difference]: Without dead ends: 9086 [2025-01-09 00:02:32,335 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:02:32,336 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 248 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:32,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 621 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:02:32,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2025-01-09 00:02:32,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 8780. [2025-01-09 00:02:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8780 states, 8779 states have (on average 1.1346394805786537) internal successors, (9961), 8779 states have internal predecessors, (9961), 0 states have call successors, (0), 0 states 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:02:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8780 states to 8780 states and 9961 transitions. [2025-01-09 00:02:32,421 INFO L78 Accepts]: Start accepts. Automaton has 8780 states and 9961 transitions. Word has length 416 [2025-01-09 00:02:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:32,421 INFO L471 AbstractCegarLoop]: Abstraction has 8780 states and 9961 transitions. [2025-01-09 00:02:32,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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:02:32,422 INFO L276 IsEmpty]: Start isEmpty. Operand 8780 states and 9961 transitions. [2025-01-09 00:02:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-01-09 00:02:32,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:32,427 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:32,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:02:32,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:32,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash -215392711, now seen corresponding path program 1 times [2025-01-09 00:02:32,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:32,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435957654] [2025-01-09 00:02:32,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:32,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:32,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 00:02:32,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 00:02:32,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:32,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 00:02:32,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:32,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435957654] [2025-01-09 00:02:32,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435957654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:32,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:32,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:32,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605760826] [2025-01-09 00:02:32,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:32,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:32,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:32,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:32,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:32,653 INFO L87 Difference]: Start difference. First operand 8780 states and 9961 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:02:33,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:33,925 INFO L93 Difference]: Finished difference Result 20548 states and 23478 transitions. [2025-01-09 00:02:33,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:33,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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 426 [2025-01-09 00:02:33,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:33,945 INFO L225 Difference]: With dead ends: 20548 [2025-01-09 00:02:33,946 INFO L226 Difference]: Without dead ends: 12069 [2025-01-09 00:02:33,952 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:02:33,953 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 261 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:33,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 315 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:02:33,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12069 states. [2025-01-09 00:02:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12069 to 7877. [2025-01-09 00:02:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7877 states, 7876 states have (on average 1.1444895886236668) internal successors, (9014), 7876 states have internal predecessors, (9014), 0 states have call successors, (0), 0 states 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:02:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7877 states to 7877 states and 9014 transitions. [2025-01-09 00:02:34,054 INFO L78 Accepts]: Start accepts. Automaton has 7877 states and 9014 transitions. Word has length 426 [2025-01-09 00:02:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:34,055 INFO L471 AbstractCegarLoop]: Abstraction has 7877 states and 9014 transitions. [2025-01-09 00:02:34,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:02:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 7877 states and 9014 transitions. [2025-01-09 00:02:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-01-09 00:02:34,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:34,061 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:34,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:02:34,062 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:34,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2051948064, now seen corresponding path program 1 times [2025-01-09 00:02:34,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:34,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069463048] [2025-01-09 00:02:34,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:34,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:34,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-09 00:02:34,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-09 00:02:34,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:34,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-01-09 00:02:34,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:34,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069463048] [2025-01-09 00:02:34,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069463048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:34,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:34,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:34,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026893791] [2025-01-09 00:02:34,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:34,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:34,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:34,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:34,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:34,450 INFO L87 Difference]: Start difference. First operand 7877 states and 9014 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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:02:35,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:35,828 INFO L93 Difference]: Finished difference Result 17844 states and 20678 transitions. [2025-01-09 00:02:35,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:35,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 517 [2025-01-09 00:02:35,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:35,842 INFO L225 Difference]: With dead ends: 17844 [2025-01-09 00:02:35,842 INFO L226 Difference]: Without dead ends: 10268 [2025-01-09 00:02:35,847 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:02:35,848 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 362 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:35,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 448 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:02:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10268 states. [2025-01-09 00:02:35,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10268 to 10268. [2025-01-09 00:02:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10268 states, 10267 states have (on average 1.146878348105581) internal successors, (11775), 10267 states have internal predecessors, (11775), 0 states have call successors, (0), 0 states 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:02:35,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 11775 transitions. [2025-01-09 00:02:35,915 INFO L78 Accepts]: Start accepts. Automaton has 10268 states and 11775 transitions. Word has length 517 [2025-01-09 00:02:35,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:35,917 INFO L471 AbstractCegarLoop]: Abstraction has 10268 states and 11775 transitions. [2025-01-09 00:02:35,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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:02:35,917 INFO L276 IsEmpty]: Start isEmpty. Operand 10268 states and 11775 transitions. [2025-01-09 00:02:35,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-01-09 00:02:35,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:35,920 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, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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, 1, 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:02:35,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:02:35,921 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:35,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:35,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1079448327, now seen corresponding path program 1 times [2025-01-09 00:02:35,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:35,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577721617] [2025-01-09 00:02:35,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:35,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:35,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-01-09 00:02:35,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-01-09 00:02:35,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:35,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-01-09 00:02:36,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:36,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577721617] [2025-01-09 00:02:36,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577721617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:36,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:36,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:36,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342960624] [2025-01-09 00:02:36,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:36,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:36,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:36,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:36,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:36,265 INFO L87 Difference]: Start difference. First operand 10268 states and 11775 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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:02:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:37,530 INFO L93 Difference]: Finished difference Result 25033 states and 28938 transitions. [2025-01-09 00:02:37,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:37,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 541 [2025-01-09 00:02:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:37,553 INFO L225 Difference]: With dead ends: 25033 [2025-01-09 00:02:37,553 INFO L226 Difference]: Without dead ends: 15066 [2025-01-09 00:02:37,563 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:02:37,564 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 248 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:37,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 619 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:02:37,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15066 states. [2025-01-09 00:02:37,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15066 to 15055. [2025-01-09 00:02:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15055 states, 15054 states have (on average 1.1306629467251228) internal successors, (17021), 15054 states have internal predecessors, (17021), 0 states have call successors, (0), 0 states 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:02:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15055 states to 15055 states and 17021 transitions. [2025-01-09 00:02:37,735 INFO L78 Accepts]: Start accepts. Automaton has 15055 states and 17021 transitions. Word has length 541 [2025-01-09 00:02:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:37,736 INFO L471 AbstractCegarLoop]: Abstraction has 15055 states and 17021 transitions. [2025-01-09 00:02:37,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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:02:37,736 INFO L276 IsEmpty]: Start isEmpty. Operand 15055 states and 17021 transitions. [2025-01-09 00:02:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-01-09 00:02:37,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:37,743 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, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:37,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:02:37,744 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:37,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:37,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2021451799, now seen corresponding path program 1 times [2025-01-09 00:02:37,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:37,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501206175] [2025-01-09 00:02:37,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:37,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:37,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-01-09 00:02:37,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-01-09 00:02:37,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:37,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-01-09 00:02:38,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:38,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501206175] [2025-01-09 00:02:38,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501206175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:38,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:38,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:38,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472411426] [2025-01-09 00:02:38,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:38,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:38,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:38,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:38,036 INFO L87 Difference]: Start difference. First operand 15055 states and 17021 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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:02:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:39,231 INFO L93 Difference]: Finished difference Result 31005 states and 35004 transitions. [2025-01-09 00:02:39,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:39,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 595 [2025-01-09 00:02:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:39,248 INFO L225 Difference]: With dead ends: 31005 [2025-01-09 00:02:39,248 INFO L226 Difference]: Without dead ends: 15055 [2025-01-09 00:02:39,262 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:02:39,263 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 249 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:39,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 666 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:02:39,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15055 states. [2025-01-09 00:02:39,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15055 to 15055. [2025-01-09 00:02:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15055 states, 15054 states have (on average 1.1287365484256675) internal successors, (16992), 15054 states have internal predecessors, (16992), 0 states have call successors, (0), 0 states 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:02:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15055 states to 15055 states and 16992 transitions. [2025-01-09 00:02:39,388 INFO L78 Accepts]: Start accepts. Automaton has 15055 states and 16992 transitions. Word has length 595 [2025-01-09 00:02:39,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:39,389 INFO L471 AbstractCegarLoop]: Abstraction has 15055 states and 16992 transitions. [2025-01-09 00:02:39,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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:02:39,389 INFO L276 IsEmpty]: Start isEmpty. Operand 15055 states and 16992 transitions. [2025-01-09 00:02:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 00:02:39,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:39,396 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 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:02:39,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:02:39,396 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:39,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:39,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1975684474, now seen corresponding path program 1 times [2025-01-09 00:02:39,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:39,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296915127] [2025-01-09 00:02:39,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:39,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:39,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 00:02:39,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 00:02:39,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:39,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-01-09 00:02:39,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:39,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296915127] [2025-01-09 00:02:39,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296915127] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:02:39,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608002498] [2025-01-09 00:02:39,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:39,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:02:39,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:02:39,816 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:02:39,821 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:02:39,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 00:02:39,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 00:02:39,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:39,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:39,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:02:39,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:02:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-01-09 00:02:40,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:02:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-01-09 00:02:41,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608002498] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:02:41,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:02:41,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-09 00:02:41,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401833118] [2025-01-09 00:02:41,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:02:41,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:02:41,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:41,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:02:41,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:02:41,536 INFO L87 Difference]: Start difference. First operand 15055 states and 16992 transitions. Second operand has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states 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:02:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:46,363 INFO L93 Difference]: Finished difference Result 38143 states and 42794 transitions. [2025-01-09 00:02:46,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 00:02:46,363 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 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 608 [2025-01-09 00:02:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:46,384 INFO L225 Difference]: With dead ends: 38143 [2025-01-09 00:02:46,388 INFO L226 Difference]: Without dead ends: 17747 [2025-01-09 00:02:46,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1225 GetRequests, 1211 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-01-09 00:02:46,402 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 2890 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5838 mSolverCounterSat, 634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2890 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 6472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 634 IncrementalHoareTripleChecker+Valid, 5838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:46,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2890 Valid, 282 Invalid, 6472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [634 Valid, 5838 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 00:02:46,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17747 states. [2025-01-09 00:02:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17747 to 13558. [2025-01-09 00:02:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13558 states, 13557 states have (on average 1.0706646013129748) internal successors, (14515), 13557 states have internal predecessors, (14515), 0 states have call successors, (0), 0 states 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:02:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13558 states to 13558 states and 14515 transitions. [2025-01-09 00:02:46,629 INFO L78 Accepts]: Start accepts. Automaton has 13558 states and 14515 transitions. Word has length 608 [2025-01-09 00:02:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:46,629 INFO L471 AbstractCegarLoop]: Abstraction has 13558 states and 14515 transitions. [2025-01-09 00:02:46,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states 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:02:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 13558 states and 14515 transitions. [2025-01-09 00:02:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-01-09 00:02:46,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:46,638 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, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:46,648 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:02:46,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 00:02:46,839 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:46,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:46,840 INFO L85 PathProgramCache]: Analyzing trace with hash -569445386, now seen corresponding path program 1 times [2025-01-09 00:02:46,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:46,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579071174] [2025-01-09 00:02:46,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:46,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:46,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-01-09 00:02:46,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-01-09 00:02:46,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:46,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-01-09 00:02:47,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:47,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579071174] [2025-01-09 00:02:47,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579071174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:47,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:47,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:47,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351701956] [2025-01-09 00:02:47,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:47,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:47,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:47,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:47,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:47,177 INFO L87 Difference]: Start difference. First operand 13558 states and 14515 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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:02:47,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:47,869 INFO L93 Difference]: Finished difference Result 26813 states and 28725 transitions. [2025-01-09 00:02:47,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:47,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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 633 [2025-01-09 00:02:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:47,888 INFO L225 Difference]: With dead ends: 26813 [2025-01-09 00:02:47,888 INFO L226 Difference]: Without dead ends: 13556 [2025-01-09 00:02:47,897 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:02:47,898 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:47,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:02:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13556 states. [2025-01-09 00:02:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13556 to 13556. [2025-01-09 00:02:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13556 states, 13555 states have (on average 1.0705274806344522) internal successors, (14511), 13555 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:02:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13556 states to 13556 states and 14511 transitions. [2025-01-09 00:02:48,006 INFO L78 Accepts]: Start accepts. Automaton has 13556 states and 14511 transitions. Word has length 633 [2025-01-09 00:02:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:48,007 INFO L471 AbstractCegarLoop]: Abstraction has 13556 states and 14511 transitions. [2025-01-09 00:02:48,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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:02:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 13556 states and 14511 transitions. [2025-01-09 00:02:48,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-01-09 00:02:48,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:48,013 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:02:48,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:02:48,013 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:48,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1962292611, now seen corresponding path program 1 times [2025-01-09 00:02:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:48,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703014538] [2025-01-09 00:02:48,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:48,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-01-09 00:02:48,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-01-09 00:02:48,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:48,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2025-01-09 00:02:48,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:48,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703014538] [2025-01-09 00:02:48,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703014538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:48,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:48,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:48,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192618091] [2025-01-09 00:02:48,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:48,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:48,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:48,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:48,338 INFO L87 Difference]: Start difference. First operand 13556 states and 14511 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states 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:02:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:49,148 INFO L93 Difference]: Finished difference Result 27106 states and 29013 transitions. [2025-01-09 00:02:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:49,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 649 [2025-01-09 00:02:49,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:49,162 INFO L225 Difference]: With dead ends: 27106 [2025-01-09 00:02:49,162 INFO L226 Difference]: Without dead ends: 13552 [2025-01-09 00:02:49,172 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:02:49,172 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 276 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:49,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 521 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:02:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13552 states. [2025-01-09 00:02:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13552 to 12654. [2025-01-09 00:02:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12654 states, 12653 states have (on average 1.0376985695092074) internal successors, (13130), 12653 states have internal predecessors, (13130), 0 states have call successors, (0), 0 states 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:02:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12654 states to 12654 states and 13130 transitions. [2025-01-09 00:02:49,278 INFO L78 Accepts]: Start accepts. Automaton has 12654 states and 13130 transitions. Word has length 649 [2025-01-09 00:02:49,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:49,278 INFO L471 AbstractCegarLoop]: Abstraction has 12654 states and 13130 transitions. [2025-01-09 00:02:49,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states 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:02:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 12654 states and 13130 transitions. [2025-01-09 00:02:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2025-01-09 00:02:49,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:49,284 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:02:49,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:02:49,285 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:49,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:49,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1837998038, now seen corresponding path program 1 times [2025-01-09 00:02:49,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:49,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186092626] [2025-01-09 00:02:49,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:49,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:49,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 678 statements into 1 equivalence classes. [2025-01-09 00:02:49,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 678 of 678 statements. [2025-01-09 00:02:49,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:49,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2025-01-09 00:02:49,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:49,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186092626] [2025-01-09 00:02:49,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186092626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:49,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:49,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:49,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291159247] [2025-01-09 00:02:49,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:49,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:49,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:49,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:49,551 INFO L87 Difference]: Start difference. First operand 12654 states and 13130 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states 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:02:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:50,251 INFO L93 Difference]: Finished difference Result 27993 states and 29091 transitions. [2025-01-09 00:02:50,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:50,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 678 [2025-01-09 00:02:50,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:50,268 INFO L225 Difference]: With dead ends: 27993 [2025-01-09 00:02:50,268 INFO L226 Difference]: Without dead ends: 15341 [2025-01-09 00:02:50,278 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:02:50,278 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 282 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:50,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 181 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:02:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15341 states. [2025-01-09 00:02:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15341 to 14742. [2025-01-09 00:02:50,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14742 states, 14741 states have (on average 1.033511973407503) internal successors, (15235), 14741 states have internal predecessors, (15235), 0 states have call successors, (0), 0 states 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:02:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14742 states to 14742 states and 15235 transitions. [2025-01-09 00:02:50,400 INFO L78 Accepts]: Start accepts. Automaton has 14742 states and 15235 transitions. Word has length 678 [2025-01-09 00:02:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:50,400 INFO L471 AbstractCegarLoop]: Abstraction has 14742 states and 15235 transitions. [2025-01-09 00:02:50,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states 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:02:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 14742 states and 15235 transitions. [2025-01-09 00:02:50,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-01-09 00:02:50,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:50,407 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:50,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:02:50,407 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:50,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:50,408 INFO L85 PathProgramCache]: Analyzing trace with hash -852894942, now seen corresponding path program 1 times [2025-01-09 00:02:50,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:50,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73850286] [2025-01-09 00:02:50,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:50,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:50,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 00:02:50,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 00:02:50,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:50,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 596 proven. 190 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-09 00:02:51,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:51,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73850286] [2025-01-09 00:02:51,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73850286] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:02:51,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452369768] [2025-01-09 00:02:51,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:51,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:02:51,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:02:51,024 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:02:51,033 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:02:51,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 00:02:51,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 00:02:51,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:51,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:51,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:02:51,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:02:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-01-09 00:02:51,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:02:51,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452369768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:51,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:02:51,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:02:51,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419889327] [2025-01-09 00:02:51,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:51,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:51,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:51,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:02:51,500 INFO L87 Difference]: Start difference. First operand 14742 states and 15235 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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:02:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:52,414 INFO L93 Difference]: Finished difference Result 31292 states and 32395 transitions. [2025-01-09 00:02:52,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:52,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 685 [2025-01-09 00:02:52,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:52,431 INFO L225 Difference]: With dead ends: 31292 [2025-01-09 00:02:52,431 INFO L226 Difference]: Without dead ends: 16552 [2025-01-09 00:02:52,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:02:52,443 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 298 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:52,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 126 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:02:52,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16552 states. [2025-01-09 00:02:52,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16552 to 14442. [2025-01-09 00:02:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14442 states, 14441 states have (on average 1.0334464372273389) internal successors, (14924), 14441 states have internal predecessors, (14924), 0 states have call successors, (0), 0 states 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:02:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14442 states to 14442 states and 14924 transitions. [2025-01-09 00:02:52,677 INFO L78 Accepts]: Start accepts. Automaton has 14442 states and 14924 transitions. Word has length 685 [2025-01-09 00:02:52,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:52,678 INFO L471 AbstractCegarLoop]: Abstraction has 14442 states and 14924 transitions. [2025-01-09 00:02:52,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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:02:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 14442 states and 14924 transitions. [2025-01-09 00:02:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2025-01-09 00:02:52,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:52,689 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:02:52,695 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:02:52,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 00:02:52,890 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:52,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:52,890 INFO L85 PathProgramCache]: Analyzing trace with hash -349377410, now seen corresponding path program 1 times [2025-01-09 00:02:52,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:52,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012686644] [2025-01-09 00:02:52,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:52,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:52,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-01-09 00:02:53,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-01-09 00:02:53,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:53,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-01-09 00:02:53,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012686644] [2025-01-09 00:02:53,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012686644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:53,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:53,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:02:53,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919467303] [2025-01-09 00:02:53,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:53,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:02:53,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:53,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:02:53,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:02:53,430 INFO L87 Difference]: Start difference. First operand 14442 states and 14924 transitions. Second operand has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:02:54,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:54,803 INFO L93 Difference]: Finished difference Result 31884 states and 33024 transitions. [2025-01-09 00:02:54,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:02:54,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 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 711 [2025-01-09 00:02:54,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:54,836 INFO L225 Difference]: With dead ends: 31884 [2025-01-09 00:02:54,840 INFO L226 Difference]: Without dead ends: 17743 [2025-01-09 00:02:54,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:02:54,858 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 658 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:54,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 438 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:02:54,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17743 states. [2025-01-09 00:02:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17743 to 16846. [2025-01-09 00:02:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16846 states, 16845 states have (on average 1.0305135054912438) internal successors, (17359), 16845 states have internal predecessors, (17359), 0 states have call successors, (0), 0 states 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:02:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16846 states to 16846 states and 17359 transitions. [2025-01-09 00:02:55,262 INFO L78 Accepts]: Start accepts. Automaton has 16846 states and 17359 transitions. Word has length 711 [2025-01-09 00:02:55,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:55,262 INFO L471 AbstractCegarLoop]: Abstraction has 16846 states and 17359 transitions. [2025-01-09 00:02:55,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:02:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 16846 states and 17359 transitions. [2025-01-09 00:02:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-01-09 00:02:55,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:55,274 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:02:55,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:02:55,274 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:55,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:55,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1556260851, now seen corresponding path program 1 times [2025-01-09 00:02:55,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:55,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485929894] [2025-01-09 00:02:55,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:55,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:55,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-01-09 00:02:55,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-01-09 00:02:55,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:55,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 802 proven. 51 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-01-09 00:02:56,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:56,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485929894] [2025-01-09 00:02:56,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485929894] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:02:56,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253030020] [2025-01-09 00:02:56,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:56,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:02:56,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:02:56,066 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:02:56,068 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:02:56,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-01-09 00:02:56,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-01-09 00:02:56,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:56,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:56,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:02:56,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:02:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2025-01-09 00:02:57,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:02:57,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253030020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:57,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:02:57,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-09 00:02:57,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022608392] [2025-01-09 00:02:57,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:57,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:02:57,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:57,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:02:57,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:02:57,180 INFO L87 Difference]: Start difference. First operand 16846 states and 17359 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states 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:02:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:58,461 INFO L93 Difference]: Finished difference Result 39687 states and 40957 transitions. [2025-01-09 00:02:58,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:02:58,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 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 838 [2025-01-09 00:02:58,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:58,484 INFO L225 Difference]: With dead ends: 39687 [2025-01-09 00:02:58,485 INFO L226 Difference]: Without dead ends: 23142 [2025-01-09 00:02:58,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:02:58,497 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 303 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:58,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 123 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:02:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23142 states. [2025-01-09 00:02:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23142 to 19541. [2025-01-09 00:02:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19541 states, 19540 states have (on average 1.028300921187308) internal successors, (20093), 19540 states have internal predecessors, (20093), 0 states have call successors, (0), 0 states 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:02:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19541 states to 19541 states and 20093 transitions. [2025-01-09 00:02:58,655 INFO L78 Accepts]: Start accepts. Automaton has 19541 states and 20093 transitions. Word has length 838 [2025-01-09 00:02:58,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:58,656 INFO L471 AbstractCegarLoop]: Abstraction has 19541 states and 20093 transitions. [2025-01-09 00:02:58,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states 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:02:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 19541 states and 20093 transitions. [2025-01-09 00:02:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2025-01-09 00:02:58,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:58,672 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:02:58,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 00:02:58,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:02:58,873 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:58,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:58,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1351127748, now seen corresponding path program 1 times [2025-01-09 00:02:58,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:58,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073585934] [2025-01-09 00:02:58,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:58,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:58,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 920 statements into 1 equivalence classes. [2025-01-09 00:02:59,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 920 of 920 statements. [2025-01-09 00:02:59,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:59,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2025-01-09 00:02:59,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:59,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073585934] [2025-01-09 00:02:59,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073585934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:59,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:59,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:02:59,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568980843] [2025-01-09 00:02:59,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:59,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:02:59,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:59,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:02:59,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:02:59,315 INFO L87 Difference]: Start difference. First operand 19541 states and 20093 transitions. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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:03:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:00,394 INFO L93 Difference]: Finished difference Result 42672 states and 43896 transitions. [2025-01-09 00:03:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:03:00,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 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 920 [2025-01-09 00:03:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:00,414 INFO L225 Difference]: With dead ends: 42672 [2025-01-09 00:03:00,415 INFO L226 Difference]: Without dead ends: 23733 [2025-01-09 00:03:00,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:03:00,426 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 516 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:00,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 135 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:03:00,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23733 states. [2025-01-09 00:03:00,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23733 to 18941. [2025-01-09 00:03:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18941 states, 18940 states have (on average 1.028194297782471) internal successors, (19474), 18940 states have internal predecessors, (19474), 0 states have call successors, (0), 0 states 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:03:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18941 states to 18941 states and 19474 transitions. [2025-01-09 00:03:00,562 INFO L78 Accepts]: Start accepts. Automaton has 18941 states and 19474 transitions. Word has length 920 [2025-01-09 00:03:00,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:00,562 INFO L471 AbstractCegarLoop]: Abstraction has 18941 states and 19474 transitions. [2025-01-09 00:03:00,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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:03:00,562 INFO L276 IsEmpty]: Start isEmpty. Operand 18941 states and 19474 transitions. [2025-01-09 00:03:00,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 926 [2025-01-09 00:03:00,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:00,574 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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:03:00,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:03:00,575 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:00,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash -70205286, now seen corresponding path program 1 times [2025-01-09 00:03:00,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:00,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992263290] [2025-01-09 00:03:00,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:00,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:00,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 925 statements into 1 equivalence classes. [2025-01-09 00:03:00,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 925 of 925 statements. [2025-01-09 00:03:00,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:00,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 742 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2025-01-09 00:03:01,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:01,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992263290] [2025-01-09 00:03:01,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992263290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:01,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:01,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:01,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438893602] [2025-01-09 00:03:01,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:01,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:01,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:01,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:01,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:01,060 INFO L87 Difference]: Start difference. First operand 18941 states and 19474 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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:03:01,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:01,902 INFO L93 Difference]: Finished difference Result 38471 states and 39655 transitions. [2025-01-09 00:03:01,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:01,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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 925 [2025-01-09 00:03:01,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:01,924 INFO L225 Difference]: With dead ends: 38471 [2025-01-09 00:03:01,925 INFO L226 Difference]: Without dead ends: 22227 [2025-01-09 00:03:01,937 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:03:01,938 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 312 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:01,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 503 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:03:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22227 states. [2025-01-09 00:03:02,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22227 to 20433. [2025-01-09 00:03:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20433 states, 20432 states have (on average 1.0269185591229444) internal successors, (20982), 20432 states have internal predecessors, (20982), 0 states have call successors, (0), 0 states 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:03:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20433 states to 20433 states and 20982 transitions. [2025-01-09 00:03:02,173 INFO L78 Accepts]: Start accepts. Automaton has 20433 states and 20982 transitions. Word has length 925 [2025-01-09 00:03:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:02,174 INFO L471 AbstractCegarLoop]: Abstraction has 20433 states and 20982 transitions. [2025-01-09 00:03:02,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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:03:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 20433 states and 20982 transitions. [2025-01-09 00:03:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2025-01-09 00:03:02,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:02,198 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:03:02,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:03:02,198 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:02,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:02,199 INFO L85 PathProgramCache]: Analyzing trace with hash -733256918, now seen corresponding path program 1 times [2025-01-09 00:03:02,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:02,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356117835] [2025-01-09 00:03:02,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:02,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:02,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1077 statements into 1 equivalence classes. [2025-01-09 00:03:02,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1077 of 1077 statements. [2025-01-09 00:03:02,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:02,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:03,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 1370 proven. 51 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2025-01-09 00:03:03,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:03,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356117835] [2025-01-09 00:03:03,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356117835] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:03:03,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305384105] [2025-01-09 00:03:03,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:03,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:03,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:03:03,179 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:03:03,180 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:03:03,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1077 statements into 1 equivalence classes. [2025-01-09 00:03:03,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1077 of 1077 statements. [2025-01-09 00:03:03,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:03,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:03,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 1259 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:03:03,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:03:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 1520 proven. 266 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2025-01-09 00:03:05,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:03:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 955 proven. 0 refuted. 0 times theorem prover too weak. 1295 trivial. 0 not checked. [2025-01-09 00:03:05,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305384105] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:03:05,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:03:05,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 8 [2025-01-09 00:03:05,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228484531] [2025-01-09 00:03:05,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:05,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:05,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:05,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:05,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:03:05,421 INFO L87 Difference]: Start difference. First operand 20433 states and 20982 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:03:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:06,122 INFO L93 Difference]: Finished difference Result 33039 states and 33931 transitions. [2025-01-09 00:03:06,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:06,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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 1077 [2025-01-09 00:03:06,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:06,152 INFO L225 Difference]: With dead ends: 33039 [2025-01-09 00:03:06,152 INFO L226 Difference]: Without dead ends: 15004 [2025-01-09 00:03:06,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2157 GetRequests, 2151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:03:06,165 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 193 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:06,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 359 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:03:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15004 states. [2025-01-09 00:03:06,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15004 to 14107. [2025-01-09 00:03:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14107 states, 14106 states have (on average 1.0194952502481214) internal successors, (14381), 14106 states have internal predecessors, (14381), 0 states have call successors, (0), 0 states 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:03:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14107 states to 14107 states and 14381 transitions. [2025-01-09 00:03:06,268 INFO L78 Accepts]: Start accepts. Automaton has 14107 states and 14381 transitions. Word has length 1077 [2025-01-09 00:03:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:06,269 INFO L471 AbstractCegarLoop]: Abstraction has 14107 states and 14381 transitions. [2025-01-09 00:03:06,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:03:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 14107 states and 14381 transitions. [2025-01-09 00:03:06,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1090 [2025-01-09 00:03:06,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:06,281 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:03:06,289 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:03:06,482 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,SelfDestructingSolverStorable21 [2025-01-09 00:03:06,482 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:06,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:06,483 INFO L85 PathProgramCache]: Analyzing trace with hash -135056321, now seen corresponding path program 1 times [2025-01-09 00:03:06,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:06,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471633291] [2025-01-09 00:03:06,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:06,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1089 statements into 1 equivalence classes. [2025-01-09 00:03:06,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1089 of 1089 statements. [2025-01-09 00:03:06,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:06,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1988 backedges. 1272 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2025-01-09 00:03:07,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:07,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471633291] [2025-01-09 00:03:07,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471633291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:07,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:07,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:03:07,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422442253] [2025-01-09 00:03:07,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:07,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:03:07,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:07,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:03:07,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:03:07,362 INFO L87 Difference]: Start difference. First operand 14107 states and 14381 transitions. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states 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:03:08,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:08,486 INFO L93 Difference]: Finished difference Result 22806 states and 23250 transitions. [2025-01-09 00:03:08,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:03:08,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 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 1089 [2025-01-09 00:03:08,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:08,507 INFO L225 Difference]: With dead ends: 22806 [2025-01-09 00:03:08,508 INFO L226 Difference]: Without dead ends: 22804 [2025-01-09 00:03:08,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:03:08,514 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 369 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:08,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 76 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:03:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22804 states. [2025-01-09 00:03:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22804 to 15307. [2025-01-09 00:03:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15307 states, 15306 states have (on average 1.0195348229452503) internal successors, (15605), 15306 states have internal predecessors, (15605), 0 states have call successors, (0), 0 states 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:03:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15307 states to 15307 states and 15605 transitions. [2025-01-09 00:03:08,739 INFO L78 Accepts]: Start accepts. Automaton has 15307 states and 15605 transitions. Word has length 1089 [2025-01-09 00:03:08,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:08,740 INFO L471 AbstractCegarLoop]: Abstraction has 15307 states and 15605 transitions. [2025-01-09 00:03:08,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states 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:03:08,740 INFO L276 IsEmpty]: Start isEmpty. Operand 15307 states and 15605 transitions. [2025-01-09 00:03:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1186 [2025-01-09 00:03:08,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:08,773 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 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:03:08,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 00:03:08,774 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:08,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1614871150, now seen corresponding path program 1 times [2025-01-09 00:03:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:08,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949165465] [2025-01-09 00:03:08,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:08,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:08,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1185 statements into 1 equivalence classes. [2025-01-09 00:03:08,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1185 of 1185 statements. [2025-01-09 00:03:08,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:08,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2221 backedges. 254 proven. 1108 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2025-01-09 00:03:09,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:09,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949165465] [2025-01-09 00:03:09,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949165465] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:03:09,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034051477] [2025-01-09 00:03:09,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:09,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:09,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:03:09,888 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:03:09,892 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:03:10,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1185 statements into 1 equivalence classes. [2025-01-09 00:03:10,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1185 of 1185 statements. [2025-01-09 00:03:10,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:10,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:10,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 1343 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:03:10,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:03:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2221 backedges. 1439 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2025-01-09 00:03:10,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:03:10,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034051477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:10,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:03:10,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:03:10,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476842402] [2025-01-09 00:03:10,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:10,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:10,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:10,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:10,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:03:10,610 INFO L87 Difference]: Start difference. First operand 15307 states and 15605 transitions. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states 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:03:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:11,257 INFO L93 Difference]: Finished difference Result 32105 states and 32742 transitions. [2025-01-09 00:03:11,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:11,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1185 [2025-01-09 00:03:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:11,274 INFO L225 Difference]: With dead ends: 32105 [2025-01-09 00:03:11,275 INFO L226 Difference]: Without dead ends: 19497 [2025-01-09 00:03:11,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1188 GetRequests, 1184 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:03:11,285 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 197 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:11,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 369 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:03:11,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19497 states. [2025-01-09 00:03:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19497 to 15900. [2025-01-09 00:03:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15900 states, 15899 states have (on average 1.0184917290395623) internal successors, (16193), 15899 states have internal predecessors, (16193), 0 states have call successors, (0), 0 states 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:03:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15900 states to 15900 states and 16193 transitions. [2025-01-09 00:03:11,415 INFO L78 Accepts]: Start accepts. Automaton has 15900 states and 16193 transitions. Word has length 1185 [2025-01-09 00:03:11,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:11,416 INFO L471 AbstractCegarLoop]: Abstraction has 15900 states and 16193 transitions. [2025-01-09 00:03:11,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states 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:03:11,416 INFO L276 IsEmpty]: Start isEmpty. Operand 15900 states and 16193 transitions. [2025-01-09 00:03:11,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1214 [2025-01-09 00:03:11,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:11,431 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:03:11,438 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:03:11,635 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,SelfDestructingSolverStorable23 [2025-01-09 00:03:11,635 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:11,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:11,636 INFO L85 PathProgramCache]: Analyzing trace with hash 100281830, now seen corresponding path program 1 times [2025-01-09 00:03:11,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:11,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465227442] [2025-01-09 00:03:11,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:11,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:11,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1213 statements into 1 equivalence classes. [2025-01-09 00:03:11,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1213 of 1213 statements. [2025-01-09 00:03:11,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:11,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2333 backedges. 1135 proven. 0 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2025-01-09 00:03:12,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:12,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465227442] [2025-01-09 00:03:12,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465227442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:12,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:12,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:03:12,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988481550] [2025-01-09 00:03:12,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:12,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:03:12,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:12,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:03:12,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:03:12,891 INFO L87 Difference]: Start difference. First operand 15900 states and 16193 transitions. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states 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:03:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:14,337 INFO L93 Difference]: Finished difference Result 30895 states and 31478 transitions. [2025-01-09 00:03:14,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:03:14,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 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 1213 [2025-01-09 00:03:14,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:14,353 INFO L225 Difference]: With dead ends: 30895 [2025-01-09 00:03:14,353 INFO L226 Difference]: Without dead ends: 17694 [2025-01-09 00:03:14,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:03:14,362 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 428 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 2164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:14,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 537 Invalid, 2164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2130 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:03:14,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17694 states. [2025-01-09 00:03:14,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17694 to 15296. [2025-01-09 00:03:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15296 states, 15295 states have (on average 1.0177182085648906) internal successors, (15566), 15295 states have internal predecessors, (15566), 0 states have call successors, (0), 0 states 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:03:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15296 states to 15296 states and 15566 transitions. [2025-01-09 00:03:14,540 INFO L78 Accepts]: Start accepts. Automaton has 15296 states and 15566 transitions. Word has length 1213 [2025-01-09 00:03:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:14,541 INFO L471 AbstractCegarLoop]: Abstraction has 15296 states and 15566 transitions. [2025-01-09 00:03:14,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states 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:03:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 15296 states and 15566 transitions. [2025-01-09 00:03:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1494 [2025-01-09 00:03:14,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:14,573 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:14,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 00:03:14,577 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:14,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:14,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1963580049, now seen corresponding path program 1 times [2025-01-09 00:03:14,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:14,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599192040] [2025-01-09 00:03:14,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:14,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:14,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1493 statements into 1 equivalence classes. [2025-01-09 00:03:14,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1493 of 1493 statements. [2025-01-09 00:03:14,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:14,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 2372 proven. 458 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2025-01-09 00:03:17,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:17,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599192040] [2025-01-09 00:03:17,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599192040] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:03:17,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364759434] [2025-01-09 00:03:17,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:17,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:17,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:03:17,195 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:03:17,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 00:03:17,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1493 statements into 1 equivalence classes. [2025-01-09 00:03:17,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1493 of 1493 statements. [2025-01-09 00:03:17,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:17,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:17,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1699 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:03:17,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:03:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 2481 proven. 0 refuted. 0 times theorem prover too weak. 1259 trivial. 0 not checked. [2025-01-09 00:03:17,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:03:17,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364759434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:17,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:03:17,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:03:17,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490678760] [2025-01-09 00:03:17,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:17,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:17,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:17,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:17,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:03:17,781 INFO L87 Difference]: Start difference. First operand 15296 states and 15566 transitions. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states 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:03:18,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:18,378 INFO L93 Difference]: Finished difference Result 29993 states and 30525 transitions. [2025-01-09 00:03:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:18,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 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 1493 [2025-01-09 00:03:18,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:18,394 INFO L225 Difference]: With dead ends: 29993 [2025-01-09 00:03:18,394 INFO L226 Difference]: Without dead ends: 17394 [2025-01-09 00:03:18,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1497 GetRequests, 1493 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:03:18,403 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 195 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:18,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 426 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:03:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17394 states. [2025-01-09 00:03:18,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17394 to 16494. [2025-01-09 00:03:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16494 states, 16493 states have (on average 1.0170981628569695) internal successors, (16775), 16493 states have internal predecessors, (16775), 0 states have call successors, (0), 0 states 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:03:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16494 states to 16494 states and 16775 transitions. [2025-01-09 00:03:18,518 INFO L78 Accepts]: Start accepts. Automaton has 16494 states and 16775 transitions. Word has length 1493 [2025-01-09 00:03:18,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:18,518 INFO L471 AbstractCegarLoop]: Abstraction has 16494 states and 16775 transitions. [2025-01-09 00:03:18,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states 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:03:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 16494 states and 16775 transitions. [2025-01-09 00:03:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2025-01-09 00:03:18,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:18,535 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:18,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 00:03:18,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 00:03:18,736 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:18,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2088851947, now seen corresponding path program 1 times [2025-01-09 00:03:18,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:18,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576548505] [2025-01-09 00:03:18,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:18,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1495 statements into 1 equivalence classes. [2025-01-09 00:03:18,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1495 of 1495 statements. [2025-01-09 00:03:18,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:18,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4156 backedges. 2622 proven. 460 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2025-01-09 00:03:21,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:21,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576548505] [2025-01-09 00:03:21,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576548505] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:03:21,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426626760] [2025-01-09 00:03:21,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:21,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:21,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:03:21,142 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:03:21,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 00:03:21,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1495 statements into 1 equivalence classes. [2025-01-09 00:03:21,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1495 of 1495 statements. [2025-01-09 00:03:21,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:21,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:21,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 1723 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:03:21,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:03:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4156 backedges. 1571 proven. 0 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2025-01-09 00:03:24,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:03:24,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426626760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:24,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:03:24,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 00:03:24,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766360959] [2025-01-09 00:03:24,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:24,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:03:24,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:24,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:03:24,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:03:24,574 INFO L87 Difference]: Start difference. First operand 16494 states and 16775 transitions. Second operand has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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:03:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:30,622 INFO L93 Difference]: Finished difference Result 23690 states and 24084 transitions. [2025-01-09 00:03:30,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:03:30,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 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 1495 [2025-01-09 00:03:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:30,624 INFO L225 Difference]: With dead ends: 23690 [2025-01-09 00:03:30,624 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:03:30,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1499 GetRequests, 1495 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:03:30,633 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 369 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 76 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:30,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 71 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1380 Invalid, 8 Unknown, 0 Unchecked, 5.9s Time] [2025-01-09 00:03:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:03:30,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:03:30,634 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:03:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:03:30,634 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1495 [2025-01-09 00:03:30,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:30,634 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:03:30,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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:03:30,635 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:03:30,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:03:30,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:03:30,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 00:03:30,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:30,848 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:30,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:03:37,006 WARN L286 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 535 DAG size of output: 672 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-09 00:03:40,778 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:03:40,808 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-01-09 00:03:40,809 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-01-09 00:03:40,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:03:40 BoogieIcfgContainer [2025-01-09 00:03:40,817 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:03:40,818 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:03:40,818 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:03:40,818 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:03:40,822 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:02:18" (3/4) ... [2025-01-09 00:03:40,828 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:03:40,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 00:03:40,871 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:03:40,872 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:03:40,875 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:03:41,114 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:03:41,119 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:03:41,119 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:03:41,120 INFO L158 Benchmark]: Toolchain (without parser) took 85153.52ms. Allocated memory was 201.3MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 154.0MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 448.1MB. Max. memory is 16.1GB. [2025-01-09 00:03:41,120 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 209.7MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:03:41,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.02ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 80.7MB in the end (delta: 73.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-01-09 00:03:41,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 173.64ms. Allocated memory is still 201.3MB. Free memory was 80.7MB in the beginning and 129.4MB in the end (delta: -48.7MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2025-01-09 00:03:41,120 INFO L158 Benchmark]: Boogie Preprocessor took 200.89ms. Allocated memory is still 201.3MB. Free memory was 129.4MB in the beginning and 72.6MB in the end (delta: 56.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 00:03:41,120 INFO L158 Benchmark]: RCFGBuilder took 2062.55ms. Allocated memory was 201.3MB in the beginning and 285.2MB in the end (delta: 83.9MB). Free memory was 72.6MB in the beginning and 166.6MB in the end (delta: -93.9MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2025-01-09 00:03:41,121 INFO L158 Benchmark]: TraceAbstraction took 81839.63ms. Allocated memory was 285.2MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 166.6MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-01-09 00:03:41,121 INFO L158 Benchmark]: Witness Printer took 301.26ms. Allocated memory is still 2.1GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:03:41,121 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 209.7MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.02ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 80.7MB in the end (delta: 73.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 173.64ms. Allocated memory is still 201.3MB. Free memory was 80.7MB in the beginning and 129.4MB in the end (delta: -48.7MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 200.89ms. Allocated memory is still 201.3MB. Free memory was 129.4MB in the beginning and 72.6MB in the end (delta: 56.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2062.55ms. Allocated memory was 201.3MB in the beginning and 285.2MB in the end (delta: 83.9MB). Free memory was 72.6MB in the beginning and 166.6MB in the end (delta: -93.9MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * TraceAbstraction took 81839.63ms. Allocated memory was 285.2MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 166.6MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 301.26ms. Allocated memory is still 2.1GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 176]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.8s, OverallIterations: 27, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 39.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 10907 SdHoareTripleChecker+Valid, 36.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10907 mSDsluCounter, 9811 SdHoareTripleChecker+Invalid, 31.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1206 mSDsCounter, 4297 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32142 IncrementalHoareTripleChecker+Invalid, 36447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4297 mSolverCounterUnsat, 8605 mSDtfsCounter, 32142 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9158 GetRequests, 9091 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20433occurred in iteration=21, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 39595 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 25376 NumberOfCodeBlocks, 25376 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 27025 ConstructedInterpolants, 661 QuantifiedInterpolants, 82506 SizeOfPredicates, 6 NumberOfNonLiveVariables, 8566 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 36 InterpolantComputations, 26 PerfectInterpolantSequences, 43226/45927 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((long long) 89 + a4) <= 0) && (a29 <= 42)) && (3 == a2)) || (((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (3 == a2))) || (((((long long) 89 + a4) <= 0) && (a29 <= 42)) && (a2 == 4))) || ((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (a2 == 1))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || (((5 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0))) || (((((long long) 42 + a4) <= 0) && (a2 == 4)) && ((((long long) a0 + 300075) == 0) || (((long long) a0 + 300075) < 0)))) || (((5 == a2) && (((long long) 42 + a4) <= 0)) && ((((long long) a0 + 300075) == 0) || (((long long) a0 + 300075) < 0)))) || (((((long long) 89 + a4) <= 0) && (a29 <= 42)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0))) || ((((5 == a2) && (0 <= ((long long) a29 + 15))) && (((long long) 89 + a4) <= 0)) && (a29 <= 42))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a29 + 15))) && ((((0 <= ((long long) a4 + 85)) && (a2 == 1)) && (a29 <= 42)) || (((a2 == 1) && (a29 <= 42)) && (((long long) a0 + 61) <= 0))))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (a29 <= 42))) || (((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a29 + 127) == 0)) && (((long long) 44 + a0) == 0))) || (((((((0 <= ((long long) a0 + 459337)) && (5 == a2)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0)) && (a29 <= 42))) || ((((5 == a2) && (((long long) 42 + a4) <= 0)) && (44 <= a29)) && (((long long) 98 + a0) <= 0))) || ((((0 <= ((long long) a0 + 459337)) && (((long long) 42 + a4) <= 0)) && ((((0 <= ((long long) a4 + 85)) && (a2 == 1)) && (a29 <= 42)) || (((a2 == 1) && (a29 <= 42)) && (((long long) a0 + 61) <= 0)))) && ((((long long) a0 + 300075) == 0) || (((long long) a0 + 300075) < 0)))) || (((((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (a2 == 1)) && (a29 <= 42)) && (((long long) a0 + 61) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (a2 == 4)) && (((long long) a29 + 127) <= 0))) || ((((2 == a2) && (44 <= a29)) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a0 + 60)))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0))) || (((((long long) a0 + 578258) <= 0) && (44 <= a29)) && (((long long) 89 + a4) <= 0))) || (((5 == a2) && (44 <= a29)) && (((long long) 89 + a4) <= 0))) || (((2 == a2) && (44 <= a29)) && (((long long) a0 + 386992) <= 0))) || (((((5 == a2) && (((long long) 42 + a4) <= 0)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a29 <= 42))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a29 + 15))) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:03:41,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE