./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p04.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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.vcegar_QF_BV_itc99_b13_p04.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 7fcc6d521e585376faa967e3fb44ecb88c57fe5091f07017ec46bf0d857d1eb6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:08:37,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:08:37,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:08:37,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:08:37,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:08:37,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:08:37,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:08:37,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:08:37,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:08:37,421 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:08:37,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:08:37,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:08:37,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:08:37,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:08:37,421 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:08:37,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:08:37,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:08:37,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:08:37,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:08:37,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:08:37,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:08:37,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:08:37,422 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:08:37,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:08:37,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:08:37,422 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 -> 7fcc6d521e585376faa967e3fb44ecb88c57fe5091f07017ec46bf0d857d1eb6 [2025-02-08 00:08:37,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:08:37,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:08:37,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:08:37,795 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:08:37,795 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:08:37,797 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.vcegar_QF_BV_itc99_b13_p04.c [2025-02-08 00:08:39,193 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/280cb9536/3aef2e3334e84bd0b58f11866d288e95/FLAGf95cb8c48 [2025-02-08 00:08:39,444 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:08:39,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p04.c [2025-02-08 00:08:39,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/280cb9536/3aef2e3334e84bd0b58f11866d288e95/FLAGf95cb8c48 [2025-02-08 00:08:39,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/280cb9536/3aef2e3334e84bd0b58f11866d288e95 [2025-02-08 00:08:39,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:08:39,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:08:39,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:08:39,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:08:39,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:08:39,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:08:39" (1/1) ... [2025-02-08 00:08:39,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b2d2df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:39, skipping insertion in model container [2025-02-08 00:08:39,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:08:39" (1/1) ... [2025-02-08 00:08:39,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:08:39,604 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.vcegar_QF_BV_itc99_b13_p04.c[1266,1279] [2025-02-08 00:08:39,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:08:39,667 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:08:39,674 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.vcegar_QF_BV_itc99_b13_p04.c[1266,1279] [2025-02-08 00:08:39,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:08:39,724 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:08:39,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:39 WrapperNode [2025-02-08 00:08:39,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:08:39,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:08:39,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:08:39,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:08:39,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:39" (1/1) ... [2025-02-08 00:08:39,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:39" (1/1) ... [2025-02-08 00:08:39,772 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 340 [2025-02-08 00:08:39,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:08:39,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:08:39,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:08:39,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:08:39,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:39" (1/1) ... [2025-02-08 00:08:39,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:39" (1/1) ... [2025-02-08 00:08:39,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:39" (1/1) ... [2025-02-08 00:08:39,795 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-08 00:08:39,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:39" (1/1) ... [2025-02-08 00:08:39,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:39" (1/1) ... [2025-02-08 00:08:39,803 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:39" (1/1) ... [2025-02-08 00:08:39,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:39" (1/1) ... [2025-02-08 00:08:39,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:39" (1/1) ... [2025-02-08 00:08:39,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:39" (1/1) ... [2025-02-08 00:08:39,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:08:39,811 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:08:39,811 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:08:39,812 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:08:39,812 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:39" (1/1) ... [2025-02-08 00:08:39,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:08:39,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:08:39,839 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-08 00:08:39,844 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-08 00:08:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:08:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:08:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:08:39,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:08:39,940 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:08:39,942 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:08:40,267 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2025-02-08 00:08:40,267 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:08:40,291 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:08:40,292 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:08:40,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:08:40 BoogieIcfgContainer [2025-02-08 00:08:40,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:08:40,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:08:40,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:08:40,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:08:40,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:08:39" (1/3) ... [2025-02-08 00:08:40,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d625da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:08:40, skipping insertion in model container [2025-02-08 00:08:40,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:39" (2/3) ... [2025-02-08 00:08:40,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d625da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:08:40, skipping insertion in model container [2025-02-08 00:08:40,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:08:40" (3/3) ... [2025-02-08 00:08:40,299 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p04.c [2025-02-08 00:08:40,308 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:08:40,310 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p04.c that has 1 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:08:40,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:08:40,367 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;@5b39cdce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:08:40,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:08:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 58 states have (on average 1.5) internal successors, (87), 59 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-08 00:08:40,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 00:08:40,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:40,378 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] [2025-02-08 00:08:40,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:40,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:40,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1263981404, now seen corresponding path program 1 times [2025-02-08 00:08:40,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:40,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559902406] [2025-02-08 00:08:40,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:40,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:40,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 00:08:40,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 00:08:40,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:40,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:40,833 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-08 00:08:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:40,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559902406] [2025-02-08 00:08:40,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559902406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:08:40,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:08:40,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:08:40,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423599448] [2025-02-08 00:08:40,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:08:40,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:08:40,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:40,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:08:40,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:08:40,865 INFO L87 Difference]: Start difference. First operand has 60 states, 58 states have (on average 1.5) internal successors, (87), 59 states have internal predecessors, (87), 0 states have call successors, (0), 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.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-08 00:08:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:40,934 INFO L93 Difference]: Finished difference Result 99 states and 145 transitions. [2025-02-08 00:08:40,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:08:40,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-08 00:08:40,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:40,940 INFO L225 Difference]: With dead ends: 99 [2025-02-08 00:08:40,940 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 00:08:40,942 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-08 00:08:40,944 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:40,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:08:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 00:08:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-08 00:08:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 59 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-08 00:08:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 86 transitions. [2025-02-08 00:08:40,970 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 86 transitions. Word has length 24 [2025-02-08 00:08:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:40,970 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 86 transitions. [2025-02-08 00:08:40,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-08 00:08:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 86 transitions. [2025-02-08 00:08:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 00:08:40,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:40,971 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] [2025-02-08 00:08:40,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:08:40,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:40,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:40,973 INFO L85 PathProgramCache]: Analyzing trace with hash 533397024, now seen corresponding path program 1 times [2025-02-08 00:08:40,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:40,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682201369] [2025-02-08 00:08:40,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:40,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:40,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 00:08:41,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 00:08:41,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:41,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:41,165 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-08 00:08:41,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:41,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682201369] [2025-02-08 00:08:41,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682201369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:08:41,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:08:41,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:08:41,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694514000] [2025-02-08 00:08:41,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:08:41,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:08:41,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:41,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:08:41,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:08:41,168 INFO L87 Difference]: Start difference. First operand 60 states and 86 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-08 00:08:41,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:41,217 INFO L93 Difference]: Finished difference Result 101 states and 144 transitions. [2025-02-08 00:08:41,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:08:41,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-02-08 00:08:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:41,218 INFO L225 Difference]: With dead ends: 101 [2025-02-08 00:08:41,218 INFO L226 Difference]: Without dead ends: 62 [2025-02-08 00:08:41,219 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-08 00:08:41,219 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:41,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:08:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-08 00:08:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-08 00:08:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 61 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-08 00:08:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2025-02-08 00:08:41,225 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 25 [2025-02-08 00:08:41,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:41,225 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2025-02-08 00:08:41,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-08 00:08:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2025-02-08 00:08:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 00:08:41,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:41,226 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] [2025-02-08 00:08:41,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:08:41,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:41,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:41,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1286947799, now seen corresponding path program 1 times [2025-02-08 00:08:41,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:41,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953790086] [2025-02-08 00:08:41,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:41,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:41,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 00:08:41,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 00:08:41,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:41,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:41,524 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-08 00:08:41,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:41,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953790086] [2025-02-08 00:08:41,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953790086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:08:41,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:08:41,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:08:41,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074811819] [2025-02-08 00:08:41,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:08:41,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:08:41,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:41,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:08:41,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:08:41,527 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-08 00:08:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:41,573 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2025-02-08 00:08:41,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:08:41,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-02-08 00:08:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:41,574 INFO L225 Difference]: With dead ends: 103 [2025-02-08 00:08:41,574 INFO L226 Difference]: Without dead ends: 62 [2025-02-08 00:08:41,576 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-08 00:08:41,577 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 6 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:41,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 189 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:08:41,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-08 00:08:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-08 00:08:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 61 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-08 00:08:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2025-02-08 00:08:41,586 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 26 [2025-02-08 00:08:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:41,586 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2025-02-08 00:08:41,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-08 00:08:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2025-02-08 00:08:41,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 00:08:41,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:41,590 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-08 00:08:41,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:08:41,590 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:41,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:41,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1165928667, now seen corresponding path program 1 times [2025-02-08 00:08:41,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:41,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033361436] [2025-02-08 00:08:41,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:41,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:41,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 00:08:41,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 00:08:41,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:41,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:42,043 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-08 00:08:42,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:42,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033361436] [2025-02-08 00:08:42,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033361436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:08:42,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:08:42,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:08:42,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816451676] [2025-02-08 00:08:42,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:08:42,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:08:42,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:42,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:08:42,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:08:42,046 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 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-08 00:08:42,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:42,232 INFO L93 Difference]: Finished difference Result 113 states and 157 transitions. [2025-02-08 00:08:42,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:08:42,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 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-08 00:08:42,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:42,234 INFO L225 Difference]: With dead ends: 113 [2025-02-08 00:08:42,235 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 00:08:42,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:08:42,236 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 88 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:42,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 371 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:08:42,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 00:08:42,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2025-02-08 00:08:42,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-08 00:08:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2025-02-08 00:08:42,248 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 27 [2025-02-08 00:08:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:42,249 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2025-02-08 00:08:42,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 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-08 00:08:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2025-02-08 00:08:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 00:08:42,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:42,250 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-08 00:08:42,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:08:42,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:42,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:42,250 INFO L85 PathProgramCache]: Analyzing trace with hash 497339225, now seen corresponding path program 1 times [2025-02-08 00:08:42,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:42,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508383434] [2025-02-08 00:08:42,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:42,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:42,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 00:08:42,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 00:08:42,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:42,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:42,617 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-08 00:08:42,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:42,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508383434] [2025-02-08 00:08:42,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508383434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:08:42,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:08:42,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:08:42,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310901466] [2025-02-08 00:08:42,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:08:42,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:08:42,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:42,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:08:42,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:08:42,618 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 5 states, 5 states have (on average 5.6) 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-08 00:08:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:42,675 INFO L93 Difference]: Finished difference Result 127 states and 175 transitions. [2025-02-08 00:08:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:08:42,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) 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-08 00:08:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:42,677 INFO L225 Difference]: With dead ends: 127 [2025-02-08 00:08:42,678 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 00:08:42,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:08:42,679 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 71 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:42,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 192 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:08:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 00:08:42,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-08 00:08:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-08 00:08:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2025-02-08 00:08:42,687 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 28 [2025-02-08 00:08:42,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:42,687 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2025-02-08 00:08:42,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) 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-08 00:08:42,687 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2025-02-08 00:08:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 00:08:42,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:42,688 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-08 00:08:42,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:08:42,688 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:42,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:42,688 INFO L85 PathProgramCache]: Analyzing trace with hash -833975731, now seen corresponding path program 1 times [2025-02-08 00:08:42,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:42,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096766222] [2025-02-08 00:08:42,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:42,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:42,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 00:08:42,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 00:08:42,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:42,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:42,819 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-08 00:08:42,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:42,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096766222] [2025-02-08 00:08:42,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096766222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:08:42,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:08:42,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:08:42,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812793326] [2025-02-08 00:08:42,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:08:42,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:08:42,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:42,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:08:42,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:08:42,823 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 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-08 00:08:42,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:42,888 INFO L93 Difference]: Finished difference Result 165 states and 219 transitions. [2025-02-08 00:08:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:08:42,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 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-08 00:08:42,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:42,890 INFO L225 Difference]: With dead ends: 165 [2025-02-08 00:08:42,890 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 00:08:42,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:08:42,891 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 132 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:42,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 189 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:08:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 00:08:42,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2025-02-08 00:08:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 78 states have internal predecessors, (107), 0 states have call successors, (0), 0 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-08 00:08:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 107 transitions. [2025-02-08 00:08:42,898 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 107 transitions. Word has length 28 [2025-02-08 00:08:42,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:42,898 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 107 transitions. [2025-02-08 00:08:42,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 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-08 00:08:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2025-02-08 00:08:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 00:08:42,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:42,899 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-08 00:08:42,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:08:42,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:42,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1265677620, now seen corresponding path program 1 times [2025-02-08 00:08:42,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:42,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954746797] [2025-02-08 00:08:42,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:42,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:42,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 00:08:42,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 00:08:42,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:42,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:43,033 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-08 00:08:43,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:43,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954746797] [2025-02-08 00:08:43,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954746797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:08:43,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:08:43,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:08:43,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592595915] [2025-02-08 00:08:43,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:08:43,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:08:43,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:43,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:08:43,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:08:43,035 INFO L87 Difference]: Start difference. First operand 79 states and 107 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) 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-08 00:08:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:43,094 INFO L93 Difference]: Finished difference Result 147 states and 194 transitions. [2025-02-08 00:08:43,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:08:43,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) 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-08 00:08:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:43,094 INFO L225 Difference]: With dead ends: 147 [2025-02-08 00:08:43,095 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 00:08:43,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:08:43,096 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 98 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:43,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 189 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:08:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 00:08:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2025-02-08 00:08:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.3625) internal successors, (109), 80 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-08 00:08:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2025-02-08 00:08:43,102 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 29 [2025-02-08 00:08:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:43,102 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2025-02-08 00:08:43,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) 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-08 00:08:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2025-02-08 00:08:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 00:08:43,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:43,103 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:08:43,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:08:43,103 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:43,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:43,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1904235355, now seen corresponding path program 1 times [2025-02-08 00:08:43,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:43,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316958014] [2025-02-08 00:08:43,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:43,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:43,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 00:08:43,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 00:08:43,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:43,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:43,624 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:43,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:43,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316958014] [2025-02-08 00:08:43,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316958014] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:08:43,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799483613] [2025-02-08 00:08:43,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:43,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:08:43,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:08:43,632 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-08 00:08:43,640 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-08 00:08:43,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 00:08:43,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 00:08:43,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:43,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:43,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 00:08:43,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:08:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:43,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:08:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:44,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799483613] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:08:44,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:08:44,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-08 00:08:44,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584796347] [2025-02-08 00:08:44,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:08:44,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:08:44,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:44,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:08:44,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:08:44,173 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-08 00:08:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:44,404 INFO L93 Difference]: Finished difference Result 178 states and 234 transitions. [2025-02-08 00:08:44,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:08:44,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 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 48 [2025-02-08 00:08:44,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:44,405 INFO L225 Difference]: With dead ends: 178 [2025-02-08 00:08:44,405 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 00:08:44,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-02-08 00:08:44,407 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 155 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:44,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 264 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:08:44,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 00:08:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2025-02-08 00:08:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:08:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2025-02-08 00:08:44,412 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 48 [2025-02-08 00:08:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:44,412 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2025-02-08 00:08:44,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-08 00:08:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2025-02-08 00:08:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 00:08:44,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:44,414 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:08:44,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 00:08:44,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:08:44,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:44,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:44,619 INFO L85 PathProgramCache]: Analyzing trace with hash 34061727, now seen corresponding path program 1 times [2025-02-08 00:08:44,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:44,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27635191] [2025-02-08 00:08:44,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:44,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:44,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 00:08:44,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 00:08:44,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:44,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:45,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:45,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27635191] [2025-02-08 00:08:45,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27635191] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:08:45,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280045986] [2025-02-08 00:08:45,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:45,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:08:45,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:08:45,136 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-08 00:08:45,140 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-08 00:08:45,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 00:08:45,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 00:08:45,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:45,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:45,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 00:08:45,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:08:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:45,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:08:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:45,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280045986] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:08:45,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:08:45,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-02-08 00:08:45,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926148195] [2025-02-08 00:08:45,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:08:45,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 00:08:45,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:45,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 00:08:45,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:08:45,778 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand has 17 states, 17 states have (on average 7.0) internal successors, (119), 16 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:08:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:46,071 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2025-02-08 00:08:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:08:46,071 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.0) internal successors, (119), 16 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-02-08 00:08:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:46,072 INFO L225 Difference]: With dead ends: 136 [2025-02-08 00:08:46,072 INFO L226 Difference]: Without dead ends: 80 [2025-02-08 00:08:46,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-02-08 00:08:46,072 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 217 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:46,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 143 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:08:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-08 00:08:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-08 00:08:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 0 states have call successors, (0), 0 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-08 00:08:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2025-02-08 00:08:46,079 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 103 transitions. Word has length 49 [2025-02-08 00:08:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:46,079 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 103 transitions. [2025-02-08 00:08:46,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.0) internal successors, (119), 16 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:08:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2025-02-08 00:08:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 00:08:46,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:46,080 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:08:46,089 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-08 00:08:46,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:08:46,280 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:46,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:46,281 INFO L85 PathProgramCache]: Analyzing trace with hash -126320198, now seen corresponding path program 1 times [2025-02-08 00:08:46,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:46,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718022562] [2025-02-08 00:08:46,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:46,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:46,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 00:08:46,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 00:08:46,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:46,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 00:08:46,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:46,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718022562] [2025-02-08 00:08:46,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718022562] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:08:46,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786131025] [2025-02-08 00:08:46,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:46,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:08:46,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:08:46,826 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-08 00:08:46,827 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-08 00:08:46,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 00:08:46,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 00:08:46,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:46,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:46,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-02-08 00:08:46,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:08:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 00:08:47,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:08:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:50,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786131025] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:08:50,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:08:50,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 14] total 29 [2025-02-08 00:08:50,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786705600] [2025-02-08 00:08:50,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:08:50,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-08 00:08:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:50,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-08 00:08:50,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2025-02-08 00:08:50,219 INFO L87 Difference]: Start difference. First operand 80 states and 103 transitions. Second operand has 30 states, 30 states have (on average 4.633333333333334) internal successors, (139), 29 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-08 00:08:50,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:50,861 INFO L93 Difference]: Finished difference Result 129 states and 166 transitions. [2025-02-08 00:08:50,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 00:08:50,861 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.633333333333334) internal successors, (139), 29 states have internal predecessors, (139), 0 states have call successors, (0), 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 50 [2025-02-08 00:08:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:50,862 INFO L225 Difference]: With dead ends: 129 [2025-02-08 00:08:50,862 INFO L226 Difference]: Without dead ends: 85 [2025-02-08 00:08:50,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=1183, Unknown=0, NotChecked=0, Total=1406 [2025-02-08 00:08:50,864 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 99 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:50,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 148 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:08:50,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-08 00:08:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2025-02-08 00:08:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 82 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-08 00:08:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2025-02-08 00:08:50,869 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 50 [2025-02-08 00:08:50,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:50,869 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2025-02-08 00:08:50,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.633333333333334) internal successors, (139), 29 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-08 00:08:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2025-02-08 00:08:50,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 00:08:50,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:50,870 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:08:50,883 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-08 00:08:51,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:08:51,074 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:51,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:51,075 INFO L85 PathProgramCache]: Analyzing trace with hash 820645253, now seen corresponding path program 1 times [2025-02-08 00:08:51,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:51,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557981856] [2025-02-08 00:08:51,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:51,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 00:08:51,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 00:08:51,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:51,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:52,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:52,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557981856] [2025-02-08 00:08:52,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557981856] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:08:52,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308598382] [2025-02-08 00:08:52,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:52,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:08:52,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:08:52,012 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-08 00:08:52,026 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-08 00:08:52,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 00:08:52,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 00:08:52,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:52,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:52,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-08 00:08:52,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:08:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:52,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:08:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:52,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308598382] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:08:52,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:08:52,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 17 [2025-02-08 00:08:52,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347311806] [2025-02-08 00:08:52,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:08:52,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 00:08:52,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:52,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 00:08:52,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-02-08 00:08:52,827 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 18 states, 18 states have (on average 6.944444444444445) internal successors, (125), 17 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-08 00:08:53,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:53,087 INFO L93 Difference]: Finished difference Result 155 states and 195 transitions. [2025-02-08 00:08:53,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:08:53,088 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.944444444444445) internal successors, (125), 17 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-02-08 00:08:53,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:53,088 INFO L225 Difference]: With dead ends: 155 [2025-02-08 00:08:53,088 INFO L226 Difference]: Without dead ends: 108 [2025-02-08 00:08:53,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-02-08 00:08:53,089 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 250 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:53,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 108 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:08:53,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-08 00:08:53,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2025-02-08 00:08:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.288659793814433) internal successors, (125), 97 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-08 00:08:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 125 transitions. [2025-02-08 00:08:53,092 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 125 transitions. Word has length 51 [2025-02-08 00:08:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:53,093 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 125 transitions. [2025-02-08 00:08:53,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.944444444444445) internal successors, (125), 17 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-08 00:08:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2025-02-08 00:08:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 00:08:53,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:53,094 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:08:53,103 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-08 00:08:53,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 00:08:53,294 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:53,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:53,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1015700701, now seen corresponding path program 1 times [2025-02-08 00:08:53,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:53,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806662581] [2025-02-08 00:08:53,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:53,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:53,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 00:08:53,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 00:08:53,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:53,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 32 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:54,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:54,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806662581] [2025-02-08 00:08:54,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806662581] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:08:54,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163969593] [2025-02-08 00:08:54,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:54,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:08:54,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:08:54,835 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-08 00:08:54,837 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-08 00:08:55,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 00:08:55,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 00:08:55,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:55,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:55,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-08 00:08:55,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:08:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 32 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:55,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:08:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:56,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163969593] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:08:56,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:08:56,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 31 [2025-02-08 00:08:56,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161178463] [2025-02-08 00:08:56,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:08:56,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 00:08:56,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:56,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 00:08:56,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2025-02-08 00:08:56,095 INFO L87 Difference]: Start difference. First operand 98 states and 125 transitions. Second operand has 32 states, 32 states have (on average 4.5625) internal successors, (146), 31 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:08:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:57,464 INFO L93 Difference]: Finished difference Result 405 states and 500 transitions. [2025-02-08 00:08:57,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-08 00:08:57,464 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.5625) internal successors, (146), 31 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-08 00:08:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:57,466 INFO L225 Difference]: With dead ends: 405 [2025-02-08 00:08:57,466 INFO L226 Difference]: Without dead ends: 358 [2025-02-08 00:08:57,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=637, Invalid=3653, Unknown=0, NotChecked=0, Total=4290 [2025-02-08 00:08:57,469 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 493 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:57,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 413 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:08:57,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-08 00:08:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 171. [2025-02-08 00:08:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.276470588235294) internal successors, (217), 170 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:08:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 217 transitions. [2025-02-08 00:08:57,480 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 217 transitions. Word has length 71 [2025-02-08 00:08:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:57,480 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 217 transitions. [2025-02-08 00:08:57,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.5625) internal successors, (146), 31 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:08:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 217 transitions. [2025-02-08 00:08:57,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 00:08:57,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:57,481 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:08:57,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 00:08:57,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 00:08:57,684 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:57,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1135765395, now seen corresponding path program 1 times [2025-02-08 00:08:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:57,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344373509] [2025-02-08 00:08:57,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:57,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 00:08:57,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 00:08:57,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:57,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:58,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:58,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344373509] [2025-02-08 00:08:58,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344373509] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:08:58,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784370346] [2025-02-08 00:08:58,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:58,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:08:58,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:08:58,139 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-08 00:08:58,141 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-08 00:08:58,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 00:08:58,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 00:08:58,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:58,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:58,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-08 00:08:58,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:08:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 35 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:58,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:08:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:08:59,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784370346] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:08:59,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:08:59,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 11] total 25 [2025-02-08 00:08:59,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326341598] [2025-02-08 00:08:59,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:08:59,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 00:08:59,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:59,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 00:08:59,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-02-08 00:08:59,095 INFO L87 Difference]: Start difference. First operand 171 states and 217 transitions. Second operand has 25 states, 25 states have (on average 7.8) internal successors, (195), 25 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-08 00:08:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:59,754 INFO L93 Difference]: Finished difference Result 410 states and 526 transitions. [2025-02-08 00:08:59,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 00:08:59,755 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.8) internal successors, (195), 25 states have internal predecessors, (195), 0 states have call successors, (0), 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 72 [2025-02-08 00:08:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:59,756 INFO L225 Difference]: With dead ends: 410 [2025-02-08 00:08:59,756 INFO L226 Difference]: Without dead ends: 275 [2025-02-08 00:08:59,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 00:08:59,757 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 156 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:59,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 264 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:08:59,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-08 00:08:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 260. [2025-02-08 00:08:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.2934362934362935) internal successors, (335), 259 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:08:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 335 transitions. [2025-02-08 00:08:59,770 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 335 transitions. Word has length 72 [2025-02-08 00:08:59,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:59,770 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 335 transitions. [2025-02-08 00:08:59,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.8) internal successors, (195), 25 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-08 00:08:59,770 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 335 transitions. [2025-02-08 00:08:59,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 00:08:59,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:59,771 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:08:59,781 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-08 00:08:59,975 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,SelfDestructingSolverStorable12 [2025-02-08 00:08:59,975 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:59,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash -801927448, now seen corresponding path program 1 times [2025-02-08 00:08:59,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:59,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414538523] [2025-02-08 00:08:59,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:59,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:00,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 00:09:00,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 00:09:00,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:00,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:00,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:00,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414538523] [2025-02-08 00:09:00,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414538523] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:09:00,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616265007] [2025-02-08 00:09:00,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:00,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:00,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:00,525 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-08 00:09:00,526 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-08 00:09:00,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 00:09:00,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 00:09:00,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:00,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:00,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-02-08 00:09:00,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:09:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 32 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:01,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:09:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 37 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:01,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616265007] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:09:01,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:09:01,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 15] total 40 [2025-02-08 00:09:01,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064980157] [2025-02-08 00:09:01,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:09:01,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-08 00:09:01,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:01,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-08 00:09:01,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1355, Unknown=0, NotChecked=0, Total=1560 [2025-02-08 00:09:01,810 INFO L87 Difference]: Start difference. First operand 260 states and 335 transitions. Second operand has 40 states, 40 states have (on average 5.025) internal successors, (201), 40 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-08 00:09:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:05,320 INFO L93 Difference]: Finished difference Result 1068 states and 1339 transitions. [2025-02-08 00:09:05,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-02-08 00:09:05,321 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 5.025) internal successors, (201), 40 states have internal predecessors, (201), 0 states have call successors, (0), 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 72 [2025-02-08 00:09:05,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:05,329 INFO L225 Difference]: With dead ends: 1068 [2025-02-08 00:09:05,330 INFO L226 Difference]: Without dead ends: 844 [2025-02-08 00:09:05,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4441 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1547, Invalid=12259, Unknown=0, NotChecked=0, Total=13806 [2025-02-08 00:09:05,334 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 411 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 3446 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 3467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:05,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 958 Invalid, 3467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3446 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 00:09:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2025-02-08 00:09:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 382. [2025-02-08 00:09:05,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.2834645669291338) internal successors, (489), 381 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 489 transitions. [2025-02-08 00:09:05,347 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 489 transitions. Word has length 72 [2025-02-08 00:09:05,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:05,347 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 489 transitions. [2025-02-08 00:09:05,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 5.025) internal successors, (201), 40 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-08 00:09:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 489 transitions. [2025-02-08 00:09:05,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-08 00:09:05,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:05,348 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:05,358 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-08 00:09:05,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:05,549 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:05,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:05,549 INFO L85 PathProgramCache]: Analyzing trace with hash -614431955, now seen corresponding path program 1 times [2025-02-08 00:09:05,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:05,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064477607] [2025-02-08 00:09:05,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:05,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:05,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-08 00:09:05,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 00:09:05,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:05,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 00:09:06,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:06,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064477607] [2025-02-08 00:09:06,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064477607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:06,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:06,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:09:06,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000535451] [2025-02-08 00:09:06,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:06,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:09:06,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:06,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:09:06,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:09:06,045 INFO L87 Difference]: Start difference. First operand 382 states and 489 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-08 00:09:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:06,207 INFO L93 Difference]: Finished difference Result 750 states and 965 transitions. [2025-02-08 00:09:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:09:06,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 73 [2025-02-08 00:09:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:06,209 INFO L225 Difference]: With dead ends: 750 [2025-02-08 00:09:06,209 INFO L226 Difference]: Without dead ends: 404 [2025-02-08 00:09:06,213 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-08 00:09:06,214 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 100 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 59 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-08 00:09:06,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 59 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:09:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-08 00:09:06,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 392. [2025-02-08 00:09:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.2838874680306904) internal successors, (502), 391 states have internal predecessors, (502), 0 states have call successors, (0), 0 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-08 00:09:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 502 transitions. [2025-02-08 00:09:06,234 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 502 transitions. Word has length 73 [2025-02-08 00:09:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:06,237 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 502 transitions. [2025-02-08 00:09:06,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-08 00:09:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 502 transitions. [2025-02-08 00:09:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-08 00:09:06,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:06,239 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:06,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 00:09:06,239 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:06,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash -992429223, now seen corresponding path program 1 times [2025-02-08 00:09:06,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:06,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782250273] [2025-02-08 00:09:06,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:06,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:06,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-08 00:09:06,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 00:09:06,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:06,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 00:09:07,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:07,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782250273] [2025-02-08 00:09:07,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782250273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:07,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:07,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:09:07,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990248986] [2025-02-08 00:09:07,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:07,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:09:07,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:07,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:09:07,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:09:07,215 INFO L87 Difference]: Start difference. First operand 392 states and 502 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-08 00:09:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:07,277 INFO L93 Difference]: Finished difference Result 740 states and 947 transitions. [2025-02-08 00:09:07,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:09:07,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 73 [2025-02-08 00:09:07,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:07,280 INFO L225 Difference]: With dead ends: 740 [2025-02-08 00:09:07,280 INFO L226 Difference]: Without dead ends: 388 [2025-02-08 00:09:07,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:09:07,281 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 73 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:07,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 178 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:09:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-08 00:09:07,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-02-08 00:09:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 1.2816537467700257) internal successors, (496), 387 states have internal predecessors, (496), 0 states have call successors, (0), 0 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-08 00:09:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 496 transitions. [2025-02-08 00:09:07,307 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 496 transitions. Word has length 73 [2025-02-08 00:09:07,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:07,308 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 496 transitions. [2025-02-08 00:09:07,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-08 00:09:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 496 transitions. [2025-02-08 00:09:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-08 00:09:07,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:07,309 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:07,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 00:09:07,310 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:07,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:07,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1220751339, now seen corresponding path program 2 times [2025-02-08 00:09:07,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:07,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094482499] [2025-02-08 00:09:07,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:09:07,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:07,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-02-08 00:09:07,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 00:09:07,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:09:07,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 81 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 00:09:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:07,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094482499] [2025-02-08 00:09:07,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094482499] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:09:07,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383757761] [2025-02-08 00:09:07,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:09:07,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:07,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:07,935 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-08 00:09:07,936 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-08 00:09:08,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-02-08 00:09:08,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 00:09:08,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:09:08,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:08,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-08 00:09:08,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:09:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 47 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 00:09:08,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:09:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 00:09:09,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383757761] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 00:09:09,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:09:09,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 9] total 20 [2025-02-08 00:09:09,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318898883] [2025-02-08 00:09:09,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:09,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:09:09,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:09,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:09:09,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-02-08 00:09:09,140 INFO L87 Difference]: Start difference. First operand 388 states and 496 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-08 00:09:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:09,329 INFO L93 Difference]: Finished difference Result 959 states and 1225 transitions. [2025-02-08 00:09:09,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:09:09,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 92 [2025-02-08 00:09:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:09,332 INFO L225 Difference]: With dead ends: 959 [2025-02-08 00:09:09,332 INFO L226 Difference]: Without dead ends: 553 [2025-02-08 00:09:09,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-02-08 00:09:09,333 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 54 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:09,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 166 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:09:09,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-02-08 00:09:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 539. [2025-02-08 00:09:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.2657992565055762) internal successors, (681), 538 states have internal predecessors, (681), 0 states have call successors, (0), 0 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-08 00:09:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 681 transitions. [2025-02-08 00:09:09,350 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 681 transitions. Word has length 92 [2025-02-08 00:09:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:09,351 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 681 transitions. [2025-02-08 00:09:09,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-08 00:09:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 681 transitions. [2025-02-08 00:09:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 00:09:09,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:09,357 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:09,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 00:09:09,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 00:09:09,558 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:09,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1045971077, now seen corresponding path program 3 times [2025-02-08 00:09:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:09,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209084748] [2025-02-08 00:09:09,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 00:09:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:09,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 4 equivalence classes. [2025-02-08 00:09:09,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 51 of 93 statements. [2025-02-08 00:09:09,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 00:09:09,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 29 proven. 45 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 00:09:10,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:10,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209084748] [2025-02-08 00:09:10,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209084748] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:09:10,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109869745] [2025-02-08 00:09:10,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 00:09:10,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:10,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:10,873 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-08 00:09:10,875 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-08 00:09:11,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 4 equivalence classes. [2025-02-08 00:09:11,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 51 of 93 statements. [2025-02-08 00:09:11,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 00:09:11,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:11,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-02-08 00:09:11,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:09:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 53 proven. 21 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 00:09:12,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:09:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 43 proven. 31 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 00:09:13,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109869745] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:09:13,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:09:13,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 37 [2025-02-08 00:09:13,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736226450] [2025-02-08 00:09:13,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:09:13,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-08 00:09:13,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:13,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-08 00:09:13,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1222, Unknown=0, NotChecked=0, Total=1406 [2025-02-08 00:09:13,411 INFO L87 Difference]: Start difference. First operand 539 states and 681 transitions. Second operand has 38 states, 38 states have (on average 4.078947368421052) internal successors, (155), 37 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-08 00:09:14,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:14,813 INFO L93 Difference]: Finished difference Result 1263 states and 1589 transitions. [2025-02-08 00:09:14,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-08 00:09:14,814 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.078947368421052) internal successors, (155), 37 states have internal predecessors, (155), 0 states have call successors, (0), 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 93 [2025-02-08 00:09:14,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:14,816 INFO L225 Difference]: With dead ends: 1263 [2025-02-08 00:09:14,817 INFO L226 Difference]: Without dead ends: 766 [2025-02-08 00:09:14,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=556, Invalid=3226, Unknown=0, NotChecked=0, Total=3782 [2025-02-08 00:09:14,818 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 167 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:14,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 381 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:09:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-02-08 00:09:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 662. [2025-02-08 00:09:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.2798789712556733) internal successors, (846), 661 states have internal predecessors, (846), 0 states have call successors, (0), 0 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-08 00:09:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 846 transitions. [2025-02-08 00:09:14,835 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 846 transitions. Word has length 93 [2025-02-08 00:09:14,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:14,835 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 846 transitions. [2025-02-08 00:09:14,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.078947368421052) internal successors, (155), 37 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-08 00:09:14,835 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 846 transitions. [2025-02-08 00:09:14,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 00:09:14,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:14,837 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:14,849 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-08 00:09:15,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 00:09:15,037 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:15,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:15,038 INFO L85 PathProgramCache]: Analyzing trace with hash 72358236, now seen corresponding path program 1 times [2025-02-08 00:09:15,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:15,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583685287] [2025-02-08 00:09:15,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:15,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:15,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 00:09:15,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 00:09:15,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:15,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:15,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:15,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583685287] [2025-02-08 00:09:15,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583685287] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:09:15,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860664850] [2025-02-08 00:09:15,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:15,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:15,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:15,551 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-08 00:09:15,558 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-08 00:09:15,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 00:09:15,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 00:09:15,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:15,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:15,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-02-08 00:09:15,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:09:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 77 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:16,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:09:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 77 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 00:09:16,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860664850] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:09:16,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:09:16,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 12] total 31 [2025-02-08 00:09:16,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788726098] [2025-02-08 00:09:16,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:09:16,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 00:09:16,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:16,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 00:09:16,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2025-02-08 00:09:16,834 INFO L87 Difference]: Start difference. First operand 662 states and 846 transitions. Second operand has 32 states, 32 states have (on average 7.65625) internal successors, (245), 31 states have internal predecessors, (245), 0 states have call successors, (0), 0 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-08 00:09:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:17,840 INFO L93 Difference]: Finished difference Result 1932 states and 2462 transitions. [2025-02-08 00:09:17,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-08 00:09:17,841 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.65625) internal successors, (245), 31 states have internal predecessors, (245), 0 states have call successors, (0), 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 93 [2025-02-08 00:09:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:17,846 INFO L225 Difference]: With dead ends: 1932 [2025-02-08 00:09:17,846 INFO L226 Difference]: Without dead ends: 1312 [2025-02-08 00:09:17,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=489, Invalid=2163, Unknown=0, NotChecked=0, Total=2652 [2025-02-08 00:09:17,849 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 367 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:17,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 483 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:09:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-02-08 00:09:17,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1019. [2025-02-08 00:09:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 1.2662082514734774) internal successors, (1289), 1018 states have internal predecessors, (1289), 0 states have call successors, (0), 0 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-08 00:09:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1289 transitions. [2025-02-08 00:09:17,881 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1289 transitions. Word has length 93 [2025-02-08 00:09:17,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:17,881 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1289 transitions. [2025-02-08 00:09:17,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.65625) internal successors, (245), 31 states have internal predecessors, (245), 0 states have call successors, (0), 0 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-08 00:09:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1289 transitions. [2025-02-08 00:09:17,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 00:09:17,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:17,884 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:17,896 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-08 00:09:18,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:18,089 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:18,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:18,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1366626644, now seen corresponding path program 2 times [2025-02-08 00:09:18,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:18,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194011240] [2025-02-08 00:09:18,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:09:18,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:18,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-02-08 00:09:18,206 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 00:09:18,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:09:18,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 82 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 00:09:18,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:18,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194011240] [2025-02-08 00:09:18,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194011240] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:09:18,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221097742] [2025-02-08 00:09:18,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:09:18,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:18,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:18,879 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-08 00:09:18,884 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-08 00:09:19,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-02-08 00:09:19,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 00:09:19,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:09:19,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:19,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-02-08 00:09:19,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:09:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 82 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 00:09:20,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:09:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 00:09:21,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221097742] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:09:21,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:09:21,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 14] total 27 [2025-02-08 00:09:21,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116581519] [2025-02-08 00:09:21,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:09:21,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 00:09:21,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:21,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 00:09:21,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2025-02-08 00:09:21,116 INFO L87 Difference]: Start difference. First operand 1019 states and 1289 transitions. Second operand has 27 states, 27 states have (on average 7.333333333333333) internal successors, (198), 27 states have internal predecessors, (198), 0 states have call successors, (0), 0 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-08 00:09:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:22,123 INFO L93 Difference]: Finished difference Result 2531 states and 3257 transitions. [2025-02-08 00:09:22,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-08 00:09:22,124 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.333333333333333) internal successors, (198), 27 states have internal predecessors, (198), 0 states have call successors, (0), 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 94 [2025-02-08 00:09:22,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:22,129 INFO L225 Difference]: With dead ends: 2531 [2025-02-08 00:09:22,129 INFO L226 Difference]: Without dead ends: 1554 [2025-02-08 00:09:22,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=2091, Unknown=0, NotChecked=0, Total=2352 [2025-02-08 00:09:22,133 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 130 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:22,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 305 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:09:22,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-02-08 00:09:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1450. [2025-02-08 00:09:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1449 states have (on average 1.2760524499654935) internal successors, (1849), 1449 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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-08 00:09:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 1849 transitions. [2025-02-08 00:09:22,187 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 1849 transitions. Word has length 94 [2025-02-08 00:09:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:22,187 INFO L471 AbstractCegarLoop]: Abstraction has 1450 states and 1849 transitions. [2025-02-08 00:09:22,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.333333333333333) internal successors, (198), 27 states have internal predecessors, (198), 0 states have call successors, (0), 0 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-08 00:09:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1849 transitions. [2025-02-08 00:09:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 00:09:22,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:22,190 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:22,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 00:09:22,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:22,395 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:22,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:22,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1644127073, now seen corresponding path program 2 times [2025-02-08 00:09:22,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:22,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392212661] [2025-02-08 00:09:22,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:09:22,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:22,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-02-08 00:09:22,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 00:09:22,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:09:22,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 83 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 00:09:23,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:23,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392212661] [2025-02-08 00:09:23,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392212661] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:09:23,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456766030] [2025-02-08 00:09:23,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:09:23,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:23,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:23,799 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:09:23,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 00:09:24,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-02-08 00:09:24,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 00:09:24,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:09:24,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:24,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-02-08 00:09:24,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:09:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 58 proven. 25 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 00:09:25,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:09:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 21 proven. 62 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 00:09:26,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456766030] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:09:26,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:09:26,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 16] total 35 [2025-02-08 00:09:26,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116558284] [2025-02-08 00:09:26,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:09:26,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 00:09:26,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:26,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 00:09:26,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 00:09:26,157 INFO L87 Difference]: Start difference. First operand 1450 states and 1849 transitions. Second operand has 36 states, 36 states have (on average 6.222222222222222) internal successors, (224), 35 states have internal predecessors, (224), 0 states have call successors, (0), 0 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-08 00:09:28,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:28,025 INFO L93 Difference]: Finished difference Result 3976 states and 4963 transitions. [2025-02-08 00:09:28,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-02-08 00:09:28,026 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 6.222222222222222) internal successors, (224), 35 states have internal predecessors, (224), 0 states have call successors, (0), 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 94 [2025-02-08 00:09:28,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:28,036 INFO L225 Difference]: With dead ends: 3976 [2025-02-08 00:09:28,036 INFO L226 Difference]: Without dead ends: 2568 [2025-02-08 00:09:28,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=923, Invalid=5883, Unknown=0, NotChecked=0, Total=6806 [2025-02-08 00:09:28,043 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 425 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:28,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 520 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:09:28,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2025-02-08 00:09:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 1507. [2025-02-08 00:09:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1506 states have (on average 1.2556440903054449) internal successors, (1891), 1506 states have internal predecessors, (1891), 0 states have call successors, (0), 0 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-08 00:09:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1891 transitions. [2025-02-08 00:09:28,120 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1891 transitions. Word has length 94 [2025-02-08 00:09:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:28,120 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 1891 transitions. [2025-02-08 00:09:28,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 6.222222222222222) internal successors, (224), 35 states have internal predecessors, (224), 0 states have call successors, (0), 0 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-08 00:09:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1891 transitions. [2025-02-08 00:09:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 00:09:28,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:28,122 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:28,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 00:09:28,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:28,326 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:28,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:28,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1557660941, now seen corresponding path program 1 times [2025-02-08 00:09:28,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:28,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228422389] [2025-02-08 00:09:28,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:28,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:28,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 00:09:28,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 00:09:28,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:28,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 00:09:28,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:28,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228422389] [2025-02-08 00:09:28,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228422389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:28,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:28,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:09:28,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588982565] [2025-02-08 00:09:28,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:28,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:09:28,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:28,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:09:28,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:09:28,770 INFO L87 Difference]: Start difference. First operand 1507 states and 1891 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-08 00:09:28,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:28,807 INFO L93 Difference]: Finished difference Result 1594 states and 1986 transitions. [2025-02-08 00:09:28,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:09:28,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 95 [2025-02-08 00:09:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:28,811 INFO L225 Difference]: With dead ends: 1594 [2025-02-08 00:09:28,811 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 00:09:28,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:09:28,814 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 4 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:28,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 232 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:09:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 00:09:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 00:09:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 00:09:28,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2025-02-08 00:09:28,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:28,819 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 00:09:28,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-08 00:09:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 00:09:28,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 00:09:28,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:09:28,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 00:09:28,825 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:28,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 00:09:29,014 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:09:29,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:09:29 BoogieIcfgContainer [2025-02-08 00:09:29,028 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:09:29,029 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:09:29,029 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:09:29,029 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:09:29,029 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:08:40" (3/4) ... [2025-02-08 00:09:29,031 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 00:09:29,049 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-08 00:09:29,049 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 00:09:29,050 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 00:09:29,050 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 00:09:29,140 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 00:09:29,141 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 00:09:29,141 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:09:29,142 INFO L158 Benchmark]: Toolchain (without parser) took 49660.33ms. Allocated memory was 142.6MB in the beginning and 939.5MB in the end (delta: 796.9MB). Free memory was 111.1MB in the beginning and 885.7MB in the end (delta: -774.7MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2025-02-08 00:09:29,142 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:09:29,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.62ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 96.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:09:29,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.78ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 90.4MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:09:29,145 INFO L158 Benchmark]: Boogie Preprocessor took 38.43ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 86.9MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:09:29,145 INFO L158 Benchmark]: IcfgBuilder took 480.86ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 49.8MB in the end (delta: 37.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 00:09:29,145 INFO L158 Benchmark]: TraceAbstraction took 48734.28ms. Allocated memory was 142.6MB in the beginning and 939.5MB in the end (delta: 796.9MB). Free memory was 49.4MB in the beginning and 894.0MB in the end (delta: -844.6MB). Peak memory consumption was 510.2MB. Max. memory is 16.1GB. [2025-02-08 00:09:29,146 INFO L158 Benchmark]: Witness Printer took 112.51ms. Allocated memory is still 939.5MB. Free memory was 894.0MB in the beginning and 885.7MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:09:29,147 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.62ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 96.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.78ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 90.4MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.43ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 86.9MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 480.86ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 49.8MB in the end (delta: 37.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 48734.28ms. Allocated memory was 142.6MB in the beginning and 939.5MB in the end (delta: 796.9MB). Free memory was 49.4MB in the beginning and 894.0MB in the end (delta: -844.6MB). Peak memory consumption was 510.2MB. Max. memory is 16.1GB. * Witness Printer took 112.51ms. Allocated memory is still 939.5MB. Free memory was 894.0MB in the beginning and 885.7MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.5s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3496 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3496 mSDsluCounter, 6153 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5142 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14531 IncrementalHoareTripleChecker+Invalid, 14685 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 1011 mSDtfsCounter, 14531 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2201 GetRequests, 1596 SyntacticMatches, 2 SemanticMatches, 603 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10425 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1507occurred in iteration=21, InterpolantAutomatonStates: 400, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 2312 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 25.5s InterpolantComputationTime, 2186 NumberOfCodeBlocks, 2102 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3019 ConstructedInterpolants, 34 QuantifiedInterpolants, 25919 SizeOfPredicates, 55 NumberOfNonLiveVariables, 6421 ConjunctsInSsa, 750 ConjunctsInUnsatCore, 46 InterpolantComputations, 11 PerfectInterpolantSequences, 1804/2257 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Location Invariant Derived location invariant: (((((var_12 == 1) && (var_22 == 1)) && (mask_SORT_1 == 0)) && (var_7 == 0)) || (((((((((var_12 == 1) && (state_8 == 0)) && (state_58 == 0)) && (state_28 <= 1)) && (state_15 == 0)) && (var_22 == 1)) && (mask_SORT_1 == 1)) && (0 <= state_28)) && (var_7 == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-08 00:09:29,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE