./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label24.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/Problem11_label24.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 63c3a28a771a7642d2d01d4b50ea8f0914adef37135dc9c64a20524a1e6d797b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:41:45,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:41:45,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:41:45,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:41:45,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:41:45,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:41:45,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:41:45,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:41:45,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:41:45,743 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:41:45,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:41:45,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:41:45,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:41:45,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:41:45,744 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:41:45,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:41:45,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:41:45,744 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:41:45,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:41:45,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:41:45,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:41:45,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:41:45,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:41:45,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:41:45,744 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:41:45,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:41:45,744 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:41:45,744 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:41:45,745 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:41:45,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:41:45,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:41:45,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:41:45,745 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 -> 63c3a28a771a7642d2d01d4b50ea8f0914adef37135dc9c64a20524a1e6d797b [2025-01-08 23:41:45,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:41:45,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:41:45,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:41:45,966 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:41:45,966 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:41:45,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label24.c [2025-01-08 23:41:47,049 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ca339d14/af63f5373c9345f18d6e20db39e8154c/FLAG98019fcc5 [2025-01-08 23:41:47,378 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:41:47,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label24.c [2025-01-08 23:41:47,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ca339d14/af63f5373c9345f18d6e20db39e8154c/FLAG98019fcc5 [2025-01-08 23:41:47,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ca339d14/af63f5373c9345f18d6e20db39e8154c [2025-01-08 23:41:47,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:41:47,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:41:47,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:41:47,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:41:47,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:41:47,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:41:47" (1/1) ... [2025-01-08 23:41:47,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c635d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:47, skipping insertion in model container [2025-01-08 23:41:47,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:41:47" (1/1) ... [2025-01-08 23:41:47,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:41:47,793 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/Problem11_label24.c[7451,7464] [2025-01-08 23:41:47,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:41:47,942 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:41:47,956 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/Problem11_label24.c[7451,7464] [2025-01-08 23:41:48,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:41:48,025 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:41:48,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:48 WrapperNode [2025-01-08 23:41:48,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:41:48,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:41:48,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:41:48,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:41:48,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:48" (1/1) ... [2025-01-08 23:41:48,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:48" (1/1) ... [2025-01-08 23:41:48,110 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-01-08 23:41:48,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:41:48,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:41:48,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:41:48,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:41:48,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:48" (1/1) ... [2025-01-08 23:41:48,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:48" (1/1) ... [2025-01-08 23:41:48,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:48" (1/1) ... [2025-01-08 23:41:48,171 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:41:48,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:48" (1/1) ... [2025-01-08 23:41:48,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:48" (1/1) ... [2025-01-08 23:41:48,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:48" (1/1) ... [2025-01-08 23:41:48,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:48" (1/1) ... [2025-01-08 23:41:48,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:48" (1/1) ... [2025-01-08 23:41:48,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:48" (1/1) ... [2025-01-08 23:41:48,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:48" (1/1) ... [2025-01-08 23:41:48,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:41:48,257 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:41:48,257 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:41:48,257 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:41:48,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:48" (1/1) ... [2025-01-08 23:41:48,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:41:48,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:48,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:41:48,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:41:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:41:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:41:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:41:48,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:41:48,370 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:41:48,371 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:41:49,473 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-08 23:41:49,473 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:41:49,490 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:41:49,491 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:41:49,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:41:49 BoogieIcfgContainer [2025-01-08 23:41:49,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:41:49,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:41:49,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:41:49,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:41:49,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:41:47" (1/3) ... [2025-01-08 23:41:49,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec4b288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:41:49, skipping insertion in model container [2025-01-08 23:41:49,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:48" (2/3) ... [2025-01-08 23:41:49,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec4b288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:41:49, skipping insertion in model container [2025-01-08 23:41:49,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:41:49" (3/3) ... [2025-01-08 23:41:49,501 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label24.c [2025-01-08 23:41:49,510 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:41:49,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label24.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:41:49,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:41:49,551 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;@674931f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:41:49,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:41:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-08 23:41:49,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:49,559 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] [2025-01-08 23:41:49,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:49,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash -700415300, now seen corresponding path program 1 times [2025-01-08 23:41:49,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:49,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102769110] [2025-01-08 23:41:49,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:49,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:49,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-08 23:41:49,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-08 23:41:49,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:49,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:49,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:49,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102769110] [2025-01-08 23:41:49,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102769110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:49,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:49,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:49,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868097038] [2025-01-08 23:41:49,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:49,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:49,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:49,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:49,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:49,801 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 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.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:50,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:50,610 INFO L93 Difference]: Finished difference Result 761 states and 1342 transitions. [2025-01-08 23:41:50,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:50,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-01-08 23:41:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:50,619 INFO L225 Difference]: With dead ends: 761 [2025-01-08 23:41:50,619 INFO L226 Difference]: Without dead ends: 413 [2025-01-08 23:41:50,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:50,623 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 177 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:50,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:41:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-01-08 23:41:50,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-01-08 23:41:50,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:50,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2025-01-08 23:41:50,660 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 51 [2025-01-08 23:41:50,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:50,660 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2025-01-08 23:41:50,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:50,660 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2025-01-08 23:41:50,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-08 23:41:50,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:50,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:50,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:41:50,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:50,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1643057757, now seen corresponding path program 1 times [2025-01-08 23:41:50,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:50,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255022829] [2025-01-08 23:41:50,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:50,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:50,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-08 23:41:50,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-08 23:41:50,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:50,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:50,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:50,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255022829] [2025-01-08 23:41:50,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255022829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:50,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:50,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:50,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700514683] [2025-01-08 23:41:50,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:50,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:50,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:50,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:50,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:50,918 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:51,554 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2025-01-08 23:41:51,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:51,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-01-08 23:41:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:51,558 INFO L225 Difference]: With dead ends: 1211 [2025-01-08 23:41:51,558 INFO L226 Difference]: Without dead ends: 800 [2025-01-08 23:41:51,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:51,559 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:51,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 119 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:51,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-08 23:41:51,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2025-01-08 23:41:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2025-01-08 23:41:51,581 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 119 [2025-01-08 23:41:51,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:51,581 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2025-01-08 23:41:51,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2025-01-08 23:41:51,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-08 23:41:51,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:51,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:51,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:41:51,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:51,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:51,584 INFO L85 PathProgramCache]: Analyzing trace with hash 424945384, now seen corresponding path program 1 times [2025-01-08 23:41:51,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:51,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763651638] [2025-01-08 23:41:51,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:51,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:51,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-08 23:41:51,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-08 23:41:51,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:51,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:51,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:51,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763651638] [2025-01-08 23:41:51,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763651638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:51,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:51,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:51,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375429889] [2025-01-08 23:41:51,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:51,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:51,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:51,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:51,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:51,808 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:52,455 INFO L93 Difference]: Finished difference Result 2314 states and 3184 transitions. [2025-01-08 23:41:52,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:52,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-01-08 23:41:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:52,466 INFO L225 Difference]: With dead ends: 2314 [2025-01-08 23:41:52,466 INFO L226 Difference]: Without dead ends: 1527 [2025-01-08 23:41:52,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:52,473 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 120 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:52,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 193 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-01-08 23:41:52,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2025-01-08 23:41:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.2177049180327868) internal successors, (1857), 1525 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1857 transitions. [2025-01-08 23:41:52,544 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1857 transitions. Word has length 120 [2025-01-08 23:41:52,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:52,545 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1857 transitions. [2025-01-08 23:41:52,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1857 transitions. [2025-01-08 23:41:52,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-08 23:41:52,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:52,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:52,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:41:52,559 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:52,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1173490291, now seen corresponding path program 1 times [2025-01-08 23:41:52,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:52,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117207207] [2025-01-08 23:41:52,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:52,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:52,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-08 23:41:52,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-08 23:41:52,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:52,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:52,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117207207] [2025-01-08 23:41:52,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117207207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:52,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:52,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:52,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950632830] [2025-01-08 23:41:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:52,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:52,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:52,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:52,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:52,965 INFO L87 Difference]: Start difference. First operand 1526 states and 1857 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:53,887 INFO L93 Difference]: Finished difference Result 3257 states and 4126 transitions. [2025-01-08 23:41:53,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:53,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-01-08 23:41:53,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:53,898 INFO L225 Difference]: With dead ends: 3257 [2025-01-08 23:41:53,899 INFO L226 Difference]: Without dead ends: 1917 [2025-01-08 23:41:53,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:53,905 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 184 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:53,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 320 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:41:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-01-08 23:41:53,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1914. [2025-01-08 23:41:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.246732880292734) internal successors, (2385), 1913 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2385 transitions. [2025-01-08 23:41:53,956 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2385 transitions. Word has length 178 [2025-01-08 23:41:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:53,958 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2385 transitions. [2025-01-08 23:41:53,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:53,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2385 transitions. [2025-01-08 23:41:53,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-01-08 23:41:53,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:53,965 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, 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] [2025-01-08 23:41:53,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:41:53,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:53,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:53,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1137015546, now seen corresponding path program 1 times [2025-01-08 23:41:53,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:53,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969575233] [2025-01-08 23:41:53,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:54,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-08 23:41:54,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-08 23:41:54,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:54,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:54,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:54,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969575233] [2025-01-08 23:41:54,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969575233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:54,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:54,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242862761] [2025-01-08 23:41:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:54,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:54,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:54,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:54,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:54,330 INFO L87 Difference]: Start difference. First operand 1914 states and 2385 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:55,321 INFO L93 Difference]: Finished difference Result 4579 states and 5797 transitions. [2025-01-08 23:41:55,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:55,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-01-08 23:41:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:55,330 INFO L225 Difference]: With dead ends: 4579 [2025-01-08 23:41:55,330 INFO L226 Difference]: Without dead ends: 2851 [2025-01-08 23:41:55,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:55,333 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:55,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 339 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:41:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2025-01-08 23:41:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2469. [2025-01-08 23:41:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2468 states have (on average 1.2374392220421393) internal successors, (3054), 2468 states have internal predecessors, (3054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3054 transitions. [2025-01-08 23:41:55,402 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3054 transitions. Word has length 231 [2025-01-08 23:41:55,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:55,403 INFO L471 AbstractCegarLoop]: Abstraction has 2469 states and 3054 transitions. [2025-01-08 23:41:55,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3054 transitions. [2025-01-08 23:41:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-08 23:41:55,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:55,405 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, 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] [2025-01-08 23:41:55,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:41:55,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:55,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:55,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1067615259, now seen corresponding path program 1 times [2025-01-08 23:41:55,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:55,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980161164] [2025-01-08 23:41:55,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:55,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:55,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-08 23:41:55,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-08 23:41:55,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:55,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:55,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:55,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980161164] [2025-01-08 23:41:55,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980161164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:55,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:55,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:41:55,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046251218] [2025-01-08 23:41:55,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:55,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:41:55,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:55,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:41:55,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:41:55,793 INFO L87 Difference]: Start difference. First operand 2469 states and 3054 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:56,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:56,843 INFO L93 Difference]: Finished difference Result 7725 states and 9788 transitions. [2025-01-08 23:41:56,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:41:56,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-01-08 23:41:56,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:56,855 INFO L225 Difference]: With dead ends: 7725 [2025-01-08 23:41:56,855 INFO L226 Difference]: Without dead ends: 5258 [2025-01-08 23:41:56,857 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-08 23:41:56,858 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 333 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:56,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 71 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:41:56,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2025-01-08 23:41:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5059. [2025-01-08 23:41:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5059 states, 5058 states have (on average 1.2370502174772637) internal successors, (6257), 5058 states have internal predecessors, (6257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5059 states to 5059 states and 6257 transitions. [2025-01-08 23:41:56,914 INFO L78 Accepts]: Start accepts. Automaton has 5059 states and 6257 transitions. Word has length 232 [2025-01-08 23:41:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:56,914 INFO L471 AbstractCegarLoop]: Abstraction has 5059 states and 6257 transitions. [2025-01-08 23:41:56,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 5059 states and 6257 transitions. [2025-01-08 23:41:56,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-01-08 23:41:56,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:56,918 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, 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] [2025-01-08 23:41:56,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:41:56,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:56,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:56,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1840187989, now seen corresponding path program 1 times [2025-01-08 23:41:56,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:56,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238310610] [2025-01-08 23:41:56,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:56,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:56,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-01-08 23:41:56,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-01-08 23:41:56,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:56,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 23:41:57,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:57,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238310610] [2025-01-08 23:41:57,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238310610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:57,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:57,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:57,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315731238] [2025-01-08 23:41:57,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:57,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:57,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:57,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:57,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:57,125 INFO L87 Difference]: Start difference. First operand 5059 states and 6257 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:58,283 INFO L93 Difference]: Finished difference Result 11235 states and 14124 transitions. [2025-01-08 23:41:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:58,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 233 [2025-01-08 23:41:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:58,299 INFO L225 Difference]: With dead ends: 11235 [2025-01-08 23:41:58,299 INFO L226 Difference]: Without dead ends: 6546 [2025-01-08 23:41:58,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:58,304 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 146 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:58,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 370 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 23:41:58,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6546 states. [2025-01-08 23:41:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6546 to 6347. [2025-01-08 23:41:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6347 states, 6346 states have (on average 1.219193192562244) internal successors, (7737), 6346 states have internal predecessors, (7737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6347 states to 6347 states and 7737 transitions. [2025-01-08 23:41:58,373 INFO L78 Accepts]: Start accepts. Automaton has 6347 states and 7737 transitions. Word has length 233 [2025-01-08 23:41:58,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:58,373 INFO L471 AbstractCegarLoop]: Abstraction has 6347 states and 7737 transitions. [2025-01-08 23:41:58,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 6347 states and 7737 transitions. [2025-01-08 23:41:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-01-08 23:41:58,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:58,377 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, 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] [2025-01-08 23:41:58,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:41:58,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:58,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:58,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2078465875, now seen corresponding path program 1 times [2025-01-08 23:41:58,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:58,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356293763] [2025-01-08 23:41:58,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:58,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:58,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-08 23:41:58,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-08 23:41:58,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:58,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:58,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:58,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356293763] [2025-01-08 23:41:58,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356293763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:58,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:58,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:58,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548853316] [2025-01-08 23:41:58,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:58,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:41:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:58,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:41:58,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:41:58,629 INFO L87 Difference]: Start difference. First operand 6347 states and 7737 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:59,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:59,615 INFO L93 Difference]: Finished difference Result 14177 states and 17455 transitions. [2025-01-08 23:41:59,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:41:59,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 243 [2025-01-08 23:41:59,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:59,637 INFO L225 Difference]: With dead ends: 14177 [2025-01-08 23:41:59,637 INFO L226 Difference]: Without dead ends: 8200 [2025-01-08 23:41:59,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:41:59,645 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 238 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:59,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 142 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:41:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8200 states. [2025-01-08 23:41:59,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8200 to 8191. [2025-01-08 23:41:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8191 states, 8190 states have (on average 1.1986568986568986) internal successors, (9817), 8190 states have internal predecessors, (9817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8191 states to 8191 states and 9817 transitions. [2025-01-08 23:41:59,729 INFO L78 Accepts]: Start accepts. Automaton has 8191 states and 9817 transitions. Word has length 243 [2025-01-08 23:41:59,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:59,730 INFO L471 AbstractCegarLoop]: Abstraction has 8191 states and 9817 transitions. [2025-01-08 23:41:59,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 8191 states and 9817 transitions. [2025-01-08 23:41:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-01-08 23:41:59,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:59,734 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:41:59,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:41:59,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:59,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:59,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1350361117, now seen corresponding path program 1 times [2025-01-08 23:41:59,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:59,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540349574] [2025-01-08 23:41:59,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:59,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:59,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-01-08 23:41:59,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-01-08 23:41:59,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:59,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-01-08 23:41:59,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:59,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540349574] [2025-01-08 23:41:59,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540349574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:59,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:59,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:59,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400927997] [2025-01-08 23:41:59,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:59,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:59,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:59,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:59,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:59,918 INFO L87 Difference]: Start difference. First operand 8191 states and 9817 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:00,448 INFO L93 Difference]: Finished difference Result 17691 states and 21330 transitions. [2025-01-08 23:42:00,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:00,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 253 [2025-01-08 23:42:00,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:00,465 INFO L225 Difference]: With dead ends: 17691 [2025-01-08 23:42:00,466 INFO L226 Difference]: Without dead ends: 9871 [2025-01-08 23:42:00,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:00,472 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 151 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:00,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 160 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9871 states. [2025-01-08 23:42:00,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9871 to 9478. [2025-01-08 23:42:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9478 states, 9477 states have (on average 1.197636382821568) internal successors, (11350), 9477 states have internal predecessors, (11350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9478 states to 9478 states and 11350 transitions. [2025-01-08 23:42:00,568 INFO L78 Accepts]: Start accepts. Automaton has 9478 states and 11350 transitions. Word has length 253 [2025-01-08 23:42:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:00,569 INFO L471 AbstractCegarLoop]: Abstraction has 9478 states and 11350 transitions. [2025-01-08 23:42:00,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:00,569 INFO L276 IsEmpty]: Start isEmpty. Operand 9478 states and 11350 transitions. [2025-01-08 23:42:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-01-08 23:42:00,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:00,573 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:42:00,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:42:00,574 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:00,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1684089446, now seen corresponding path program 1 times [2025-01-08 23:42:00,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:00,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087388295] [2025-01-08 23:42:00,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:00,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:00,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-01-08 23:42:00,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-01-08 23:42:00,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:00,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-08 23:42:00,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:00,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087388295] [2025-01-08 23:42:00,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087388295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:00,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:00,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:00,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748518140] [2025-01-08 23:42:00,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:00,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:00,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:00,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:00,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:00,745 INFO L87 Difference]: Start difference. First operand 9478 states and 11350 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:01,349 INFO L93 Difference]: Finished difference Result 18963 states and 22722 transitions. [2025-01-08 23:42:01,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:01,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 284 [2025-01-08 23:42:01,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:01,363 INFO L225 Difference]: With dead ends: 18963 [2025-01-08 23:42:01,363 INFO L226 Difference]: Without dead ends: 9671 [2025-01-08 23:42:01,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:01,370 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 150 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:01,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 378 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9671 states. [2025-01-08 23:42:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9671 to 9661. [2025-01-08 23:42:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9661 states, 9660 states have (on average 1.161904761904762) internal successors, (11224), 9660 states have internal predecessors, (11224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9661 states to 9661 states and 11224 transitions. [2025-01-08 23:42:01,446 INFO L78 Accepts]: Start accepts. Automaton has 9661 states and 11224 transitions. Word has length 284 [2025-01-08 23:42:01,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:01,446 INFO L471 AbstractCegarLoop]: Abstraction has 9661 states and 11224 transitions. [2025-01-08 23:42:01,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 9661 states and 11224 transitions. [2025-01-08 23:42:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-01-08 23:42:01,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:01,452 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:01,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:42:01,452 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:01,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:01,453 INFO L85 PathProgramCache]: Analyzing trace with hash -181104591, now seen corresponding path program 1 times [2025-01-08 23:42:01,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:01,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925399692] [2025-01-08 23:42:01,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:01,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:01,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-01-08 23:42:01,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-01-08 23:42:01,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:01,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-01-08 23:42:01,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:01,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925399692] [2025-01-08 23:42:01,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925399692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:01,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:01,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:01,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476556342] [2025-01-08 23:42:01,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:01,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:01,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:01,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:01,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:01,691 INFO L87 Difference]: Start difference. First operand 9661 states and 11224 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:02,274 INFO L93 Difference]: Finished difference Result 22838 states and 26882 transitions. [2025-01-08 23:42:02,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:02,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 310 [2025-01-08 23:42:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:02,291 INFO L225 Difference]: With dead ends: 22838 [2025-01-08 23:42:02,291 INFO L226 Difference]: Without dead ends: 13548 [2025-01-08 23:42:02,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:02,298 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 139 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:02,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 118 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:02,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13548 states. [2025-01-08 23:42:02,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13548 to 13542. [2025-01-08 23:42:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13542 states, 13541 states have (on average 1.1613617901188982) internal successors, (15726), 13541 states have internal predecessors, (15726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13542 states to 13542 states and 15726 transitions. [2025-01-08 23:42:02,394 INFO L78 Accepts]: Start accepts. Automaton has 13542 states and 15726 transitions. Word has length 310 [2025-01-08 23:42:02,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:02,394 INFO L471 AbstractCegarLoop]: Abstraction has 13542 states and 15726 transitions. [2025-01-08 23:42:02,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:02,394 INFO L276 IsEmpty]: Start isEmpty. Operand 13542 states and 15726 transitions. [2025-01-08 23:42:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-08 23:42:02,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:02,401 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:02,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:42:02,401 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:02,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:02,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1931634840, now seen corresponding path program 1 times [2025-01-08 23:42:02,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:02,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409710652] [2025-01-08 23:42:02,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:02,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:02,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-08 23:42:02,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-08 23:42:02,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:02,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:02,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:02,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409710652] [2025-01-08 23:42:02,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409710652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:02,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:02,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:02,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78158549] [2025-01-08 23:42:02,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:02,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:02,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:02,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:02,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:02,966 INFO L87 Difference]: Start difference. First operand 13542 states and 15726 transitions. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:04,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:04,073 INFO L93 Difference]: Finished difference Result 31517 states and 36801 transitions. [2025-01-08 23:42:04,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:04,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 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 320 [2025-01-08 23:42:04,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:04,095 INFO L225 Difference]: With dead ends: 31517 [2025-01-08 23:42:04,095 INFO L226 Difference]: Without dead ends: 18346 [2025-01-08 23:42:04,105 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-08 23:42:04,106 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 289 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:04,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 102 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:42:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18346 states. [2025-01-08 23:42:04,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18346 to 18336. [2025-01-08 23:42:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18336 states, 18335 states have (on average 1.1527679301881648) internal successors, (21136), 18335 states have internal predecessors, (21136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18336 states to 18336 states and 21136 transitions. [2025-01-08 23:42:04,231 INFO L78 Accepts]: Start accepts. Automaton has 18336 states and 21136 transitions. Word has length 320 [2025-01-08 23:42:04,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:04,231 INFO L471 AbstractCegarLoop]: Abstraction has 18336 states and 21136 transitions. [2025-01-08 23:42:04,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:04,231 INFO L276 IsEmpty]: Start isEmpty. Operand 18336 states and 21136 transitions. [2025-01-08 23:42:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-08 23:42:04,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:04,238 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:04,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:42:04,238 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:04,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:04,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1445580510, now seen corresponding path program 1 times [2025-01-08 23:42:04,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:04,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995604847] [2025-01-08 23:42:04,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:04,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-08 23:42:04,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-08 23:42:04,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:04,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 227 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:04,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995604847] [2025-01-08 23:42:04,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995604847] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:42:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176587881] [2025-01-08 23:42:04,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:04,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:04,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:04,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:42:04,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:42:04,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-08 23:42:04,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-08 23:42:04,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:04,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:04,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:42:04,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:42:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-08 23:42:05,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:42:05,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176587881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:05,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:42:05,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:42:05,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172665419] [2025-01-08 23:42:05,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:05,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:05,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:05,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:05,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:42:05,168 INFO L87 Difference]: Start difference. First operand 18336 states and 21136 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:05,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:05,851 INFO L93 Difference]: Finished difference Result 37239 states and 42956 transitions. [2025-01-08 23:42:05,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:05,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 324 [2025-01-08 23:42:05,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:05,885 INFO L225 Difference]: With dead ends: 37239 [2025-01-08 23:42:05,885 INFO L226 Difference]: Without dead ends: 19274 [2025-01-08 23:42:05,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:42:05,901 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 132 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:05,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 376 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:05,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19274 states. [2025-01-08 23:42:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19274 to 19266. [2025-01-08 23:42:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19266 states, 19265 states have (on average 1.150012976901116) internal successors, (22155), 19265 states have internal predecessors, (22155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:06,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19266 states to 19266 states and 22155 transitions. [2025-01-08 23:42:06,047 INFO L78 Accepts]: Start accepts. Automaton has 19266 states and 22155 transitions. Word has length 324 [2025-01-08 23:42:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:06,048 INFO L471 AbstractCegarLoop]: Abstraction has 19266 states and 22155 transitions. [2025-01-08 23:42:06,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 19266 states and 22155 transitions. [2025-01-08 23:42:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-08 23:42:06,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:06,053 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:06,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:42:06,254 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-08 23:42:06,254 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:06,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:06,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1886983217, now seen corresponding path program 1 times [2025-01-08 23:42:06,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:06,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133569305] [2025-01-08 23:42:06,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:06,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:06,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-08 23:42:06,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-08 23:42:06,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:06,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-01-08 23:42:06,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:06,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133569305] [2025-01-08 23:42:06,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133569305] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:06,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:06,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:06,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945157630] [2025-01-08 23:42:06,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:06,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:06,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:06,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:06,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:06,426 INFO L87 Difference]: Start difference. First operand 19266 states and 22155 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:06,991 INFO L93 Difference]: Finished difference Result 41472 states and 47918 transitions. [2025-01-08 23:42:06,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:06,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 326 [2025-01-08 23:42:06,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:07,016 INFO L225 Difference]: With dead ends: 41472 [2025-01-08 23:42:07,017 INFO L226 Difference]: Without dead ends: 22577 [2025-01-08 23:42:07,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:07,029 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 170 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:07,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 157 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:07,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22577 states. [2025-01-08 23:42:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22577 to 17230. [2025-01-08 23:42:07,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17230 states, 17229 states have (on average 1.1475419351094085) internal successors, (19771), 17229 states have internal predecessors, (19771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17230 states to 17230 states and 19771 transitions. [2025-01-08 23:42:07,186 INFO L78 Accepts]: Start accepts. Automaton has 17230 states and 19771 transitions. Word has length 326 [2025-01-08 23:42:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:07,186 INFO L471 AbstractCegarLoop]: Abstraction has 17230 states and 19771 transitions. [2025-01-08 23:42:07,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 17230 states and 19771 transitions. [2025-01-08 23:42:07,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-01-08 23:42:07,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:07,195 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:07,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:42:07,196 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:07,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:07,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1532473915, now seen corresponding path program 1 times [2025-01-08 23:42:07,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:07,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49907902] [2025-01-08 23:42:07,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:07,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:07,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-01-08 23:42:07,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-01-08 23:42:07,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:07,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-01-08 23:42:07,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:07,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49907902] [2025-01-08 23:42:07,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49907902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:07,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:07,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:07,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104216248] [2025-01-08 23:42:07,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:07,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:07,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:07,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:07,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:07,397 INFO L87 Difference]: Start difference. First operand 17230 states and 19771 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:08,046 INFO L93 Difference]: Finished difference Result 32580 states and 37369 transitions. [2025-01-08 23:42:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:08,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 330 [2025-01-08 23:42:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:08,061 INFO L225 Difference]: With dead ends: 32580 [2025-01-08 23:42:08,061 INFO L226 Difference]: Without dead ends: 15721 [2025-01-08 23:42:08,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:08,072 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 163 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:08,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 149 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15721 states. [2025-01-08 23:42:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15721 to 13695. [2025-01-08 23:42:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13695 states, 13694 states have (on average 1.1075653570906967) internal successors, (15167), 13694 states have internal predecessors, (15167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13695 states to 13695 states and 15167 transitions. [2025-01-08 23:42:08,182 INFO L78 Accepts]: Start accepts. Automaton has 13695 states and 15167 transitions. Word has length 330 [2025-01-08 23:42:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:08,183 INFO L471 AbstractCegarLoop]: Abstraction has 13695 states and 15167 transitions. [2025-01-08 23:42:08,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 13695 states and 15167 transitions. [2025-01-08 23:42:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-01-08 23:42:08,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:08,187 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:08,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:42:08,187 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:08,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:08,188 INFO L85 PathProgramCache]: Analyzing trace with hash -328317259, now seen corresponding path program 1 times [2025-01-08 23:42:08,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:08,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936112973] [2025-01-08 23:42:08,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:08,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:08,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-01-08 23:42:08,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-01-08 23:42:08,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:08,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-08 23:42:08,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:08,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936112973] [2025-01-08 23:42:08,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936112973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:08,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:08,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:08,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372517754] [2025-01-08 23:42:08,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:08,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:08,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:08,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:08,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:08,293 INFO L87 Difference]: Start difference. First operand 13695 states and 15167 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:08,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:08,618 INFO L93 Difference]: Finished difference Result 26457 states and 29327 transitions. [2025-01-08 23:42:08,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:08,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 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 333 [2025-01-08 23:42:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:08,628 INFO L225 Difference]: With dead ends: 26457 [2025-01-08 23:42:08,628 INFO L226 Difference]: Without dead ends: 13132 [2025-01-08 23:42:08,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:08,636 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:08,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 38 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:42:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13132 states. [2025-01-08 23:42:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13132 to 13130. [2025-01-08 23:42:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13130 states, 13129 states have (on average 1.1067103358976311) internal successors, (14530), 13129 states have internal predecessors, (14530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13130 states to 13130 states and 14530 transitions. [2025-01-08 23:42:08,755 INFO L78 Accepts]: Start accepts. Automaton has 13130 states and 14530 transitions. Word has length 333 [2025-01-08 23:42:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:08,756 INFO L471 AbstractCegarLoop]: Abstraction has 13130 states and 14530 transitions. [2025-01-08 23:42:08,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 13130 states and 14530 transitions. [2025-01-08 23:42:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-08 23:42:08,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:08,760 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:08,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:42:08,760 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:08,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:08,761 INFO L85 PathProgramCache]: Analyzing trace with hash 190907404, now seen corresponding path program 1 times [2025-01-08 23:42:08,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:08,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063179547] [2025-01-08 23:42:08,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:08,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:08,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-08 23:42:08,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-08 23:42:08,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:08,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-08 23:42:08,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:08,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063179547] [2025-01-08 23:42:08,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063179547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:08,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:08,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:08,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860779674] [2025-01-08 23:42:08,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:08,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:08,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:08,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:08,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:08,904 INFO L87 Difference]: Start difference. First operand 13130 states and 14530 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:09,476 INFO L93 Difference]: Finished difference Result 28834 states and 31893 transitions. [2025-01-08 23:42:09,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:09,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 357 [2025-01-08 23:42:09,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:09,487 INFO L225 Difference]: With dead ends: 28834 [2025-01-08 23:42:09,488 INFO L226 Difference]: Without dead ends: 14228 [2025-01-08 23:42:09,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:09,495 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 145 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:09,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 320 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14228 states. [2025-01-08 23:42:09,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14228 to 12198. [2025-01-08 23:42:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12198 states, 12197 states have (on average 1.0905140608346315) internal successors, (13301), 12197 states have internal predecessors, (13301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12198 states to 12198 states and 13301 transitions. [2025-01-08 23:42:09,633 INFO L78 Accepts]: Start accepts. Automaton has 12198 states and 13301 transitions. Word has length 357 [2025-01-08 23:42:09,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:09,634 INFO L471 AbstractCegarLoop]: Abstraction has 12198 states and 13301 transitions. [2025-01-08 23:42:09,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 12198 states and 13301 transitions. [2025-01-08 23:42:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-01-08 23:42:09,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:09,640 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:09,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:42:09,640 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:09,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:09,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1184751866, now seen corresponding path program 1 times [2025-01-08 23:42:09,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:09,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300615105] [2025-01-08 23:42:09,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:09,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:09,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-01-08 23:42:09,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-01-08 23:42:09,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:09,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 146 proven. 153 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-08 23:42:09,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:09,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300615105] [2025-01-08 23:42:09,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300615105] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:42:09,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489375797] [2025-01-08 23:42:09,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:09,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:09,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:09,984 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:42:09,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:42:10,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-01-08 23:42:10,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-01-08 23:42:10,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:10,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:10,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 23:42:10,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:42:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-08 23:42:10,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:42:10,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489375797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:10,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:42:10,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:42:10,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260519443] [2025-01-08 23:42:10,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:10,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:10,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:10,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:10,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:42:10,428 INFO L87 Difference]: Start difference. First operand 12198 states and 13301 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:10,929 INFO L93 Difference]: Finished difference Result 24212 states and 26433 transitions. [2025-01-08 23:42:10,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:10,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 367 [2025-01-08 23:42:10,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:10,937 INFO L225 Difference]: With dead ends: 24212 [2025-01-08 23:42:10,937 INFO L226 Difference]: Without dead ends: 12384 [2025-01-08 23:42:10,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 366 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-08 23:42:10,943 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 110 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:10,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 347 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12384 states. [2025-01-08 23:42:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12384 to 12382. [2025-01-08 23:42:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12382 states, 12381 states have (on average 1.090057345933285) internal successors, (13496), 12381 states have internal predecessors, (13496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12382 states to 12382 states and 13496 transitions. [2025-01-08 23:42:11,020 INFO L78 Accepts]: Start accepts. Automaton has 12382 states and 13496 transitions. Word has length 367 [2025-01-08 23:42:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:11,020 INFO L471 AbstractCegarLoop]: Abstraction has 12382 states and 13496 transitions. [2025-01-08 23:42:11,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 12382 states and 13496 transitions. [2025-01-08 23:42:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-01-08 23:42:11,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:11,024 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:11,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 23:42:11,224 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,SelfDestructingSolverStorable17 [2025-01-08 23:42:11,225 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:11,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:11,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1711497000, now seen corresponding path program 1 times [2025-01-08 23:42:11,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:11,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888974447] [2025-01-08 23:42:11,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:11,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-01-08 23:42:11,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-01-08 23:42:11,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:11,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-08 23:42:11,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:11,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888974447] [2025-01-08 23:42:11,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888974447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:11,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:11,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:11,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056196032] [2025-01-08 23:42:11,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:11,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:11,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:11,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:11,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:11,470 INFO L87 Difference]: Start difference. First operand 12382 states and 13496 transitions. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:12,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:12,454 INFO L93 Difference]: Finished difference Result 32507 states and 35440 transitions. [2025-01-08 23:42:12,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:12,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 372 [2025-01-08 23:42:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:12,471 INFO L225 Difference]: With dead ends: 32507 [2025-01-08 23:42:12,471 INFO L226 Difference]: Without dead ends: 20127 [2025-01-08 23:42:12,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:12,481 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 223 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:12,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 64 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:42:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20127 states. [2025-01-08 23:42:12,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20127 to 19020. [2025-01-08 23:42:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19020 states, 19019 states have (on average 1.085914085914086) internal successors, (20653), 19019 states have internal predecessors, (20653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19020 states to 19020 states and 20653 transitions. [2025-01-08 23:42:12,623 INFO L78 Accepts]: Start accepts. Automaton has 19020 states and 20653 transitions. Word has length 372 [2025-01-08 23:42:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:12,623 INFO L471 AbstractCegarLoop]: Abstraction has 19020 states and 20653 transitions. [2025-01-08 23:42:12,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 19020 states and 20653 transitions. [2025-01-08 23:42:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-01-08 23:42:12,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:12,628 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:12,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 23:42:12,629 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:12,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:12,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2140996145, now seen corresponding path program 1 times [2025-01-08 23:42:12,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:12,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412126056] [2025-01-08 23:42:12,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:12,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:12,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-01-08 23:42:12,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-01-08 23:42:12,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:12,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 146 proven. 200 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-01-08 23:42:12,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:12,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412126056] [2025-01-08 23:42:12,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412126056] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:42:12,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300426071] [2025-01-08 23:42:12,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:12,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:12,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:12,884 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:42:12,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 23:42:12,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-01-08 23:42:12,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-01-08 23:42:12,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:12,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:12,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-08 23:42:12,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:42:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 244 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:14,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:42:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 244 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:16,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300426071] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:42:16,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:42:16,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2025-01-08 23:42:16,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879304437] [2025-01-08 23:42:16,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:42:16,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 23:42:16,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:16,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 23:42:16,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-08 23:42:16,160 INFO L87 Difference]: Start difference. First operand 19020 states and 20653 transitions. Second operand has 12 states, 12 states have (on average 76.16666666666667) internal successors, (914), 11 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:22,243 INFO L93 Difference]: Finished difference Result 58070 states and 62804 transitions. [2025-01-08 23:42:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-08 23:42:22,244 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 76.16666666666667) internal successors, (914), 11 states have internal predecessors, (914), 0 states have call successors, (0), 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 389 [2025-01-08 23:42:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:22,282 INFO L225 Difference]: With dead ends: 58070 [2025-01-08 23:42:22,282 INFO L226 Difference]: Without dead ends: 38868 [2025-01-08 23:42:22,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 770 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=464, Invalid=1176, Unknown=0, NotChecked=0, Total=1640 [2025-01-08 23:42:22,293 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 4688 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 6387 mSolverCounterSat, 1612 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 7999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1612 IncrementalHoareTripleChecker+Valid, 6387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:22,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4688 Valid, 158 Invalid, 7999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1612 Valid, 6387 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-08 23:42:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38868 states. [2025-01-08 23:42:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38868 to 34684. [2025-01-08 23:42:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34684 states, 34683 states have (on average 1.0724850791454026) internal successors, (37197), 34683 states have internal predecessors, (37197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34684 states to 34684 states and 37197 transitions. [2025-01-08 23:42:22,738 INFO L78 Accepts]: Start accepts. Automaton has 34684 states and 37197 transitions. Word has length 389 [2025-01-08 23:42:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:22,738 INFO L471 AbstractCegarLoop]: Abstraction has 34684 states and 37197 transitions. [2025-01-08 23:42:22,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 76.16666666666667) internal successors, (914), 11 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 34684 states and 37197 transitions. [2025-01-08 23:42:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-01-08 23:42:22,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:22,745 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:22,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 23:42:22,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:22,949 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:22,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:22,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1136413709, now seen corresponding path program 1 times [2025-01-08 23:42:22,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:22,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243428121] [2025-01-08 23:42:22,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:22,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-08 23:42:23,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-08 23:42:23,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:23,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-01-08 23:42:23,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:23,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243428121] [2025-01-08 23:42:23,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243428121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:23,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:23,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:23,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076755139] [2025-01-08 23:42:23,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:23,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:23,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:23,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:23,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:23,382 INFO L87 Difference]: Start difference. First operand 34684 states and 37197 transitions. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:24,381 INFO L93 Difference]: Finished difference Result 70661 states and 75853 transitions. [2025-01-08 23:42:24,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:24,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 394 [2025-01-08 23:42:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:24,413 INFO L225 Difference]: With dead ends: 70661 [2025-01-08 23:42:24,413 INFO L226 Difference]: Without dead ends: 36347 [2025-01-08 23:42:24,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:24,434 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 195 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:24,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 105 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:42:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36347 states. [2025-01-08 23:42:24,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36347 to 32646. [2025-01-08 23:42:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32646 states, 32645 states have (on average 1.071772093735641) internal successors, (34988), 32645 states have internal predecessors, (34988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32646 states to 32646 states and 34988 transitions. [2025-01-08 23:42:24,729 INFO L78 Accepts]: Start accepts. Automaton has 32646 states and 34988 transitions. Word has length 394 [2025-01-08 23:42:24,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:24,729 INFO L471 AbstractCegarLoop]: Abstraction has 32646 states and 34988 transitions. [2025-01-08 23:42:24,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 32646 states and 34988 transitions. [2025-01-08 23:42:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-01-08 23:42:24,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:24,738 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:24,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 23:42:24,738 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:24,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:24,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1751828372, now seen corresponding path program 1 times [2025-01-08 23:42:24,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:24,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691682501] [2025-01-08 23:42:24,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:24,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:24,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-01-08 23:42:24,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-01-08 23:42:24,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:24,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:25,063 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-01-08 23:42:25,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:25,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691682501] [2025-01-08 23:42:25,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691682501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:25,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:25,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:25,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897117952] [2025-01-08 23:42:25,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:25,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:25,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:25,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:25,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:25,065 INFO L87 Difference]: Start difference. First operand 32646 states and 34988 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:25,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:25,610 INFO L93 Difference]: Finished difference Result 66574 states and 71381 transitions. [2025-01-08 23:42:25,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:25,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 434 [2025-01-08 23:42:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:25,641 INFO L225 Difference]: With dead ends: 66574 [2025-01-08 23:42:25,641 INFO L226 Difference]: Without dead ends: 34298 [2025-01-08 23:42:25,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:25,659 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 154 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:25,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 308 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:42:25,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34298 states. [2025-01-08 23:42:25,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34298 to 28036. [2025-01-08 23:42:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28036 states, 28035 states have (on average 1.0673800606384876) internal successors, (29924), 28035 states have internal predecessors, (29924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28036 states to 28036 states and 29924 transitions. [2025-01-08 23:42:25,929 INFO L78 Accepts]: Start accepts. Automaton has 28036 states and 29924 transitions. Word has length 434 [2025-01-08 23:42:25,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:25,929 INFO L471 AbstractCegarLoop]: Abstraction has 28036 states and 29924 transitions. [2025-01-08 23:42:25,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:25,929 INFO L276 IsEmpty]: Start isEmpty. Operand 28036 states and 29924 transitions. [2025-01-08 23:42:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-08 23:42:25,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:25,937 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:25,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-08 23:42:25,937 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:25,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:25,938 INFO L85 PathProgramCache]: Analyzing trace with hash 389927444, now seen corresponding path program 1 times [2025-01-08 23:42:25,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:25,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514098074] [2025-01-08 23:42:25,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:25,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:26,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-08 23:42:26,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-08 23:42:26,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:26,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-01-08 23:42:26,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:26,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514098074] [2025-01-08 23:42:26,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514098074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:26,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:26,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:26,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223487885] [2025-01-08 23:42:26,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:26,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:26,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:26,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:26,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:26,223 INFO L87 Difference]: Start difference. First operand 28036 states and 29924 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:26,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:26,736 INFO L93 Difference]: Finished difference Result 54610 states and 58368 transitions. [2025-01-08 23:42:26,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:26,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 468 [2025-01-08 23:42:26,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:26,762 INFO L225 Difference]: With dead ends: 54610 [2025-01-08 23:42:26,762 INFO L226 Difference]: Without dead ends: 29520 [2025-01-08 23:42:26,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-08 23:42:26,778 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 133 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:26,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 106 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:42:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29520 states. [2025-01-08 23:42:26,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29520 to 27668. [2025-01-08 23:42:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27668 states, 27667 states have (on average 1.0667943759713738) internal successors, (29515), 27667 states have internal predecessors, (29515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27668 states to 27668 states and 29515 transitions. [2025-01-08 23:42:27,033 INFO L78 Accepts]: Start accepts. Automaton has 27668 states and 29515 transitions. Word has length 468 [2025-01-08 23:42:27,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:27,034 INFO L471 AbstractCegarLoop]: Abstraction has 27668 states and 29515 transitions. [2025-01-08 23:42:27,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 27668 states and 29515 transitions. [2025-01-08 23:42:27,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-01-08 23:42:27,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:27,041 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:27,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-08 23:42:27,041 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:27,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:27,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1279929463, now seen corresponding path program 1 times [2025-01-08 23:42:27,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:27,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64072559] [2025-01-08 23:42:27,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:27,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:27,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-01-08 23:42:27,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-01-08 23:42:27,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:27,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 365 proven. 36 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-01-08 23:42:27,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:27,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64072559] [2025-01-08 23:42:27,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64072559] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:42:27,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848358831] [2025-01-08 23:42:27,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:27,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:27,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:27,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:42:27,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 23:42:27,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-01-08 23:42:27,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-01-08 23:42:27,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:27,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:27,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 23:42:27,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:42:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-01-08 23:42:28,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:42:28,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848358831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:28,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:42:28,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:42:28,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814247695] [2025-01-08 23:42:28,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:28,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:28,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:28,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:28,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:42:28,181 INFO L87 Difference]: Start difference. First operand 27668 states and 29515 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:28,723 INFO L93 Difference]: Finished difference Result 52758 states and 56337 transitions. [2025-01-08 23:42:28,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:28,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 472 [2025-01-08 23:42:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:28,750 INFO L225 Difference]: With dead ends: 52758 [2025-01-08 23:42:28,750 INFO L226 Difference]: Without dead ends: 28036 [2025-01-08 23:42:28,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:42:28,769 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 119 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:28,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 154 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:42:28,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28036 states. [2025-01-08 23:42:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28036 to 27484. [2025-01-08 23:42:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27484 states, 27483 states have (on average 1.065531419422916) internal successors, (29284), 27483 states have internal predecessors, (29284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27484 states to 27484 states and 29284 transitions. [2025-01-08 23:42:29,149 INFO L78 Accepts]: Start accepts. Automaton has 27484 states and 29284 transitions. Word has length 472 [2025-01-08 23:42:29,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:29,149 INFO L471 AbstractCegarLoop]: Abstraction has 27484 states and 29284 transitions. [2025-01-08 23:42:29,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:29,150 INFO L276 IsEmpty]: Start isEmpty. Operand 27484 states and 29284 transitions. [2025-01-08 23:42:29,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-01-08 23:42:29,159 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:29,160 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:29,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 23:42:29,365 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,SelfDestructingSolverStorable23 [2025-01-08 23:42:29,365 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:29,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:29,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1532584252, now seen corresponding path program 1 times [2025-01-08 23:42:29,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:29,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972679623] [2025-01-08 23:42:29,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:29,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:29,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-01-08 23:42:29,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-01-08 23:42:29,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:29,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-08 23:42:30,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:30,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972679623] [2025-01-08 23:42:30,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972679623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:30,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:30,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:42:30,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864953809] [2025-01-08 23:42:30,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:30,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:42:30,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:30,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:42:30,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:42:30,196 INFO L87 Difference]: Start difference. First operand 27484 states and 29284 transitions. Second operand has 7 states, 7 states have (on average 56.285714285714285) internal successors, (394), 6 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:31,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:31,302 INFO L93 Difference]: Finished difference Result 57180 states and 60931 transitions. [2025-01-08 23:42:31,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 23:42:31,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 56.285714285714285) internal successors, (394), 6 states have internal predecessors, (394), 0 states have call successors, (0), 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 523 [2025-01-08 23:42:31,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:31,334 INFO L225 Difference]: With dead ends: 57180 [2025-01-08 23:42:31,335 INFO L226 Difference]: Without dead ends: 32458 [2025-01-08 23:42:31,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:42:31,352 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 214 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2371 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:31,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 223 Invalid, 2398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2371 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:42:31,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32458 states. [2025-01-08 23:42:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32458 to 28590. [2025-01-08 23:42:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28590 states, 28589 states have (on average 1.066109342754206) internal successors, (30479), 28589 states have internal predecessors, (30479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28590 states to 28590 states and 30479 transitions. [2025-01-08 23:42:31,674 INFO L78 Accepts]: Start accepts. Automaton has 28590 states and 30479 transitions. Word has length 523 [2025-01-08 23:42:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:31,675 INFO L471 AbstractCegarLoop]: Abstraction has 28590 states and 30479 transitions. [2025-01-08 23:42:31,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.285714285714285) internal successors, (394), 6 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 28590 states and 30479 transitions. [2025-01-08 23:42:31,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-08 23:42:31,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:31,686 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:31,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-08 23:42:31,686 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:31,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1453783875, now seen corresponding path program 1 times [2025-01-08 23:42:31,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:31,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335036744] [2025-01-08 23:42:31,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:31,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:31,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-08 23:42:31,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-08 23:42:31,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:31,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 606 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-08 23:42:32,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:32,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335036744] [2025-01-08 23:42:32,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335036744] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:42:32,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321637869] [2025-01-08 23:42:32,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:32,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:32,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:32,473 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:42:32,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 23:42:32,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-08 23:42:32,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-08 23:42:32,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:32,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:32,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 23:42:32,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:42:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 493 proven. 121 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-08 23:42:33,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:42:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 493 proven. 121 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-08 23:42:35,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321637869] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:42:35,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:42:35,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2025-01-08 23:42:35,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033635081] [2025-01-08 23:42:35,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:42:35,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 23:42:35,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:35,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 23:42:35,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-08 23:42:35,523 INFO L87 Difference]: Start difference. First operand 28590 states and 30479 transitions. Second operand has 11 states, 11 states have (on average 88.36363636363636) internal successors, (972), 10 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:38,851 INFO L93 Difference]: Finished difference Result 59025 states and 62835 transitions. [2025-01-08 23:42:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-08 23:42:38,852 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 88.36363636363636) internal successors, (972), 10 states have internal predecessors, (972), 0 states have call successors, (0), 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 533 [2025-01-08 23:42:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:38,877 INFO L225 Difference]: With dead ends: 59025 [2025-01-08 23:42:38,878 INFO L226 Difference]: Without dead ends: 27860 [2025-01-08 23:42:38,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1088 GetRequests, 1063 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2025-01-08 23:42:38,885 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1261 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 4452 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 4932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 4452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:38,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 192 Invalid, 4932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 4452 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:42:38,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27860 states. [2025-01-08 23:42:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27860 to 11820. [2025-01-08 23:42:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11820 states, 11819 states have (on average 1.0504272781115154) internal successors, (12415), 11819 states have internal predecessors, (12415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11820 states to 11820 states and 12415 transitions. [2025-01-08 23:42:39,045 INFO L78 Accepts]: Start accepts. Automaton has 11820 states and 12415 transitions. Word has length 533 [2025-01-08 23:42:39,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:39,046 INFO L471 AbstractCegarLoop]: Abstraction has 11820 states and 12415 transitions. [2025-01-08 23:42:39,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.36363636363636) internal successors, (972), 10 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 11820 states and 12415 transitions. [2025-01-08 23:42:39,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-08 23:42:39,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:39,051 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, 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, 2, 2, 2, 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] [2025-01-08 23:42:39,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 23:42:39,251 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,SelfDestructingSolverStorable25 [2025-01-08 23:42:39,251 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:39,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:39,252 INFO L85 PathProgramCache]: Analyzing trace with hash 362571013, now seen corresponding path program 1 times [2025-01-08 23:42:39,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:39,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72698157] [2025-01-08 23:42:39,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:39,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:39,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-08 23:42:39,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-08 23:42:39,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:39,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 390 proven. 206 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-01-08 23:42:39,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:39,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72698157] [2025-01-08 23:42:39,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72698157] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:42:39,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029038236] [2025-01-08 23:42:39,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:39,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:39,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:39,857 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:42:39,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 23:42:39,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-08 23:42:39,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-08 23:42:39,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:39,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:39,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 23:42:39,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:42:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 341 proven. 255 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-01-08 23:42:41,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:42:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 527 proven. 69 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-01-08 23:42:43,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029038236] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:42:43,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:42:43,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-08 23:42:43,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330798029] [2025-01-08 23:42:43,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:42:43,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 23:42:43,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:43,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 23:42:43,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-01-08 23:42:43,548 INFO L87 Difference]: Start difference. First operand 11820 states and 12415 transitions. Second operand has 10 states, 10 states have (on average 84.3) internal successors, (843), 10 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:46,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:46,132 INFO L93 Difference]: Finished difference Result 31022 states and 32637 transitions. [2025-01-08 23:42:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-08 23:42:46,132 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 84.3) internal successors, (843), 10 states have internal predecessors, (843), 0 states have call successors, (0), 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 536 [2025-01-08 23:42:46,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:46,150 INFO L225 Difference]: With dead ends: 31022 [2025-01-08 23:42:46,150 INFO L226 Difference]: Without dead ends: 17548 [2025-01-08 23:42:46,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1075 GetRequests, 1066 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-01-08 23:42:46,155 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 1043 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 3699 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 4062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 3699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:46,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 187 Invalid, 4062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 3699 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:42:46,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17548 states. [2025-01-08 23:42:46,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17548 to 16062. [2025-01-08 23:42:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16062 states, 16061 states have (on average 1.0458875537015129) internal successors, (16798), 16061 states have internal predecessors, (16798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 16798 transitions. [2025-01-08 23:42:46,352 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 16798 transitions. Word has length 536 [2025-01-08 23:42:46,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:46,352 INFO L471 AbstractCegarLoop]: Abstraction has 16062 states and 16798 transitions. [2025-01-08 23:42:46,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 84.3) internal successors, (843), 10 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 16798 transitions. [2025-01-08 23:42:46,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-01-08 23:42:46,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:46,359 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-01-08 23:42:46,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-08 23:42:46,560 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,SelfDestructingSolverStorable26 [2025-01-08 23:42:46,560 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:46,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:46,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2126722631, now seen corresponding path program 1 times [2025-01-08 23:42:46,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:46,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684967814] [2025-01-08 23:42:46,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:46,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:46,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-01-08 23:42:46,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-01-08 23:42:46,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:46,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 984 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-01-08 23:42:46,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:46,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684967814] [2025-01-08 23:42:46,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684967814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:46,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:46,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:46,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326927613] [2025-01-08 23:42:46,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:46,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:46,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:46,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:46,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:46,904 INFO L87 Difference]: Start difference. First operand 16062 states and 16798 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:47,403 INFO L93 Difference]: Finished difference Result 29904 states and 31266 transitions. [2025-01-08 23:42:47,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:47,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 670 [2025-01-08 23:42:47,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:47,414 INFO L225 Difference]: With dead ends: 29904 [2025-01-08 23:42:47,414 INFO L226 Difference]: Without dead ends: 13844 [2025-01-08 23:42:47,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:47,422 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 91 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:47,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 260 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:42:47,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13844 states. [2025-01-08 23:42:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13844 to 12184. [2025-01-08 23:42:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12184 states, 12183 states have (on average 1.0419436920298777) internal successors, (12694), 12183 states have internal predecessors, (12694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12184 states to 12184 states and 12694 transitions. [2025-01-08 23:42:47,563 INFO L78 Accepts]: Start accepts. Automaton has 12184 states and 12694 transitions. Word has length 670 [2025-01-08 23:42:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:47,563 INFO L471 AbstractCegarLoop]: Abstraction has 12184 states and 12694 transitions. [2025-01-08 23:42:47,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 12184 states and 12694 transitions. [2025-01-08 23:42:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2025-01-08 23:42:47,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:47,569 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:47,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-08 23:42:47,569 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:47,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:47,570 INFO L85 PathProgramCache]: Analyzing trace with hash 163918989, now seen corresponding path program 1 times [2025-01-08 23:42:47,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:47,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033517] [2025-01-08 23:42:47,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:47,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:47,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 672 statements into 1 equivalence classes. [2025-01-08 23:42:47,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 672 of 672 statements. [2025-01-08 23:42:47,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:47,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1668 backedges. 1216 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2025-01-08 23:42:47,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033517] [2025-01-08 23:42:47,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:47,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:47,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:47,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581738457] [2025-01-08 23:42:47,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:47,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:47,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:47,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:47,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:47,831 INFO L87 Difference]: Start difference. First operand 12184 states and 12694 transitions. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:48,236 INFO L93 Difference]: Finished difference Result 22706 states and 23659 transitions. [2025-01-08 23:42:48,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:48,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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 672 [2025-01-08 23:42:48,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:48,246 INFO L225 Difference]: With dead ends: 22706 [2025-01-08 23:42:48,246 INFO L226 Difference]: Without dead ends: 11444 [2025-01-08 23:42:48,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:48,253 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 97 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:48,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 82 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:42:48,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11444 states. [2025-01-08 23:42:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11444 to 10519. [2025-01-08 23:42:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10519 states, 10518 states have (on average 1.0378398935158775) internal successors, (10916), 10518 states have internal predecessors, (10916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10519 states to 10519 states and 10916 transitions. [2025-01-08 23:42:48,380 INFO L78 Accepts]: Start accepts. Automaton has 10519 states and 10916 transitions. Word has length 672 [2025-01-08 23:42:48,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:48,380 INFO L471 AbstractCegarLoop]: Abstraction has 10519 states and 10916 transitions. [2025-01-08 23:42:48,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 10519 states and 10916 transitions. [2025-01-08 23:42:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2025-01-08 23:42:48,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:48,385 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:48,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-08 23:42:48,385 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:48,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:48,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1268839604, now seen corresponding path program 1 times [2025-01-08 23:42:48,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:48,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064979109] [2025-01-08 23:42:48,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:48,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:48,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 701 statements into 1 equivalence classes. [2025-01-08 23:42:48,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 701 of 701 statements. [2025-01-08 23:42:48,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:48,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 1092 proven. 0 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2025-01-08 23:42:48,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:48,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064979109] [2025-01-08 23:42:48,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064979109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:48,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:48,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:48,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054369708] [2025-01-08 23:42:48,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:48,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:48,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:48,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:48,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:48,567 INFO L87 Difference]: Start difference. First operand 10519 states and 10916 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-08 23:42:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:48,997 INFO L93 Difference]: Finished difference Result 20855 states and 21648 transitions. [2025-01-08 23:42:48,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:48,998 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 701 [2025-01-08 23:42:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:49,004 INFO L225 Difference]: With dead ends: 20855 [2025-01-08 23:42:49,005 INFO L226 Difference]: Without dead ends: 10338 [2025-01-08 23:42:49,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:49,009 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 111 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:49,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 292 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:42:49,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10338 states. [2025-01-08 23:42:49,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10338 to 9231. [2025-01-08 23:42:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9231 states, 9230 states have (on average 1.034994582881907) internal successors, (9553), 9230 states have internal predecessors, (9553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9231 states to 9231 states and 9553 transitions. [2025-01-08 23:42:49,078 INFO L78 Accepts]: Start accepts. Automaton has 9231 states and 9553 transitions. Word has length 701 [2025-01-08 23:42:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:49,078 INFO L471 AbstractCegarLoop]: Abstraction has 9231 states and 9553 transitions. [2025-01-08 23:42:49,078 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-08 23:42:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 9231 states and 9553 transitions. [2025-01-08 23:42:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-01-08 23:42:49,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:49,083 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:49,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-08 23:42:49,083 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:49,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:49,083 INFO L85 PathProgramCache]: Analyzing trace with hash -572151076, now seen corresponding path program 1 times [2025-01-08 23:42:49,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:49,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514760421] [2025-01-08 23:42:49,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:49,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:49,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-01-08 23:42:49,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-01-08 23:42:49,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:49,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1390 backedges. 921 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-01-08 23:42:49,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:49,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514760421] [2025-01-08 23:42:49,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514760421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:49,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:49,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:49,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401761957] [2025-01-08 23:42:49,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:49,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:49,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:49,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:49,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:49,647 INFO L87 Difference]: Start difference. First operand 9231 states and 9553 transitions. Second operand has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:50,215 INFO L93 Difference]: Finished difference Result 15693 states and 16247 transitions. [2025-01-08 23:42:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:50,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 733 [2025-01-08 23:42:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:50,220 INFO L225 Difference]: With dead ends: 15693 [2025-01-08 23:42:50,220 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:42:50,226 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-08 23:42:50,226 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 204 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:50,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 33 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:42:50,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:42:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:42:50,228 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 733 [2025-01-08 23:42:50,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:50,228 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:42:50,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:50,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:42:50,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:42:50,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:42:50,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-08 23:42:50,246 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:50,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:42:58,500 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 893 DAG size of output: 965 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-08 23:43:03,246 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:43:03,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:43:03 BoogieIcfgContainer [2025-01-08 23:43:03,279 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:43:03,279 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:43:03,279 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:43:03,279 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:43:03,280 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:41:49" (3/4) ... [2025-01-08 23:43:03,282 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:43:03,296 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:43:03,297 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:43:03,297 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:43:03,298 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:43:03,426 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:43:03,427 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:43:03,427 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:43:03,428 INFO L158 Benchmark]: Toolchain (without parser) took 75810.04ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 120.9MB in the beginning and 1.1GB in the end (delta: -958.2MB). Peak memory consumption was 403.3MB. Max. memory is 16.1GB. [2025-01-08 23:43:03,429 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:43:03,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.16ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 77.6MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-08 23:43:03,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.88ms. Allocated memory is still 167.8MB. Free memory was 77.6MB in the beginning and 60.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:43:03,429 INFO L158 Benchmark]: Boogie Preprocessor took 144.51ms. Allocated memory is still 167.8MB. Free memory was 60.8MB in the beginning and 36.1MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 23:43:03,429 INFO L158 Benchmark]: RCFGBuilder took 1234.15ms. Allocated memory is still 167.8MB. Free memory was 36.1MB in the beginning and 98.5MB in the end (delta: -62.4MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2025-01-08 23:43:03,430 INFO L158 Benchmark]: TraceAbstraction took 73786.17ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 98.5MB in the beginning and 1.1GB in the end (delta: -997.7MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-01-08 23:43:03,430 INFO L158 Benchmark]: Witness Printer took 147.85ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:43:03,430 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.13ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.16ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 77.6MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.88ms. Allocated memory is still 167.8MB. Free memory was 77.6MB in the beginning and 60.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 144.51ms. Allocated memory is still 167.8MB. Free memory was 60.8MB in the beginning and 36.1MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1234.15ms. Allocated memory is still 167.8MB. Free memory was 36.1MB in the beginning and 98.5MB in the end (delta: -62.4MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * TraceAbstraction took 73786.17ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 98.5MB in the beginning and 1.1GB in the end (delta: -997.7MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 147.85ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 169]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.7s, OverallIterations: 31, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 32.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11647 SdHoareTripleChecker+Valid, 28.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11647 mSDsluCounter, 6086 SdHoareTripleChecker+Invalid, 23.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1144 mSDsCounter, 5135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33905 IncrementalHoareTripleChecker+Invalid, 39040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5135 mSolverCounterUnsat, 4942 mSDtfsCounter, 33905 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4226 GetRequests, 4103 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34684occurred in iteration=20, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 53382 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 14129 NumberOfCodeBlocks, 14129 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 15547 ConstructedInterpolants, 0 QuantifiedInterpolants, 65955 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3524 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 40 InterpolantComputations, 28 PerfectInterpolantSequences, 19186/20850 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: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((a23 <= 247) && (a25 == 11)) && (a4 == 1)) && (a8 == 15)) && (115953 <= a29)) || ((((a3 == 1) && (a8 == 15)) && (a25 != 9)) && (((((a25 == 13) && (a29 <= 275)) && (a23 <= 247)) && (a4 == 1)) || ((((260 <= a29) && (a23 <= 247)) && (a25 <= 10)) && (a4 == 1))))) || (((((((((0 <= (115704 + (((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)))) && ((0 < (115704 + (((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)))) || ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) >= 0) ? ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) : (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) + 5)) != 0))) && (a29 <= 140)) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((a23 <= 600000) && (a3 == 1)) && (a4 == 1)) && (0 <= ((long long) a29 + 554195))) && (a8 == 15)) && (a25 == 10))) || (((((((a25 == 11) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (246 <= a29)) && (0 <= ((long long) a23 + 42)))) || (((((((a25 == 13) && (260 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((((0 <= (115704 + (((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)))) && (((long long) a23 + 55) <= 0)) && ((0 < (115704 + (((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)))) || ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) >= 0) ? ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) : (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) + 5)) != 0))) && (a29 <= 140)) && (a4 == 0)) && (a25 == 11)) && (a3 == 1)) && (a8 == 15))) || ((a23 <= 600000) && ((((((((307 <= a23) && (a25 == 11)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29)) || (((((((260 <= a29) && (a25 == 12)) && (307 <= a23)) && (a3 == 1)) && (a29 < 278)) && (a4 == 1)) && (a8 == 15))) || (((((((a29 <= 275) && (a25 == 12)) && (307 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29))))) || ((((((a25 == 12) && (a23 <= 247)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((((((a25 != 13) && (a25 != 12)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) && (115953 <= a29))) || (((((((a23 <= 247) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29)) && (0 <= ((long long) a23 + 42)))) || ((((((a29 <= 275) && (a23 <= 247)) && (a25 == 11)) && (a4 == 1)) && (a8 == 15)) && (130 <= a29))) || (((((((a25 == 13) && (a23 <= 600000)) && (307 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29))) || (((((((a25 == 13) && (a29 <= 140)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (130 <= a29))) || (((((a25 == 13) && (a23 <= 247)) && (a4 == 1)) && (a8 == 15)) && (a29 <= 130))) || ((((((a25 <= 10) && (141 <= a29)) && (a3 == 1)) && (21782 <= a23)) && (a4 == 1)) && (a8 == 15))) || (((((((((0 <= (115704 + (((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)))) && (a25 == 13)) && (a23 <= 600000)) && ((0 < (115704 + (((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)))) || ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) >= 0) ? ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) : (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) + 5)) != 0))) && (307 <= a23)) && (a3 == 1)) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15))) || (((((((a29 <= 275) && (307 <= a23)) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29))) || (((a23 <= 600000) && (((((((a25 == 11) && (a3 == 1)) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15)) || ((((((a25 == 12) && (a3 == 1)) && (21782 <= a23)) && (a4 == 1)) && (a29 <= 232)) && (a8 == 15))) || ((((((a25 == 12) && (307 <= a23)) && (a3 == 1)) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15)))) && (141 <= a29))) || ((246 <= a29) && ((((((((a4 == 0) && (a23 <= 247)) && (10250 <= a29)) && (a3 == 1)) && (a25 <= 9)) && (a8 == 15)) || (((((a29 <= 275) && (a25 == 12)) && (a4 == 0)) && (a3 == 1)) && (a8 == 15))) || ((((((((a25 == 13) && (a29 <= 275)) && (0 <= ((long long) a23 + 599772))) && (a4 == 0)) && (a23 <= 247)) && (a3 == 1)) && (253 <= a29)) && (a8 == 15))))) || ((((a23 <= 247) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || ((((a23 <= 247) && (((a25 <= 10) && (a29 <= 130)) || ((a25 == 12) && (a29 <= 130)))) && (a4 == 1)) && (a8 == 15))) || (((((((((0 <= (115704 + (((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)))) && (((long long) a23 + 55) <= 0)) && ((0 < (115704 + (((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)))) || ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) >= 0) ? ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) : (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) + 5)) != 0))) && (a25 == 12)) && (0 <= ((long long) a23 + 599772))) && (a4 == 0)) && (((long long) a29 + 580291) <= 0)) && (a3 == 1)) && (a8 == 15))) || ((((((((0 <= (115704 + (((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)))) && (((long long) a23 + 55) <= 0)) && ((0 < (115704 + (((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)))) || ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) >= 0) ? ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) : (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) + 5)) != 0))) && (a29 <= 140)) && (a4 == 0)) && (a25 <= 10)) && (a3 == 1)) && (a8 == 15))) || (((((278 <= a29) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a29 <= 232)) && (a8 == 15))) || (((((((((long long) a23 + 55) <= 0) && (a29 <= 275)) && (a25 == 12)) && (a4 == 0)) && (141 <= a29)) && (a3 == 1)) && (a8 == 15))) || ((((((307 <= a23) && (a25 == 11)) && (278 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:43:03,451 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