./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 4c7460e797ab98c965c0146dc16cfd1742d13d580f8dc4b4e90e3d1aa36d777a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:00:26,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:00:26,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:00:26,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:00:26,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:00:26,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:00:26,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:00:26,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:00:26,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:00:26,837 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:00:26,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:00:26,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:00:26,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:00:26,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:00:26,838 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:00:26,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:00:26,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:00:26,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:00:26,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:00:26,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:00:26,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:00:26,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:00:26,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:00:26,839 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:00:26,839 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:00:26,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:00:26,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:00:26,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:00:26,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:00:26,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:00:26,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:00:26,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:00:26,843 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:00:26,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:00:26,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:00:26,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:00:26,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:00:26,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:00:26,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:00:26,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:00:26,844 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c7460e797ab98c965c0146dc16cfd1742d13d580f8dc4b4e90e3d1aa36d777a [2025-02-05 20:00:27,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:00:27,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:00:27,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:00:27,158 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:00:27,159 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:00:27,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c [2025-02-05 20:00:28,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d9331704/428f60b97b4f4e1290d4613558071227/FLAGdc3302f1f [2025-02-05 20:00:28,743 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:00:28,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c [2025-02-05 20:00:28,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d9331704/428f60b97b4f4e1290d4613558071227/FLAGdc3302f1f [2025-02-05 20:00:28,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d9331704/428f60b97b4f4e1290d4613558071227 [2025-02-05 20:00:28,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:00:28,772 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:00:28,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:00:28,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:00:28,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:00:28,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:00:28" (1/1) ... [2025-02-05 20:00:28,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36758f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:28, skipping insertion in model container [2025-02-05 20:00:28,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:00:28" (1/1) ... [2025-02-05 20:00:28,806 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:00:28,947 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/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c[1253,1266] [2025-02-05 20:00:29,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:00:29,046 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:00:29,058 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/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c[1253,1266] [2025-02-05 20:00:29,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:00:29,146 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:00:29,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:29 WrapperNode [2025-02-05 20:00:29,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:00:29,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:00:29,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:00:29,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:00:29,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:29" (1/1) ... [2025-02-05 20:00:29,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:29" (1/1) ... [2025-02-05 20:00:29,256 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 650 [2025-02-05 20:00:29,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:00:29,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:00:29,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:00:29,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:00:29,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:29" (1/1) ... [2025-02-05 20:00:29,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:29" (1/1) ... [2025-02-05 20:00:29,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:29" (1/1) ... [2025-02-05 20:00:29,333 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-02-05 20:00:29,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:29" (1/1) ... [2025-02-05 20:00:29,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:29" (1/1) ... [2025-02-05 20:00:29,373 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:29" (1/1) ... [2025-02-05 20:00:29,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:29" (1/1) ... [2025-02-05 20:00:29,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:29" (1/1) ... [2025-02-05 20:00:29,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:29" (1/1) ... [2025-02-05 20:00:29,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:00:29,416 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:00:29,416 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:00:29,416 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:00:29,417 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:29" (1/1) ... [2025-02-05 20:00:29,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:00:29,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:00:29,453 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-02-05 20:00:29,458 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-02-05 20:00:29,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:00:29,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:00:29,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:00:29,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:00:29,631 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:00:29,634 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:00:30,787 INFO L? ?]: Removed 394 outVars from TransFormulas that were not future-live. [2025-02-05 20:00:30,788 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:00:30,842 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:00:30,842 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:00:30,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:00:30 BoogieIcfgContainer [2025-02-05 20:00:30,848 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:00:30,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:00:30,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:00:30,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:00:30,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:00:28" (1/3) ... [2025-02-05 20:00:30,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6335ea70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:00:30, skipping insertion in model container [2025-02-05 20:00:30,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:29" (2/3) ... [2025-02-05 20:00:30,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6335ea70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:00:30, skipping insertion in model container [2025-02-05 20:00:30,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:00:30" (3/3) ... [2025-02-05 20:00:30,858 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_ball2004_1.c [2025-02-05 20:00:30,873 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:00:30,875 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_ball2004_1.c that has 1 procedures, 194 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:00:30,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:00:30,941 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;@5b34d27c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:00:30,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:00:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 192 states have (on average 1.4947916666666667) internal successors, (287), 193 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 20:00:30,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:30,952 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] [2025-02-05 20:00:30,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:30,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:30,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1630671599, now seen corresponding path program 1 times [2025-02-05 20:00:30,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:30,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75029482] [2025-02-05 20:00:30,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:30,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:31,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 20:00:31,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 20:00:31,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:31,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:31,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:31,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75029482] [2025-02-05 20:00:31,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75029482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:31,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:31,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:00:31,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48063787] [2025-02-05 20:00:31,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:31,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:00:31,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:31,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:00:31,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:00:31,582 INFO L87 Difference]: Start difference. First operand has 194 states, 192 states have (on average 1.4947916666666667) internal successors, (287), 193 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:31,806 INFO L93 Difference]: Finished difference Result 349 states and 519 transitions. [2025-02-05 20:00:31,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:00:31,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-02-05 20:00:31,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:31,818 INFO L225 Difference]: With dead ends: 349 [2025-02-05 20:00:31,818 INFO L226 Difference]: Without dead ends: 193 [2025-02-05 20:00:31,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:00:31,824 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:31,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 700 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:31,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-05 20:00:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-02-05 20:00:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.484375) internal successors, (285), 192 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 285 transitions. [2025-02-05 20:00:31,877 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 285 transitions. Word has length 27 [2025-02-05 20:00:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:31,877 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 285 transitions. [2025-02-05 20:00:31,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 285 transitions. [2025-02-05 20:00:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 20:00:31,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:31,879 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] [2025-02-05 20:00:31,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:00:31,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:31,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:31,881 INFO L85 PathProgramCache]: Analyzing trace with hash 993467373, now seen corresponding path program 1 times [2025-02-05 20:00:31,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:31,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710817180] [2025-02-05 20:00:31,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:31,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:31,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 20:00:31,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 20:00:31,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:31,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:32,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:32,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:32,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710817180] [2025-02-05 20:00:32,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710817180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:32,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:32,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:00:32,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442402182] [2025-02-05 20:00:32,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:32,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:00:32,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:32,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:00:32,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:00:32,051 INFO L87 Difference]: Start difference. First operand 193 states and 285 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:32,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:32,177 INFO L93 Difference]: Finished difference Result 350 states and 517 transitions. [2025-02-05 20:00:32,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:00:32,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-02-05 20:00:32,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:32,179 INFO L225 Difference]: With dead ends: 350 [2025-02-05 20:00:32,179 INFO L226 Difference]: Without dead ends: 195 [2025-02-05 20:00:32,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:00:32,180 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:32,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 697 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:00:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-05 20:00:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-02-05 20:00:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.4793814432989691) internal successors, (287), 194 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 287 transitions. [2025-02-05 20:00:32,195 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 287 transitions. Word has length 28 [2025-02-05 20:00:32,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:32,195 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 287 transitions. [2025-02-05 20:00:32,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 287 transitions. [2025-02-05 20:00:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 20:00:32,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:32,197 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] [2025-02-05 20:00:32,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:00:32,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:32,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:32,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1630740340, now seen corresponding path program 1 times [2025-02-05 20:00:32,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:32,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395676504] [2025-02-05 20:00:32,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:32,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:32,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 20:00:32,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 20:00:32,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:32,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:32,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:32,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395676504] [2025-02-05 20:00:32,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395676504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:32,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:32,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:32,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387888873] [2025-02-05 20:00:32,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:32,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:32,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:32,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:32,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:32,414 INFO L87 Difference]: Start difference. First operand 195 states and 287 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:32,641 INFO L93 Difference]: Finished difference Result 483 states and 712 transitions. [2025-02-05 20:00:32,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:32,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-02-05 20:00:32,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:32,644 INFO L225 Difference]: With dead ends: 483 [2025-02-05 20:00:32,644 INFO L226 Difference]: Without dead ends: 326 [2025-02-05 20:00:32,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:32,645 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 649 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:32,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 676 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:32,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-05 20:00:32,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 197. [2025-02-05 20:00:32,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.4744897959183674) internal successors, (289), 196 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 289 transitions. [2025-02-05 20:00:32,659 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 289 transitions. Word has length 29 [2025-02-05 20:00:32,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:32,659 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 289 transitions. [2025-02-05 20:00:32,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 289 transitions. [2025-02-05 20:00:32,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 20:00:32,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:32,666 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:00:32,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:00:32,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:32,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:32,667 INFO L85 PathProgramCache]: Analyzing trace with hash 740376056, now seen corresponding path program 1 times [2025-02-05 20:00:32,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:32,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900687226] [2025-02-05 20:00:32,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:32,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:32,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 20:00:33,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 20:00:33,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:33,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:33,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:33,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900687226] [2025-02-05 20:00:33,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900687226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:33,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:33,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:33,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669438447] [2025-02-05 20:00:33,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:33,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:33,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:33,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:33,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:33,705 INFO L87 Difference]: Start difference. First operand 197 states and 289 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:33,968 INFO L93 Difference]: Finished difference Result 475 states and 699 transitions. [2025-02-05 20:00:33,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:33,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-02-05 20:00:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:33,971 INFO L225 Difference]: With dead ends: 475 [2025-02-05 20:00:33,971 INFO L226 Difference]: Without dead ends: 318 [2025-02-05 20:00:33,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:33,974 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 597 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:33,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 669 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:33,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-05 20:00:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 244. [2025-02-05 20:00:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.4650205761316872) internal successors, (356), 243 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 356 transitions. [2025-02-05 20:00:33,994 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 356 transitions. Word has length 106 [2025-02-05 20:00:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:33,997 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 356 transitions. [2025-02-05 20:00:34,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 356 transitions. [2025-02-05 20:00:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 20:00:34,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:34,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:00:34,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:00:34,007 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:34,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:34,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1363364527, now seen corresponding path program 1 times [2025-02-05 20:00:34,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:34,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809575192] [2025-02-05 20:00:34,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:34,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:34,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 20:00:34,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 20:00:34,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:34,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:34,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:34,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809575192] [2025-02-05 20:00:34,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809575192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:34,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:34,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:34,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643310375] [2025-02-05 20:00:34,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:34,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:34,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:34,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:34,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:34,917 INFO L87 Difference]: Start difference. First operand 244 states and 356 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:35,148 INFO L93 Difference]: Finished difference Result 475 states and 697 transitions. [2025-02-05 20:00:35,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:35,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-02-05 20:00:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:35,150 INFO L225 Difference]: With dead ends: 475 [2025-02-05 20:00:35,150 INFO L226 Difference]: Without dead ends: 318 [2025-02-05 20:00:35,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:35,153 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 575 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:35,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 668 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:35,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-05 20:00:35,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 279. [2025-02-05 20:00:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.4640287769784173) internal successors, (407), 278 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 407 transitions. [2025-02-05 20:00:35,172 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 407 transitions. Word has length 108 [2025-02-05 20:00:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:35,173 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 407 transitions. [2025-02-05 20:00:35,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 407 transitions. [2025-02-05 20:00:35,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 20:00:35,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:35,175 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:00:35,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:00:35,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:35,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:35,176 INFO L85 PathProgramCache]: Analyzing trace with hash 332365766, now seen corresponding path program 1 times [2025-02-05 20:00:35,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:35,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654336235] [2025-02-05 20:00:35,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:35,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 20:00:35,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 20:00:35,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:35,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:35,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:35,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654336235] [2025-02-05 20:00:35,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654336235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:35,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:35,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:35,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671022320] [2025-02-05 20:00:35,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:35,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:35,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:35,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:35,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:35,885 INFO L87 Difference]: Start difference. First operand 279 states and 407 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:36,065 INFO L93 Difference]: Finished difference Result 533 states and 780 transitions. [2025-02-05 20:00:36,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:36,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-02-05 20:00:36,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:36,067 INFO L225 Difference]: With dead ends: 533 [2025-02-05 20:00:36,067 INFO L226 Difference]: Without dead ends: 318 [2025-02-05 20:00:36,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:36,069 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 603 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:36,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 675 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:00:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-05 20:00:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 279. [2025-02-05 20:00:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.4568345323741008) internal successors, (405), 278 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 405 transitions. [2025-02-05 20:00:36,080 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 405 transitions. Word has length 109 [2025-02-05 20:00:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:36,080 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 405 transitions. [2025-02-05 20:00:36,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 405 transitions. [2025-02-05 20:00:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 20:00:36,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:36,082 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:00:36,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:00:36,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:36,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:36,083 INFO L85 PathProgramCache]: Analyzing trace with hash 245406712, now seen corresponding path program 1 times [2025-02-05 20:00:36,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:36,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215591374] [2025-02-05 20:00:36,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:36,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:36,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 20:00:36,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 20:00:36,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:36,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:36,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:36,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215591374] [2025-02-05 20:00:36,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215591374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:36,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:36,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:36,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829275673] [2025-02-05 20:00:36,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:36,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:36,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:36,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:36,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:36,799 INFO L87 Difference]: Start difference. First operand 279 states and 405 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:37,009 INFO L93 Difference]: Finished difference Result 475 states and 694 transitions. [2025-02-05 20:00:37,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:37,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-02-05 20:00:37,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:37,011 INFO L225 Difference]: With dead ends: 475 [2025-02-05 20:00:37,011 INFO L226 Difference]: Without dead ends: 318 [2025-02-05 20:00:37,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:37,012 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 556 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:37,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 668 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-05 20:00:37,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 299. [2025-02-05 20:00:37,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.4563758389261745) internal successors, (434), 298 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 434 transitions. [2025-02-05 20:00:37,020 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 434 transitions. Word has length 111 [2025-02-05 20:00:37,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:37,021 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 434 transitions. [2025-02-05 20:00:37,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 434 transitions. [2025-02-05 20:00:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 20:00:37,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:37,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:00:37,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:00:37,023 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:37,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:37,023 INFO L85 PathProgramCache]: Analyzing trace with hash 342097398, now seen corresponding path program 1 times [2025-02-05 20:00:37,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:37,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338965815] [2025-02-05 20:00:37,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:37,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:37,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 20:00:37,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 20:00:37,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:37,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:37,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:37,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338965815] [2025-02-05 20:00:37,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338965815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:37,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:37,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:00:37,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997685552] [2025-02-05 20:00:37,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:37,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:00:37,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:37,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:00:37,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:37,808 INFO L87 Difference]: Start difference. First operand 299 states and 434 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:38,097 INFO L93 Difference]: Finished difference Result 483 states and 705 transitions. [2025-02-05 20:00:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:00:38,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-02-05 20:00:38,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:38,101 INFO L225 Difference]: With dead ends: 483 [2025-02-05 20:00:38,102 INFO L226 Difference]: Without dead ends: 326 [2025-02-05 20:00:38,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:00:38,103 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 576 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:38,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 939 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-05 20:00:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 302. [2025-02-05 20:00:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.4551495016611296) internal successors, (438), 301 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 438 transitions. [2025-02-05 20:00:38,115 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 438 transitions. Word has length 112 [2025-02-05 20:00:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:38,115 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 438 transitions. [2025-02-05 20:00:38,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 438 transitions. [2025-02-05 20:00:38,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 20:00:38,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:38,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:00:38,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:00:38,118 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:38,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:38,118 INFO L85 PathProgramCache]: Analyzing trace with hash 485311677, now seen corresponding path program 1 times [2025-02-05 20:00:38,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:38,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042166030] [2025-02-05 20:00:38,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:38,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:38,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 20:00:38,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 20:00:38,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:38,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:38,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:38,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042166030] [2025-02-05 20:00:38,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042166030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:38,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:38,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:38,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961777472] [2025-02-05 20:00:38,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:38,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:38,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:38,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:38,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:38,769 INFO L87 Difference]: Start difference. First operand 302 states and 438 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:38,979 INFO L93 Difference]: Finished difference Result 480 states and 700 transitions. [2025-02-05 20:00:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:38,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-02-05 20:00:38,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:38,981 INFO L225 Difference]: With dead ends: 480 [2025-02-05 20:00:38,981 INFO L226 Difference]: Without dead ends: 323 [2025-02-05 20:00:38,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:38,982 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 548 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:38,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 665 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-05 20:00:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2025-02-05 20:00:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.453125) internal successors, (465), 320 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 465 transitions. [2025-02-05 20:00:38,992 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 465 transitions. Word has length 113 [2025-02-05 20:00:38,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:38,993 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 465 transitions. [2025-02-05 20:00:38,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 465 transitions. [2025-02-05 20:00:38,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 20:00:38,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:38,994 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:00:38,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:00:38,994 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:38,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:38,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1243185302, now seen corresponding path program 1 times [2025-02-05 20:00:38,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:38,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617031445] [2025-02-05 20:00:38,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:38,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:39,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 20:00:39,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 20:00:39,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:39,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:39,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:39,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617031445] [2025-02-05 20:00:39,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617031445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:39,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:39,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:00:39,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280888551] [2025-02-05 20:00:39,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:39,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:00:39,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:39,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:00:39,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:39,617 INFO L87 Difference]: Start difference. First operand 321 states and 465 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:39,879 INFO L93 Difference]: Finished difference Result 485 states and 706 transitions. [2025-02-05 20:00:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:00:39,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-02-05 20:00:39,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:39,881 INFO L225 Difference]: With dead ends: 485 [2025-02-05 20:00:39,881 INFO L226 Difference]: Without dead ends: 328 [2025-02-05 20:00:39,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:00:39,882 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 557 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:39,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 940 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:39,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-05 20:00:39,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2025-02-05 20:00:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.4520123839009287) internal successors, (469), 323 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 469 transitions. [2025-02-05 20:00:39,894 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 469 transitions. Word has length 114 [2025-02-05 20:00:39,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:39,895 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 469 transitions. [2025-02-05 20:00:39,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 469 transitions. [2025-02-05 20:00:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 20:00:39,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:39,897 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:00:39,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:00:39,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:39,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:39,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1749980578, now seen corresponding path program 1 times [2025-02-05 20:00:39,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:39,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661715259] [2025-02-05 20:00:39,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:39,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:39,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 20:00:40,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 20:00:40,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:40,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:40,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661715259] [2025-02-05 20:00:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661715259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:40,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:40,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:00:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825382582] [2025-02-05 20:00:40,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:40,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:00:40,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:40,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:00:40,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:40,507 INFO L87 Difference]: Start difference. First operand 324 states and 469 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:40,801 INFO L93 Difference]: Finished difference Result 491 states and 714 transitions. [2025-02-05 20:00:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:00:40,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-02-05 20:00:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:40,803 INFO L225 Difference]: With dead ends: 491 [2025-02-05 20:00:40,803 INFO L226 Difference]: Without dead ends: 334 [2025-02-05 20:00:40,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:00:40,804 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 565 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:40,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1105 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-02-05 20:00:40,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 330. [2025-02-05 20:00:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 1.4498480243161094) internal successors, (477), 329 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 477 transitions. [2025-02-05 20:00:40,818 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 477 transitions. Word has length 115 [2025-02-05 20:00:40,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:40,818 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 477 transitions. [2025-02-05 20:00:40,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 477 transitions. [2025-02-05 20:00:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 20:00:40,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:40,820 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:00:40,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 20:00:40,820 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:40,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:40,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1422759698, now seen corresponding path program 1 times [2025-02-05 20:00:40,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:40,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795246415] [2025-02-05 20:00:40,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:40,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:40,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 20:00:41,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 20:00:41,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:41,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:41,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:41,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795246415] [2025-02-05 20:00:41,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795246415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:41,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:41,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:41,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439962527] [2025-02-05 20:00:41,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:41,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:41,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:41,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:41,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:41,312 INFO L87 Difference]: Start difference. First operand 330 states and 477 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:41,529 INFO L93 Difference]: Finished difference Result 512 states and 743 transitions. [2025-02-05 20:00:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:41,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-02-05 20:00:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:41,532 INFO L225 Difference]: With dead ends: 512 [2025-02-05 20:00:41,532 INFO L226 Difference]: Without dead ends: 328 [2025-02-05 20:00:41,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:41,533 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 553 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:41,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 669 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:41,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-05 20:00:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-02-05 20:00:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.4495412844036697) internal successors, (474), 327 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 474 transitions. [2025-02-05 20:00:41,542 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 474 transitions. Word has length 115 [2025-02-05 20:00:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:41,542 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 474 transitions. [2025-02-05 20:00:41,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 474 transitions. [2025-02-05 20:00:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 20:00:41,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:41,543 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:00:41,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:00:41,543 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:41,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:41,544 INFO L85 PathProgramCache]: Analyzing trace with hash -357240312, now seen corresponding path program 1 times [2025-02-05 20:00:41,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:41,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387562529] [2025-02-05 20:00:41,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:41,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:41,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 20:00:41,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 20:00:41,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:41,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:42,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:42,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387562529] [2025-02-05 20:00:42,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387562529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:42,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:42,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:00:42,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455931641] [2025-02-05 20:00:42,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:42,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:00:42,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:42,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:00:42,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:00:42,114 INFO L87 Difference]: Start difference. First operand 328 states and 474 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:42,328 INFO L93 Difference]: Finished difference Result 532 states and 771 transitions. [2025-02-05 20:00:42,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:42,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-02-05 20:00:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:42,330 INFO L225 Difference]: With dead ends: 532 [2025-02-05 20:00:42,330 INFO L226 Difference]: Without dead ends: 328 [2025-02-05 20:00:42,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:00:42,331 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 564 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:42,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 669 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-05 20:00:42,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-02-05 20:00:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.4464831804281346) internal successors, (473), 327 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 473 transitions. [2025-02-05 20:00:42,339 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 473 transitions. Word has length 115 [2025-02-05 20:00:42,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:42,340 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 473 transitions. [2025-02-05 20:00:42,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:42,340 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 473 transitions. [2025-02-05 20:00:42,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 20:00:42,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:42,341 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:00:42,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:00:42,341 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:42,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:42,341 INFO L85 PathProgramCache]: Analyzing trace with hash 286308950, now seen corresponding path program 1 times [2025-02-05 20:00:42,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:42,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335960350] [2025-02-05 20:00:42,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:42,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 20:00:42,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 20:00:42,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:42,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:43,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:43,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335960350] [2025-02-05 20:00:43,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335960350] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:00:43,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369132220] [2025-02-05 20:00:43,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:43,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:00:43,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:00:43,313 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-02-05 20:00:43,314 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-02-05 20:00:43,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 20:00:43,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 20:00:43,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:43,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:43,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-05 20:00:43,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:00:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:44,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:00:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:45,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369132220] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:00:45,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:00:45,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2025-02-05 20:00:45,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790915206] [2025-02-05 20:00:45,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:00:45,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 20:00:45,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:45,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 20:00:45,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2025-02-05 20:00:45,603 INFO L87 Difference]: Start difference. First operand 328 states and 473 transitions. Second operand has 28 states, 28 states have (on average 12.0) internal successors, (336), 28 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:46,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:46,822 INFO L93 Difference]: Finished difference Result 876 states and 1266 transitions. [2025-02-05 20:00:46,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:00:46,823 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 12.0) internal successors, (336), 28 states have internal predecessors, (336), 0 states have call successors, (0), 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 116 [2025-02-05 20:00:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:46,825 INFO L225 Difference]: With dead ends: 876 [2025-02-05 20:00:46,825 INFO L226 Difference]: Without dead ends: 599 [2025-02-05 20:00:46,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2025-02-05 20:00:46,829 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 2155 mSDsluCounter, 4357 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2155 SdHoareTripleChecker+Valid, 4694 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:46,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2155 Valid, 4694 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 20:00:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-02-05 20:00:46,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 470. [2025-02-05 20:00:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.4349680170575694) internal successors, (673), 469 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:46,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 673 transitions. [2025-02-05 20:00:46,841 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 673 transitions. Word has length 116 [2025-02-05 20:00:46,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:46,841 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 673 transitions. [2025-02-05 20:00:46,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 12.0) internal successors, (336), 28 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 673 transitions. [2025-02-05 20:00:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 20:00:46,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:46,845 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:00:46,856 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-02-05 20:00:47,049 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,SelfDestructingSolverStorable13 [2025-02-05 20:00:47,050 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:47,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:47,050 INFO L85 PathProgramCache]: Analyzing trace with hash 280641569, now seen corresponding path program 1 times [2025-02-05 20:00:47,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:47,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384679979] [2025-02-05 20:00:47,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:47,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:47,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 20:00:47,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 20:00:47,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:47,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:47,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:47,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384679979] [2025-02-05 20:00:47,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384679979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:47,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:47,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:47,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759186283] [2025-02-05 20:00:47,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:47,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:47,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:47,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:47,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:47,314 INFO L87 Difference]: Start difference. First operand 470 states and 673 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:47,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:47,478 INFO L93 Difference]: Finished difference Result 748 states and 1074 transitions. [2025-02-05 20:00:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:47,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-02-05 20:00:47,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:47,480 INFO L225 Difference]: With dead ends: 748 [2025-02-05 20:00:47,480 INFO L226 Difference]: Without dead ends: 469 [2025-02-05 20:00:47,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:47,481 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 615 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:47,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 677 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:00:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-05 20:00:47,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 467. [2025-02-05 20:00:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 1.4313304721030042) internal successors, (667), 466 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 667 transitions. [2025-02-05 20:00:47,494 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 667 transitions. Word has length 117 [2025-02-05 20:00:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:47,494 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 667 transitions. [2025-02-05 20:00:47,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 667 transitions. [2025-02-05 20:00:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 20:00:47,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:47,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:00:47,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:00:47,496 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:47,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash -296609956, now seen corresponding path program 1 times [2025-02-05 20:00:47,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:47,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349305797] [2025-02-05 20:00:47,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:47,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:47,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 20:00:47,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 20:00:47,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:47,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:47,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:47,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349305797] [2025-02-05 20:00:47,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349305797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:47,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:47,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:00:47,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726670823] [2025-02-05 20:00:47,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:47,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:00:47,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:47,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:00:47,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:00:47,756 INFO L87 Difference]: Start difference. First operand 467 states and 667 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:47,921 INFO L93 Difference]: Finished difference Result 624 states and 898 transitions. [2025-02-05 20:00:47,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:47,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-02-05 20:00:47,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:47,922 INFO L225 Difference]: With dead ends: 624 [2025-02-05 20:00:47,922 INFO L226 Difference]: Without dead ends: 344 [2025-02-05 20:00:47,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:00:47,923 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 597 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:47,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 673 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:00:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-02-05 20:00:47,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-02-05 20:00:47,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 1.4373177842565599) internal successors, (493), 343 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:47,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 493 transitions. [2025-02-05 20:00:47,932 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 493 transitions. Word has length 117 [2025-02-05 20:00:47,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:47,932 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 493 transitions. [2025-02-05 20:00:47,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 493 transitions. [2025-02-05 20:00:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 20:00:47,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:47,934 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:00:47,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 20:00:47,934 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:47,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:47,935 INFO L85 PathProgramCache]: Analyzing trace with hash 804809838, now seen corresponding path program 1 times [2025-02-05 20:00:47,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:47,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734688150] [2025-02-05 20:00:47,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:47,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:47,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 20:00:48,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 20:00:48,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:48,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 43 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:51,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:51,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734688150] [2025-02-05 20:00:51,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734688150] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:00:51,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249208244] [2025-02-05 20:00:51,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:51,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:00:51,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:00:51,174 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-02-05 20:00:51,176 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-02-05 20:00:51,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 20:00:51,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 20:00:51,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:51,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:51,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-05 20:00:51,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:00:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 46 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:52,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:00:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 20:00:52,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249208244] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:00:52,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:00:52,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14, 9] total 26 [2025-02-05 20:00:52,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396039286] [2025-02-05 20:00:52,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:52,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:00:52,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:52,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:00:52,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2025-02-05 20:00:52,751 INFO L87 Difference]: Start difference. First operand 344 states and 493 transitions. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:53,122 INFO L93 Difference]: Finished difference Result 752 states and 1093 transitions. [2025-02-05 20:00:53,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:00:53,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 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 193 [2025-02-05 20:00:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:53,127 INFO L225 Difference]: With dead ends: 752 [2025-02-05 20:00:53,127 INFO L226 Difference]: Without dead ends: 595 [2025-02-05 20:00:53,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 374 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2025-02-05 20:00:53,128 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 296 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:53,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1255 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:00:53,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-02-05 20:00:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 412. [2025-02-05 20:00:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.4452554744525548) internal successors, (594), 411 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 594 transitions. [2025-02-05 20:00:53,139 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 594 transitions. Word has length 193 [2025-02-05 20:00:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:53,140 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 594 transitions. [2025-02-05 20:00:53,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 594 transitions. [2025-02-05 20:00:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 20:00:53,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:53,142 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:00:53,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 20:00:53,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 20:00:53,343 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:53,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:53,343 INFO L85 PathProgramCache]: Analyzing trace with hash -835396294, now seen corresponding path program 1 times [2025-02-05 20:00:53,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:53,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117737041] [2025-02-05 20:00:53,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:53,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:53,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 20:00:53,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 20:00:53,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:53,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 20:00:55,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:55,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117737041] [2025-02-05 20:00:55,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117737041] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:00:55,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793272636] [2025-02-05 20:00:55,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:55,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:00:55,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:00:55,247 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-02-05 20:00:55,250 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-02-05 20:00:55,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 20:00:55,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 20:00:55,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:55,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:55,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 1230 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-02-05 20:00:55,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:00:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:56,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:00:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:57,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793272636] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:00:57,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:00:57,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 14] total 32 [2025-02-05 20:00:57,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890367249] [2025-02-05 20:00:57,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:00:57,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 20:00:57,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:57,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 20:00:57,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2025-02-05 20:00:57,788 INFO L87 Difference]: Start difference. First operand 412 states and 594 transitions. Second operand has 32 states, 32 states have (on average 16.09375) internal successors, (515), 32 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:00,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:00,071 INFO L93 Difference]: Finished difference Result 1310 states and 1915 transitions. [2025-02-05 20:01:00,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-05 20:01:00,072 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 16.09375) internal successors, (515), 32 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2025-02-05 20:01:00,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:00,076 INFO L225 Difference]: With dead ends: 1310 [2025-02-05 20:01:00,076 INFO L226 Difference]: Without dead ends: 1085 [2025-02-05 20:01:00,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=651, Invalid=3255, Unknown=0, NotChecked=0, Total=3906 [2025-02-05 20:01:00,078 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 3544 mSDsluCounter, 3760 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3544 SdHoareTripleChecker+Valid, 4017 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:00,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3544 Valid, 4017 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 20:01:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2025-02-05 20:01:00,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 833. [2025-02-05 20:01:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 832 states have (on average 1.4483173076923077) internal successors, (1205), 832 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1205 transitions. [2025-02-05 20:01:00,099 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1205 transitions. Word has length 194 [2025-02-05 20:01:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:00,099 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1205 transitions. [2025-02-05 20:01:00,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 16.09375) internal successors, (515), 32 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1205 transitions. [2025-02-05 20:01:00,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 20:01:00,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:00,103 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:01:00,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 20:01:00,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:00,304 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:00,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:00,304 INFO L85 PathProgramCache]: Analyzing trace with hash 503725120, now seen corresponding path program 1 times [2025-02-05 20:01:00,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:00,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484038337] [2025-02-05 20:01:00,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:00,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:00,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 20:01:00,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 20:01:00,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:00,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 44 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:03,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:03,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484038337] [2025-02-05 20:01:03,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484038337] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:03,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077133528] [2025-02-05 20:01:03,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:03,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:03,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:03,019 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-02-05 20:01:03,020 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-02-05 20:01:03,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 20:01:03,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 20:01:03,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:03,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:03,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 1230 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-05 20:01:03,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 20:01:03,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:01:03,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077133528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:03,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:01:03,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2025-02-05 20:01:03,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928544707] [2025-02-05 20:01:03,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:03,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:01:03,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:03,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:01:03,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:01:03,699 INFO L87 Difference]: Start difference. First operand 833 states and 1205 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:03,952 INFO L93 Difference]: Finished difference Result 1600 states and 2338 transitions. [2025-02-05 20:01:03,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:01:03,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2025-02-05 20:01:03,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:03,957 INFO L225 Difference]: With dead ends: 1600 [2025-02-05 20:01:03,957 INFO L226 Difference]: Without dead ends: 1049 [2025-02-05 20:01:03,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:01:03,959 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 179 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:03,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1516 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:01:03,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-02-05 20:01:03,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 937. [2025-02-05 20:01:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 936 states have (on average 1.4497863247863247) internal successors, (1357), 936 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1357 transitions. [2025-02-05 20:01:03,979 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1357 transitions. Word has length 194 [2025-02-05 20:01:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:03,980 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1357 transitions. [2025-02-05 20:01:03,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1357 transitions. [2025-02-05 20:01:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 20:01:03,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:03,984 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:01:03,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 20:01:04,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:04,185 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:04,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:04,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1909080998, now seen corresponding path program 1 times [2025-02-05 20:01:04,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:04,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196622573] [2025-02-05 20:01:04,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:04,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:04,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 20:01:04,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 20:01:04,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:04,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 69 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:05,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:05,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196622573] [2025-02-05 20:01:05,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196622573] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:05,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918252563] [2025-02-05 20:01:05,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:05,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:05,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:05,513 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-02-05 20:01:05,515 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-02-05 20:01:05,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 20:01:06,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 20:01:06,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:06,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:06,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 1230 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-05 20:01:06,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 53 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:06,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 20:01:07,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918252563] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:07,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:01:07,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 11] total 24 [2025-02-05 20:01:07,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223916423] [2025-02-05 20:01:07,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:07,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:01:07,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:07,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:01:07,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2025-02-05 20:01:07,138 INFO L87 Difference]: Start difference. First operand 937 states and 1357 transitions. Second operand has 8 states, 8 states have (on average 22.5) internal successors, (180), 8 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-02-05 20:01:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:07,639 INFO L93 Difference]: Finished difference Result 2839 states and 4162 transitions. [2025-02-05 20:01:07,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:01:07,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.5) internal successors, (180), 8 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 194 [2025-02-05 20:01:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:07,644 INFO L225 Difference]: With dead ends: 2839 [2025-02-05 20:01:07,644 INFO L226 Difference]: Without dead ends: 1615 [2025-02-05 20:01:07,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2025-02-05 20:01:07,647 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 997 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:07,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 1500 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:01:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2025-02-05 20:01:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1046. [2025-02-05 20:01:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1045 states have (on average 1.4526315789473685) internal successors, (1518), 1045 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1518 transitions. [2025-02-05 20:01:07,676 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1518 transitions. Word has length 194 [2025-02-05 20:01:07,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:07,676 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1518 transitions. [2025-02-05 20:01:07,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.5) internal successors, (180), 8 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-02-05 20:01:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1518 transitions. [2025-02-05 20:01:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 20:01:07,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:07,680 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:01:07,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 20:01:07,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:07,881 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:07,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash 977640335, now seen corresponding path program 1 times [2025-02-05 20:01:07,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:07,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496839101] [2025-02-05 20:01:07,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:07,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:07,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 20:01:07,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 20:01:07,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:07,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 20:01:08,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:08,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496839101] [2025-02-05 20:01:08,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496839101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:08,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:08,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:01:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74719583] [2025-02-05 20:01:08,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:08,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:01:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:08,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:01:08,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:01:08,221 INFO L87 Difference]: Start difference. First operand 1046 states and 1518 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:08,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:08,362 INFO L93 Difference]: Finished difference Result 1375 states and 2002 transitions. [2025-02-05 20:01:08,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:01:08,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-02-05 20:01:08,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:08,365 INFO L225 Difference]: With dead ends: 1375 [2025-02-05 20:01:08,365 INFO L226 Difference]: Without dead ends: 913 [2025-02-05 20:01:08,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:08,368 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 573 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:08,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 676 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:01:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-02-05 20:01:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 913. [2025-02-05 20:01:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 1.4583333333333333) internal successors, (1330), 912 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1330 transitions. [2025-02-05 20:01:08,382 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1330 transitions. Word has length 195 [2025-02-05 20:01:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:08,382 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1330 transitions. [2025-02-05 20:01:08,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1330 transitions. [2025-02-05 20:01:08,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 20:01:08,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:08,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:01:08,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 20:01:08,385 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:08,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:08,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1140280411, now seen corresponding path program 1 times [2025-02-05 20:01:08,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:08,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386605209] [2025-02-05 20:01:08,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:08,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:08,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 20:01:08,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 20:01:08,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:08,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:09,707 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:09,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:09,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386605209] [2025-02-05 20:01:09,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386605209] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:09,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607942585] [2025-02-05 20:01:09,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:09,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:09,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:09,711 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-02-05 20:01:09,713 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-02-05 20:01:10,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 20:01:10,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 20:01:10,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:10,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:10,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-05 20:01:10,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:10,655 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:10,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 20:01:10,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607942585] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:10,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:01:10,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 11] total 21 [2025-02-05 20:01:10,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924705569] [2025-02-05 20:01:10,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:10,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:01:10,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:10,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:01:10,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:01:10,840 INFO L87 Difference]: Start difference. First operand 913 states and 1330 transitions. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:11,076 INFO L93 Difference]: Finished difference Result 2644 states and 3882 transitions. [2025-02-05 20:01:11,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:01:11,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-02-05 20:01:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:11,080 INFO L225 Difference]: With dead ends: 2644 [2025-02-05 20:01:11,080 INFO L226 Difference]: Without dead ends: 1202 [2025-02-05 20:01:11,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:01:11,085 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 583 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:11,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 983 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:01:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2025-02-05 20:01:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 904. [2025-02-05 20:01:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 1.4540420819490587) internal successors, (1313), 903 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1313 transitions. [2025-02-05 20:01:11,104 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1313 transitions. Word has length 195 [2025-02-05 20:01:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:11,104 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1313 transitions. [2025-02-05 20:01:11,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1313 transitions. [2025-02-05 20:01:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 20:01:11,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:11,107 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:01:11,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 20:01:11,307 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,SelfDestructingSolverStorable21 [2025-02-05 20:01:11,307 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:11,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:11,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1157283353, now seen corresponding path program 1 times [2025-02-05 20:01:11,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:11,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017060318] [2025-02-05 20:01:11,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:11,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:11,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 20:01:11,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 20:01:11,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:11,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 31 proven. 53 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 20:01:12,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:12,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017060318] [2025-02-05 20:01:12,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017060318] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:12,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424013449] [2025-02-05 20:01:12,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:12,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:12,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:12,684 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:01:12,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 20:01:13,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 20:01:13,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 20:01:13,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:13,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:13,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-02-05 20:01:13,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 31 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:14,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 20:01:14,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424013449] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:14,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:01:14,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 15] total 34 [2025-02-05 20:01:14,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697492204] [2025-02-05 20:01:14,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:14,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:01:14,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:14,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:01:14,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 20:01:14,616 INFO L87 Difference]: Start difference. First operand 904 states and 1313 transitions. Second operand has 12 states, 12 states have (on average 15.083333333333334) internal successors, (181), 12 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:15,466 INFO L93 Difference]: Finished difference Result 2696 states and 3946 transitions. [2025-02-05 20:01:15,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 20:01:15,467 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.083333333333334) internal successors, (181), 12 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-02-05 20:01:15,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:15,470 INFO L225 Difference]: With dead ends: 2696 [2025-02-05 20:01:15,470 INFO L226 Difference]: Without dead ends: 1272 [2025-02-05 20:01:15,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=1432, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 20:01:15,472 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 1706 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:15,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 2357 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:01:15,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2025-02-05 20:01:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1086. [2025-02-05 20:01:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 1.4589861751152073) internal successors, (1583), 1085 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1583 transitions. [2025-02-05 20:01:15,491 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1583 transitions. Word has length 195 [2025-02-05 20:01:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:15,492 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1583 transitions. [2025-02-05 20:01:15,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.083333333333334) internal successors, (181), 12 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1583 transitions. [2025-02-05 20:01:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 20:01:15,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:15,495 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:01:15,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 20:01:15,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:15,696 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:15,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:15,696 INFO L85 PathProgramCache]: Analyzing trace with hash -818586986, now seen corresponding path program 1 times [2025-02-05 20:01:15,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:15,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506506842] [2025-02-05 20:01:15,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:15,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:15,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 20:01:16,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 20:01:16,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:16,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 69 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 20:01:17,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:17,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506506842] [2025-02-05 20:01:17,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506506842] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:17,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155071105] [2025-02-05 20:01:17,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:17,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:17,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:17,185 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:01:17,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 20:01:17,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 20:01:17,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 20:01:17,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:17,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:17,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-02-05 20:01:17,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 53 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:18,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 33 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:19,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155071105] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:01:19,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:01:19,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 32 [2025-02-05 20:01:19,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758402443] [2025-02-05 20:01:19,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:01:19,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 20:01:19,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:19,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 20:01:19,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2025-02-05 20:01:19,518 INFO L87 Difference]: Start difference. First operand 1086 states and 1583 transitions. Second operand has 32 states, 32 states have (on average 16.15625) internal successors, (517), 32 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:23,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:23,065 INFO L93 Difference]: Finished difference Result 6412 states and 9354 transitions. [2025-02-05 20:01:23,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-02-05 20:01:23,065 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 16.15625) internal successors, (517), 32 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-02-05 20:01:23,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:23,076 INFO L225 Difference]: With dead ends: 6412 [2025-02-05 20:01:23,076 INFO L226 Difference]: Without dead ends: 5104 [2025-02-05 20:01:23,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3848 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2291, Invalid=10365, Unknown=0, NotChecked=0, Total=12656 [2025-02-05 20:01:23,081 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 10515 mSDsluCounter, 5775 mSDsCounter, 0 mSdLazyCounter, 2862 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10515 SdHoareTripleChecker+Valid, 6033 SdHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:23,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10515 Valid, 6033 Invalid, 2888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2862 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 20:01:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5104 states. [2025-02-05 20:01:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5104 to 2002. [2025-02-05 20:01:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 2001 states have (on average 1.4437781109445278) internal successors, (2889), 2001 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2889 transitions. [2025-02-05 20:01:23,129 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2889 transitions. Word has length 195 [2025-02-05 20:01:23,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:23,130 INFO L471 AbstractCegarLoop]: Abstraction has 2002 states and 2889 transitions. [2025-02-05 20:01:23,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 16.15625) internal successors, (517), 32 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2889 transitions. [2025-02-05 20:01:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 20:01:23,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:23,134 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:01:23,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 20:01:23,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:23,335 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:23,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:23,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1615396201, now seen corresponding path program 1 times [2025-02-05 20:01:23,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:23,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299164178] [2025-02-05 20:01:23,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:23,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:23,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:01:23,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:01:23,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:23,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 20:01:24,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:24,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299164178] [2025-02-05 20:01:24,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299164178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:24,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:24,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:01:24,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078009542] [2025-02-05 20:01:24,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:24,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:01:24,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:24,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:01:24,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:24,372 INFO L87 Difference]: Start difference. First operand 2002 states and 2889 transitions. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:24,573 INFO L93 Difference]: Finished difference Result 3749 states and 5452 transitions. [2025-02-05 20:01:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:01:24,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 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 196 [2025-02-05 20:01:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:24,579 INFO L225 Difference]: With dead ends: 3749 [2025-02-05 20:01:24,579 INFO L226 Difference]: Without dead ends: 2392 [2025-02-05 20:01:24,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:01:24,581 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 127 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:24,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1237 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:01:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2025-02-05 20:01:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2053. [2025-02-05 20:01:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.4454191033138402) internal successors, (2966), 2052 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2966 transitions. [2025-02-05 20:01:24,635 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2966 transitions. Word has length 196 [2025-02-05 20:01:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:24,636 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 2966 transitions. [2025-02-05 20:01:24,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:24,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2966 transitions. [2025-02-05 20:01:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 20:01:24,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:24,640 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:01:24,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 20:01:24,641 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:24,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:24,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1249148652, now seen corresponding path program 1 times [2025-02-05 20:01:24,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:24,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371160001] [2025-02-05 20:01:24,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:24,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:24,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:01:24,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:01:24,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:24,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:26,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:26,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371160001] [2025-02-05 20:01:26,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371160001] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:26,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587632634] [2025-02-05 20:01:26,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:26,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:26,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:26,417 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:01:26,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 20:01:26,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:01:26,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:01:26,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:26,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:26,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-05 20:01:26,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 20:01:27,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:01:27,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587632634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:27,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:01:27,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2025-02-05 20:01:27,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205671585] [2025-02-05 20:01:27,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:27,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:01:27,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:27,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:01:27,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:01:27,175 INFO L87 Difference]: Start difference. First operand 2053 states and 2966 transitions. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:27,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:27,396 INFO L93 Difference]: Finished difference Result 3702 states and 5383 transitions. [2025-02-05 20:01:27,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:01:27,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 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 196 [2025-02-05 20:01:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:27,402 INFO L225 Difference]: With dead ends: 3702 [2025-02-05 20:01:27,402 INFO L226 Difference]: Without dead ends: 2280 [2025-02-05 20:01:27,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:01:27,404 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 116 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:27,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1310 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:01:27,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2025-02-05 20:01:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 2240. [2025-02-05 20:01:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2240 states, 2239 states have (on average 1.4461813309513176) internal successors, (3238), 2239 states have internal predecessors, (3238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 3238 transitions. [2025-02-05 20:01:27,430 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 3238 transitions. Word has length 196 [2025-02-05 20:01:27,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:27,430 INFO L471 AbstractCegarLoop]: Abstraction has 2240 states and 3238 transitions. [2025-02-05 20:01:27,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:27,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 3238 transitions. [2025-02-05 20:01:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 20:01:27,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:27,435 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:01:27,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 20:01:27,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:27,635 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:27,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1339081759, now seen corresponding path program 1 times [2025-02-05 20:01:27,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:27,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659675541] [2025-02-05 20:01:27,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:27,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:27,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:01:27,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:01:27,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:27,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:28,490 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 62 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:28,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:28,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659675541] [2025-02-05 20:01:28,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659675541] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:28,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12776481] [2025-02-05 20:01:28,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:28,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:28,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:28,493 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:01:28,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 20:01:28,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:01:29,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:01:29,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:29,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:29,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-02-05 20:01:29,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:29,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 20:01:30,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12776481] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:30,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:01:30,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8, 22] total 41 [2025-02-05 20:01:30,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053830563] [2025-02-05 20:01:30,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:30,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 20:01:30,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:30,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 20:01:30,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1362, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 20:01:30,503 INFO L87 Difference]: Start difference. First operand 2240 states and 3238 transitions. Second operand has 15 states, 15 states have (on average 12.6) internal successors, (189), 15 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:31,613 INFO L93 Difference]: Finished difference Result 7148 states and 10422 transitions. [2025-02-05 20:01:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 20:01:31,614 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 12.6) internal successors, (189), 15 states have internal predecessors, (189), 0 states have call successors, (0), 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 196 [2025-02-05 20:01:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:31,624 INFO L225 Difference]: With dead ends: 7148 [2025-02-05 20:01:31,624 INFO L226 Difference]: Without dead ends: 3945 [2025-02-05 20:01:31,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=444, Invalid=2006, Unknown=0, NotChecked=0, Total=2450 [2025-02-05 20:01:31,628 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 2529 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2529 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:31,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2529 Valid, 2070 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:01:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2025-02-05 20:01:31,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 2515. [2025-02-05 20:01:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2515 states, 2514 states have (on average 1.449085123309467) internal successors, (3643), 2514 states have internal predecessors, (3643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:31,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 3643 transitions. [2025-02-05 20:01:31,676 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 3643 transitions. Word has length 196 [2025-02-05 20:01:31,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:31,676 INFO L471 AbstractCegarLoop]: Abstraction has 2515 states and 3643 transitions. [2025-02-05 20:01:31,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.6) internal successors, (189), 15 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:31,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 3643 transitions. [2025-02-05 20:01:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 20:01:31,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:31,681 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:01:31,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 20:01:31,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-05 20:01:31,882 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:31,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1572316358, now seen corresponding path program 1 times [2025-02-05 20:01:31,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:31,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760070529] [2025-02-05 20:01:31,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:31,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:01:32,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:01:32,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:32,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 53 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:33,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:33,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760070529] [2025-02-05 20:01:33,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760070529] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:33,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99123563] [2025-02-05 20:01:33,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:33,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:33,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:33,350 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:01:33,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 20:01:33,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:01:33,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:01:33,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:33,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:33,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-02-05 20:01:33,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 43 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:34,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 37 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:36,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99123563] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:01:36,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:01:36,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 16] total 35 [2025-02-05 20:01:36,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124390340] [2025-02-05 20:01:36,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:01:36,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 20:01:36,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:36,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 20:01:36,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 20:01:36,949 INFO L87 Difference]: Start difference. First operand 2515 states and 3643 transitions. Second operand has 35 states, 35 states have (on average 15.514285714285714) internal successors, (543), 35 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)