./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p06.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p06.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 3a10e323530dd468ac9890be0bde9c03597b2532bfc479ced0ba7cd3c96166ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:09:02,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:09:02,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:09:02,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:09:02,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:09:02,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:09:02,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:09:02,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:09:02,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:09:02,978 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:09:02,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:09:02,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:09:02,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:09:02,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:09:02,978 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:09:02,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:09:02,979 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:09:02,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:09:02,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:09:02,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:09:02,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:09:02,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:09:02,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:09:02,980 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 -> 3a10e323530dd468ac9890be0bde9c03597b2532bfc479ced0ba7cd3c96166ef [2025-02-05 20:09:03,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:09:03,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:09:03,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:09:03,358 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:09:03,358 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:09:03,359 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_p06.c [2025-02-05 20:09:04,623 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8630bba89/b522a4bf1d6f493da3df4960f406ca28/FLAG808113c17 [2025-02-05 20:09:04,885 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:09:04,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p06.c [2025-02-05 20:09:04,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8630bba89/b522a4bf1d6f493da3df4960f406ca28/FLAG808113c17 [2025-02-05 20:09:04,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8630bba89/b522a4bf1d6f493da3df4960f406ca28 [2025-02-05 20:09:04,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:09:04,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:09:04,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:09:04,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:09:04,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:09:04,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:09:04" (1/1) ... [2025-02-05 20:09:04,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d119d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:04, skipping insertion in model container [2025-02-05 20:09:04,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:09:04" (1/1) ... [2025-02-05 20:09:04,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:09:05,123 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_p06.c[1266,1279] [2025-02-05 20:09:05,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:09:05,315 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:09:05,325 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_p06.c[1266,1279] [2025-02-05 20:09:05,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:09:05,391 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:09:05,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:05 WrapperNode [2025-02-05 20:09:05,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:09:05,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:09:05,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:09:05,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:09:05,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:05" (1/1) ... [2025-02-05 20:09:05,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:05" (1/1) ... [2025-02-05 20:09:05,464 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 747 [2025-02-05 20:09:05,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:09:05,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:09:05,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:09:05,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:09:05,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:05" (1/1) ... [2025-02-05 20:09:05,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:05" (1/1) ... [2025-02-05 20:09:05,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:05" (1/1) ... [2025-02-05 20:09:05,523 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:09:05,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:05" (1/1) ... [2025-02-05 20:09:05,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:05" (1/1) ... [2025-02-05 20:09:05,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:05" (1/1) ... [2025-02-05 20:09:05,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:05" (1/1) ... [2025-02-05 20:09:05,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:05" (1/1) ... [2025-02-05 20:09:05,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:05" (1/1) ... [2025-02-05 20:09:05,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:09:05,586 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:09:05,586 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:09:05,586 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:09:05,588 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:05" (1/1) ... [2025-02-05 20:09:05,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:09:05,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:05,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:09:05,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:09:05,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:09:05,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:09:05,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:09:05,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:09:05,759 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:09:05,760 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:09:06,413 INFO L? ?]: Removed 395 outVars from TransFormulas that were not future-live. [2025-02-05 20:09:06,414 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:09:06,443 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:09:06,443 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:09:06,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:09:06 BoogieIcfgContainer [2025-02-05 20:09:06,444 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:09:06,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:09:06,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:09:06,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:09:06,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:09:04" (1/3) ... [2025-02-05 20:09:06,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bed34d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:09:06, skipping insertion in model container [2025-02-05 20:09:06,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:05" (2/3) ... [2025-02-05 20:09:06,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bed34d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:09:06, skipping insertion in model container [2025-02-05 20:09:06,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:09:06" (3/3) ... [2025-02-05 20:09:06,488 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p06.c [2025-02-05 20:09:06,498 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:09:06,499 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p06.c that has 1 procedures, 142 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:09:06,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:09:06,541 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;@7ec8f957, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:09:06,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:09:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 20:09:06,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:06,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:06,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:06,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1016460869, now seen corresponding path program 1 times [2025-02-05 20:09:06,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:06,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183114815] [2025-02-05 20:09:06,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:06,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:06,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 20:09:06,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 20:09:06,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:06,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:07,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:07,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183114815] [2025-02-05 20:09:07,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183114815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:07,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:07,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:09:07,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880404641] [2025-02-05 20:09:07,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:07,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:09:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:07,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:09:07,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:09:07,021 INFO L87 Difference]: Start difference. First operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 0 states have call successors, (0), 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 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:07,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:07,146 INFO L93 Difference]: Finished difference Result 229 states and 339 transitions. [2025-02-05 20:09:07,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:09:07,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-02-05 20:09:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:07,155 INFO L225 Difference]: With dead ends: 229 [2025-02-05 20:09:07,155 INFO L226 Difference]: Without dead ends: 141 [2025-02-05 20:09:07,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:09:07,159 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:07,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-05 20:09:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-02-05 20:09:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 140 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2025-02-05 20:09:07,196 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 41 [2025-02-05 20:09:07,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:07,196 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2025-02-05 20:09:07,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:07,197 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2025-02-05 20:09:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 20:09:07,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:07,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:07,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:09:07,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:07,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:07,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1440836617, now seen corresponding path program 1 times [2025-02-05 20:09:07,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:07,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401915309] [2025-02-05 20:09:07,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:07,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:07,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 20:09:07,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 20:09:07,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:07,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:07,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:07,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401915309] [2025-02-05 20:09:07,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401915309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:07,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:07,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:09:07,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895320374] [2025-02-05 20:09:07,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:07,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:09:07,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:07,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:09:07,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:09:07,397 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:07,496 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2025-02-05 20:09:07,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:09:07,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-02-05 20:09:07,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:07,497 INFO L225 Difference]: With dead ends: 230 [2025-02-05 20:09:07,497 INFO L226 Difference]: Without dead ends: 143 [2025-02-05 20:09:07,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:09:07,498 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:07,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 502 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:07,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-05 20:09:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-02-05 20:09:07,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.471830985915493) internal successors, (209), 142 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:07,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2025-02-05 20:09:07,504 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 42 [2025-02-05 20:09:07,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:07,504 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2025-02-05 20:09:07,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2025-02-05 20:09:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 20:09:07,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:07,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:07,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:09:07,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:07,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:07,509 INFO L85 PathProgramCache]: Analyzing trace with hash 215247158, now seen corresponding path program 1 times [2025-02-05 20:09:07,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:07,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044350824] [2025-02-05 20:09:07,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:07,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:07,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 20:09:07,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 20:09:07,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:07,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:07,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:07,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044350824] [2025-02-05 20:09:07,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044350824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:07,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:07,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:09:07,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003251130] [2025-02-05 20:09:07,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:07,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:09:07,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:07,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:09:07,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:09:07,849 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:07,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:07,946 INFO L93 Difference]: Finished difference Result 232 states and 338 transitions. [2025-02-05 20:09:07,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:09:07,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-02-05 20:09:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:07,948 INFO L225 Difference]: With dead ends: 232 [2025-02-05 20:09:07,948 INFO L226 Difference]: Without dead ends: 143 [2025-02-05 20:09:07,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:09:07,949 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 6 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:07,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 492 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:07,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-05 20:09:07,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-02-05 20:09:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.4647887323943662) internal successors, (208), 142 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 208 transitions. [2025-02-05 20:09:07,959 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 208 transitions. Word has length 43 [2025-02-05 20:09:07,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:07,960 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 208 transitions. [2025-02-05 20:09:07,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 208 transitions. [2025-02-05 20:09:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 20:09:07,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:07,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:07,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:09:07,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:07,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash -28910084, now seen corresponding path program 1 times [2025-02-05 20:09:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:07,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931446715] [2025-02-05 20:09:07,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:07,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:07,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 20:09:08,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 20:09:08,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:08,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:08,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:08,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:08,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931446715] [2025-02-05 20:09:08,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931446715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:08,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:08,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:09:08,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152700138] [2025-02-05 20:09:08,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:08,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:09:08,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:08,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:09:08,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:09:08,335 INFO L87 Difference]: Start difference. First operand 143 states and 208 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:08,507 INFO L93 Difference]: Finished difference Result 242 states and 350 transitions. [2025-02-05 20:09:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:09:08,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-02-05 20:09:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:08,509 INFO L225 Difference]: With dead ends: 242 [2025-02-05 20:09:08,509 INFO L226 Difference]: Without dead ends: 153 [2025-02-05 20:09:08,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 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-05 20:09:08,510 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 192 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:08,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 972 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-05 20:09:08,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2025-02-05 20:09:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.4569536423841059) internal successors, (220), 151 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 220 transitions. [2025-02-05 20:09:08,514 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 220 transitions. Word has length 44 [2025-02-05 20:09:08,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:08,515 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 220 transitions. [2025-02-05 20:09:08,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:08,515 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 220 transitions. [2025-02-05 20:09:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 20:09:08,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:08,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:08,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:09:08,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:08,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:08,516 INFO L85 PathProgramCache]: Analyzing trace with hash 53862060, now seen corresponding path program 1 times [2025-02-05 20:09:08,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:08,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028089277] [2025-02-05 20:09:08,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:08,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:08,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 20:09:08,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 20:09:08,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:08,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:08,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:08,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028089277] [2025-02-05 20:09:08,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028089277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:08,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:08,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:08,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530188412] [2025-02-05 20:09:08,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:08,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:08,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:08,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:08,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:08,664 INFO L87 Difference]: Start difference. First operand 152 states and 220 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:08,768 INFO L93 Difference]: Finished difference Result 279 states and 397 transitions. [2025-02-05 20:09:08,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:09:08,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-02-05 20:09:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:08,769 INFO L225 Difference]: With dead ends: 279 [2025-02-05 20:09:08,769 INFO L226 Difference]: Without dead ends: 181 [2025-02-05 20:09:08,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-05 20:09:08,770 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 236 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:08,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 475 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:08,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-05 20:09:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 154. [2025-02-05 20:09:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.4509803921568627) internal successors, (222), 153 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 222 transitions. [2025-02-05 20:09:08,775 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 222 transitions. Word has length 45 [2025-02-05 20:09:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:08,776 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 222 transitions. [2025-02-05 20:09:08,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 222 transitions. [2025-02-05 20:09:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 20:09:08,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:08,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:08,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:09:08,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:08,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:08,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2057911780, now seen corresponding path program 1 times [2025-02-05 20:09:08,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:08,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094362107] [2025-02-05 20:09:08,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:08,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:08,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 20:09:08,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 20:09:08,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:08,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:09,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:09,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094362107] [2025-02-05 20:09:09,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094362107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:09,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:09,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:09:09,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249854047] [2025-02-05 20:09:09,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:09,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:09:09,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:09,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:09:09,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:09:09,324 INFO L87 Difference]: Start difference. First operand 154 states and 222 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:09,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:09,627 INFO L93 Difference]: Finished difference Result 257 states and 369 transitions. [2025-02-05 20:09:09,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:09:09,627 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-02-05 20:09:09,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:09,628 INFO L225 Difference]: With dead ends: 257 [2025-02-05 20:09:09,628 INFO L226 Difference]: Without dead ends: 159 [2025-02-05 20:09:09,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:09:09,629 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 197 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:09,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1038 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:09:09,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-05 20:09:09,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2025-02-05 20:09:09,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4458598726114649) internal successors, (227), 157 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 227 transitions. [2025-02-05 20:09:09,638 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 227 transitions. Word has length 45 [2025-02-05 20:09:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:09,638 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 227 transitions. [2025-02-05 20:09:09,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 227 transitions. [2025-02-05 20:09:09,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 20:09:09,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:09,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:09,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:09:09,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:09,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1808075447, now seen corresponding path program 1 times [2025-02-05 20:09:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:09,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68564702] [2025-02-05 20:09:09,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:09,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:09,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 20:09:09,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 20:09:09,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:09,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:09,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:09,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68564702] [2025-02-05 20:09:09,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68564702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:09,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:09,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:09:09,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616994705] [2025-02-05 20:09:09,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:09,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:09:09,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:09,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:09:09,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:09:09,833 INFO L87 Difference]: Start difference. First operand 158 states and 227 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:09,913 INFO L93 Difference]: Finished difference Result 266 states and 380 transitions. [2025-02-05 20:09:09,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:09:09,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-02-05 20:09:09,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:09,914 INFO L225 Difference]: With dead ends: 266 [2025-02-05 20:09:09,915 INFO L226 Difference]: Without dead ends: 164 [2025-02-05 20:09:09,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-05 20:09:09,915 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 175 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:09,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 493 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-05 20:09:09,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-02-05 20:09:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.4294478527607362) internal successors, (233), 163 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2025-02-05 20:09:09,919 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 46 [2025-02-05 20:09:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:09,920 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2025-02-05 20:09:09,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2025-02-05 20:09:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 20:09:09,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:09,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:09,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:09:09,921 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:09,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:09,921 INFO L85 PathProgramCache]: Analyzing trace with hash -250411732, now seen corresponding path program 1 times [2025-02-05 20:09:09,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:09,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034237677] [2025-02-05 20:09:09,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:09,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:09,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 20:09:09,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 20:09:09,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:09,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:10,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:10,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034237677] [2025-02-05 20:09:10,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034237677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:10,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:10,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:10,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828022077] [2025-02-05 20:09:10,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:10,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:10,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:10,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:10,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:10,055 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:10,435 INFO L93 Difference]: Finished difference Result 296 states and 415 transitions. [2025-02-05 20:09:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:09:10,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-02-05 20:09:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:10,437 INFO L225 Difference]: With dead ends: 296 [2025-02-05 20:09:10,437 INFO L226 Difference]: Without dead ends: 188 [2025-02-05 20:09:10,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-05 20:09:10,437 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 238 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:10,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 530 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:09:10,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-05 20:09:10,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 166. [2025-02-05 20:09:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.4242424242424243) internal successors, (235), 165 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 235 transitions. [2025-02-05 20:09:10,445 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 235 transitions. Word has length 47 [2025-02-05 20:09:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:10,445 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 235 transitions. [2025-02-05 20:09:10,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 235 transitions. [2025-02-05 20:09:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 20:09:10,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:10,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:10,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:09:10,449 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:10,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:10,449 INFO L85 PathProgramCache]: Analyzing trace with hash -767472048, now seen corresponding path program 1 times [2025-02-05 20:09:10,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:10,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060563622] [2025-02-05 20:09:10,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:10,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:10,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 20:09:10,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 20:09:10,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:10,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:11,212 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-05 20:09:11,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:11,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060563622] [2025-02-05 20:09:11,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060563622] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:11,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912673550] [2025-02-05 20:09:11,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:11,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:11,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:11,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:09:11,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:09:11,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 20:09:11,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 20:09:11,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:11,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:11,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-05 20:09:11,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:11,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:09:11,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912673550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:11,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:09:11,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-02-05 20:09:11,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509789074] [2025-02-05 20:09:11,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:11,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:09:11,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:11,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:09:11,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:11,899 INFO L87 Difference]: Start difference. First operand 166 states and 235 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:12,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:12,304 INFO L93 Difference]: Finished difference Result 287 states and 401 transitions. [2025-02-05 20:09:12,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:09:12,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-02-05 20:09:12,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:12,307 INFO L225 Difference]: With dead ends: 287 [2025-02-05 20:09:12,308 INFO L226 Difference]: Without dead ends: 179 [2025-02-05 20:09:12,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:09:12,309 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 196 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:12,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 144 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:09:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-05 20:09:12,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2025-02-05 20:09:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.3954802259887005) internal successors, (247), 177 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 247 transitions. [2025-02-05 20:09:12,316 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 247 transitions. Word has length 89 [2025-02-05 20:09:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:12,316 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 247 transitions. [2025-02-05 20:09:12,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 247 transitions. [2025-02-05 20:09:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 20:09:12,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:12,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:12,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 20:09:12,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:12,522 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:12,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:12,523 INFO L85 PathProgramCache]: Analyzing trace with hash -652531976, now seen corresponding path program 1 times [2025-02-05 20:09:12,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:12,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66134150] [2025-02-05 20:09:12,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:12,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:12,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 20:09:12,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 20:09:12,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:12,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:13,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:13,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66134150] [2025-02-05 20:09:13,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66134150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:13,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:13,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:13,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884353582] [2025-02-05 20:09:13,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:13,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:13,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:13,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:13,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:13,379 INFO L87 Difference]: Start difference. First operand 178 states and 247 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:13,709 INFO L93 Difference]: Finished difference Result 340 states and 478 transitions. [2025-02-05 20:09:13,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:09:13,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-02-05 20:09:13,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:13,713 INFO L225 Difference]: With dead ends: 340 [2025-02-05 20:09:13,713 INFO L226 Difference]: Without dead ends: 232 [2025-02-05 20:09:13,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:09:13,714 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 401 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:13,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 330 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:09:13,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-05 20:09:13,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 209. [2025-02-05 20:09:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.4038461538461537) internal successors, (292), 208 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 292 transitions. [2025-02-05 20:09:13,718 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 292 transitions. Word has length 91 [2025-02-05 20:09:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:13,718 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 292 transitions. [2025-02-05 20:09:13,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 292 transitions. [2025-02-05 20:09:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 20:09:13,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:13,723 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:13,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:09:13,723 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:13,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:13,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1435793342, now seen corresponding path program 1 times [2025-02-05 20:09:13,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:13,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319373253] [2025-02-05 20:09:13,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:13,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:13,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 20:09:14,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 20:09:14,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:14,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:14,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:14,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319373253] [2025-02-05 20:09:14,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319373253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:14,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:14,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:14,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211138464] [2025-02-05 20:09:14,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:14,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:14,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:14,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:14,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:14,523 INFO L87 Difference]: Start difference. First operand 209 states and 292 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:14,782 INFO L93 Difference]: Finished difference Result 342 states and 479 transitions. [2025-02-05 20:09:14,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:09:14,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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-05 20:09:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:14,785 INFO L225 Difference]: With dead ends: 342 [2025-02-05 20:09:14,785 INFO L226 Difference]: Without dead ends: 216 [2025-02-05 20:09:14,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:09:14,786 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 346 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:14,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 340 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:09:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-05 20:09:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 209. [2025-02-05 20:09:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.3990384615384615) internal successors, (291), 208 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 291 transitions. [2025-02-05 20:09:14,795 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 291 transitions. Word has length 92 [2025-02-05 20:09:14,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:14,795 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 291 transitions. [2025-02-05 20:09:14,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 291 transitions. [2025-02-05 20:09:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 20:09:14,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:14,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:14,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 20:09:14,796 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:14,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:14,796 INFO L85 PathProgramCache]: Analyzing trace with hash -864408719, now seen corresponding path program 1 times [2025-02-05 20:09:14,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:14,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768913949] [2025-02-05 20:09:14,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:14,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:14,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 20:09:14,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 20:09:14,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:14,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:16,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:16,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768913949] [2025-02-05 20:09:16,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768913949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:16,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:16,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:09:16,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78693091] [2025-02-05 20:09:16,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:16,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:09:16,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:16,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:09:16,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:16,128 INFO L87 Difference]: Start difference. First operand 209 states and 291 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:16,705 INFO L93 Difference]: Finished difference Result 343 states and 479 transitions. [2025-02-05 20:09:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:09:16,705 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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-05 20:09:16,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:16,706 INFO L225 Difference]: With dead ends: 343 [2025-02-05 20:09:16,706 INFO L226 Difference]: Without dead ends: 213 [2025-02-05 20:09:16,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-02-05 20:09:16,708 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 211 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:16,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 612 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:09:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-05 20:09:16,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2025-02-05 20:09:16,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.3952380952380952) internal successors, (293), 210 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 293 transitions. [2025-02-05 20:09:16,714 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 293 transitions. Word has length 93 [2025-02-05 20:09:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:16,714 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 293 transitions. [2025-02-05 20:09:16,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 293 transitions. [2025-02-05 20:09:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 20:09:16,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:16,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:16,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:09:16,716 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:16,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1635634723, now seen corresponding path program 1 times [2025-02-05 20:09:16,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:16,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249628812] [2025-02-05 20:09:16,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:16,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:16,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 20:09:16,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 20:09:16,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:16,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:17,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:17,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249628812] [2025-02-05 20:09:17,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249628812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:17,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:17,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:09:17,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449506112] [2025-02-05 20:09:17,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:17,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:09:17,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:17,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:09:17,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:17,432 INFO L87 Difference]: Start difference. First operand 211 states and 293 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:18,241 INFO L93 Difference]: Finished difference Result 477 states and 671 transitions. [2025-02-05 20:09:18,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:09:18,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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-05 20:09:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:18,243 INFO L225 Difference]: With dead ends: 477 [2025-02-05 20:09:18,243 INFO L226 Difference]: Without dead ends: 369 [2025-02-05 20:09:18,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:09:18,244 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 311 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:18,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 577 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:09:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-02-05 20:09:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 289. [2025-02-05 20:09:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.4131944444444444) internal successors, (407), 288 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2025-02-05 20:09:18,253 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 94 [2025-02-05 20:09:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:18,253 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2025-02-05 20:09:18,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2025-02-05 20:09:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 20:09:18,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:18,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:18,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:09:18,256 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:18,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:18,257 INFO L85 PathProgramCache]: Analyzing trace with hash -389310734, now seen corresponding path program 1 times [2025-02-05 20:09:18,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:18,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402150599] [2025-02-05 20:09:18,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:18,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:18,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 20:09:18,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 20:09:18,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:18,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:19,218 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-05 20:09:19,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:19,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402150599] [2025-02-05 20:09:19,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402150599] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:19,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988344258] [2025-02-05 20:09:19,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:19,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:19,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:19,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:09:19,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 20:09:19,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 20:09:19,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 20:09:19,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:19,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:19,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-05 20:09:19,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:19,994 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-05 20:09:19,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:20,416 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-05 20:09:20,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988344258] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:20,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:20,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2025-02-05 20:09:20,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106578934] [2025-02-05 20:09:20,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:20,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:09:20,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:20,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:09:20,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:09:20,419 INFO L87 Difference]: Start difference. First operand 289 states and 407 transitions. Second operand has 20 states, 20 states have (on average 11.45) internal successors, (229), 20 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:21,237 INFO L93 Difference]: Finished difference Result 540 states and 760 transitions. [2025-02-05 20:09:21,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:09:21,237 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.45) internal successors, (229), 20 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 20:09:21,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:21,239 INFO L225 Difference]: With dead ends: 540 [2025-02-05 20:09:21,239 INFO L226 Difference]: Without dead ends: 326 [2025-02-05 20:09:21,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-02-05 20:09:21,239 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 403 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:21,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 543 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:09:21,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-05 20:09:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 296. [2025-02-05 20:09:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.4135593220338982) internal successors, (417), 295 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 417 transitions. [2025-02-05 20:09:21,249 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 417 transitions. Word has length 95 [2025-02-05 20:09:21,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:21,249 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 417 transitions. [2025-02-05 20:09:21,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.45) internal successors, (229), 20 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 417 transitions. [2025-02-05 20:09:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 20:09:21,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:21,250 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:21,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 20:09:21,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:21,455 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:21,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:21,456 INFO L85 PathProgramCache]: Analyzing trace with hash -937704462, now seen corresponding path program 1 times [2025-02-05 20:09:21,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:21,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869984953] [2025-02-05 20:09:21,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:21,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 20:09:21,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 20:09:21,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:21,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:22,237 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-05 20:09:22,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:22,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869984953] [2025-02-05 20:09:22,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869984953] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:22,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771150830] [2025-02-05 20:09:22,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:22,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:22,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:22,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:09:22,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 20:09:22,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 20:09:22,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 20:09:22,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:22,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:22,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-05 20:09:22,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:22,972 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-05 20:09:22,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:23,347 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-05 20:09:23,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771150830] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:23,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:23,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2025-02-05 20:09:23,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060310682] [2025-02-05 20:09:23,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:23,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 20:09:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:23,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 20:09:23,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-02-05 20:09:23,349 INFO L87 Difference]: Start difference. First operand 296 states and 417 transitions. Second operand has 17 states, 17 states have (on average 13.823529411764707) internal successors, (235), 17 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:23,967 INFO L93 Difference]: Finished difference Result 487 states and 686 transitions. [2025-02-05 20:09:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:09:23,968 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.823529411764707) internal successors, (235), 17 states have internal predecessors, (235), 0 states have call successors, (0), 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 97 [2025-02-05 20:09:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:23,969 INFO L225 Difference]: With dead ends: 487 [2025-02-05 20:09:23,969 INFO L226 Difference]: Without dead ends: 324 [2025-02-05 20:09:23,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:09:23,971 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 679 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:23,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 410 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:09:23,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-02-05 20:09:23,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 298. [2025-02-05 20:09:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4107744107744107) internal successors, (419), 297 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 419 transitions. [2025-02-05 20:09:23,976 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 419 transitions. Word has length 97 [2025-02-05 20:09:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:23,977 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 419 transitions. [2025-02-05 20:09:23,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.823529411764707) internal successors, (235), 17 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 419 transitions. [2025-02-05 20:09:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 20:09:23,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:23,978 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:23,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 20:09:24,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:24,179 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:24,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1605598907, now seen corresponding path program 1 times [2025-02-05 20:09:24,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:24,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726505262] [2025-02-05 20:09:24,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:24,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:24,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 20:09:24,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 20:09:24,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:24,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:25,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:25,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726505262] [2025-02-05 20:09:25,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726505262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:25,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:25,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:09:25,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461644387] [2025-02-05 20:09:25,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:25,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:09:25,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:25,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:09:25,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:25,292 INFO L87 Difference]: Start difference. First operand 298 states and 419 transitions. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:25,868 INFO L93 Difference]: Finished difference Result 794 states and 1131 transitions. [2025-02-05 20:09:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 20:09:25,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-02-05 20:09:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:25,870 INFO L225 Difference]: With dead ends: 794 [2025-02-05 20:09:25,870 INFO L226 Difference]: Without dead ends: 631 [2025-02-05 20:09:25,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:09:25,871 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 311 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:25,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 472 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:09:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-02-05 20:09:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 478. [2025-02-05 20:09:25,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.4129979035639413) internal successors, (674), 477 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 674 transitions. [2025-02-05 20:09:25,880 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 674 transitions. Word has length 140 [2025-02-05 20:09:25,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:25,880 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 674 transitions. [2025-02-05 20:09:25,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:25,880 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 674 transitions. [2025-02-05 20:09:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 20:09:25,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:25,881 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:25,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 20:09:25,882 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:25,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:25,882 INFO L85 PathProgramCache]: Analyzing trace with hash 994545551, now seen corresponding path program 1 times [2025-02-05 20:09:25,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:25,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026084408] [2025-02-05 20:09:25,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:25,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:25,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 20:09:26,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 20:09:26,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:26,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 20:09:27,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:27,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026084408] [2025-02-05 20:09:27,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026084408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:27,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:27,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:27,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124827729] [2025-02-05 20:09:27,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:27,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:27,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:27,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:27,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:27,223 INFO L87 Difference]: Start difference. First operand 478 states and 674 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 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-05 20:09:27,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:27,532 INFO L93 Difference]: Finished difference Result 813 states and 1149 transitions. [2025-02-05 20:09:27,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:09:27,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 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 141 [2025-02-05 20:09:27,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:27,536 INFO L225 Difference]: With dead ends: 813 [2025-02-05 20:09:27,536 INFO L226 Difference]: Without dead ends: 467 [2025-02-05 20:09:27,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:09:27,538 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 326 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:27,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 147 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:09:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-02-05 20:09:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2025-02-05 20:09:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 1.409871244635193) internal successors, (657), 466 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 657 transitions. [2025-02-05 20:09:27,548 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 657 transitions. Word has length 141 [2025-02-05 20:09:27,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:27,548 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 657 transitions. [2025-02-05 20:09:27,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 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-05 20:09:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 657 transitions. [2025-02-05 20:09:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 20:09:27,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:27,549 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:27,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 20:09:27,550 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:27,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash -608280403, now seen corresponding path program 1 times [2025-02-05 20:09:27,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:27,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855744590] [2025-02-05 20:09:27,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:27,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:27,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 20:09:27,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 20:09:27,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:27,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:28,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:28,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855744590] [2025-02-05 20:09:28,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855744590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:28,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:28,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:09:28,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567286210] [2025-02-05 20:09:28,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:28,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:09:28,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:28,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:09:28,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:09:28,670 INFO L87 Difference]: Start difference. First operand 467 states and 657 transitions. Second operand has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:29,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:29,101 INFO L93 Difference]: Finished difference Result 1085 states and 1520 transitions. [2025-02-05 20:09:29,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:09:29,102 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-02-05 20:09:29,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:29,104 INFO L225 Difference]: With dead ends: 1085 [2025-02-05 20:09:29,104 INFO L226 Difference]: Without dead ends: 769 [2025-02-05 20:09:29,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:29,105 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 324 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:29,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 415 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:09:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-02-05 20:09:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 541. [2025-02-05 20:09:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 1.3833333333333333) internal successors, (747), 540 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 747 transitions. [2025-02-05 20:09:29,114 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 747 transitions. Word has length 141 [2025-02-05 20:09:29,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:29,114 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 747 transitions. [2025-02-05 20:09:29,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:29,115 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 747 transitions. [2025-02-05 20:09:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 20:09:29,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:29,116 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:29,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 20:09:29,116 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:29,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:29,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1697727533, now seen corresponding path program 1 times [2025-02-05 20:09:29,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:29,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098875712] [2025-02-05 20:09:29,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:29,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:29,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 20:09:29,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 20:09:29,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:29,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:30,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:30,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098875712] [2025-02-05 20:09:30,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098875712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:30,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:30,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 20:09:30,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648280741] [2025-02-05 20:09:30,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:30,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 20:09:30,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:30,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 20:09:30,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:09:30,382 INFO L87 Difference]: Start difference. First operand 541 states and 747 transitions. Second operand has 11 states, 11 states have (on average 12.909090909090908) internal successors, (142), 11 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:31,098 INFO L93 Difference]: Finished difference Result 1368 states and 1892 transitions. [2025-02-05 20:09:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:09:31,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.909090909090908) internal successors, (142), 11 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-02-05 20:09:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:31,101 INFO L225 Difference]: With dead ends: 1368 [2025-02-05 20:09:31,101 INFO L226 Difference]: Without dead ends: 988 [2025-02-05 20:09:31,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:09:31,102 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 296 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:31,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 572 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:09:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2025-02-05 20:09:31,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 904. [2025-02-05 20:09:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 1.3732004429678848) internal successors, (1240), 903 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1240 transitions. [2025-02-05 20:09:31,115 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1240 transitions. Word has length 142 [2025-02-05 20:09:31,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:31,115 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1240 transitions. [2025-02-05 20:09:31,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.909090909090908) internal successors, (142), 11 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:31,115 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1240 transitions. [2025-02-05 20:09:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 20:09:31,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:31,117 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:31,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 20:09:31,117 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:31,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:31,117 INFO L85 PathProgramCache]: Analyzing trace with hash 2061140769, now seen corresponding path program 1 times [2025-02-05 20:09:31,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:31,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533757843] [2025-02-05 20:09:31,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:31,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:31,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 20:09:31,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 20:09:31,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:31,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:31,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:31,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533757843] [2025-02-05 20:09:31,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533757843] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:31,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142953532] [2025-02-05 20:09:31,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:31,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:31,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:31,996 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:09:32,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 20:09:32,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 20:09:32,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 20:09:32,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:32,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:32,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 1469 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-05 20:09:32,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:32,883 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:32,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:33,721 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 60 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:33,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142953532] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:33,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:33,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 14] total 25 [2025-02-05 20:09:33,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352723387] [2025-02-05 20:09:33,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:33,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 20:09:33,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:33,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 20:09:33,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-02-05 20:09:33,725 INFO L87 Difference]: Start difference. First operand 904 states and 1240 transitions. Second operand has 25 states, 25 states have (on average 14.92) internal successors, (373), 25 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:35,137 INFO L93 Difference]: Finished difference Result 2034 states and 2792 transitions. [2025-02-05 20:09:35,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 20:09:35,137 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 14.92) internal successors, (373), 25 states have internal predecessors, (373), 0 states have call successors, (0), 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 142 [2025-02-05 20:09:35,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:35,142 INFO L225 Difference]: With dead ends: 2034 [2025-02-05 20:09:35,144 INFO L226 Difference]: Without dead ends: 1354 [2025-02-05 20:09:35,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 20:09:35,147 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 553 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 2897 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:35,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 812 Invalid, 2902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2897 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 20:09:35,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-02-05 20:09:35,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1020. [2025-02-05 20:09:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 1.3581943081452403) internal successors, (1384), 1019 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1384 transitions. [2025-02-05 20:09:35,166 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1384 transitions. Word has length 142 [2025-02-05 20:09:35,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:35,167 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1384 transitions. [2025-02-05 20:09:35,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 14.92) internal successors, (373), 25 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:35,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1384 transitions. [2025-02-05 20:09:35,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 20:09:35,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:35,169 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:35,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 20:09:35,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:35,373 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:35,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1052969421, now seen corresponding path program 1 times [2025-02-05 20:09:35,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:35,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639008590] [2025-02-05 20:09:35,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:35,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:35,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 20:09:35,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 20:09:35,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:35,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:36,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:36,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639008590] [2025-02-05 20:09:36,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639008590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:36,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:36,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:09:36,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719293709] [2025-02-05 20:09:36,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:36,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:09:36,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:36,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:09:36,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:09:36,764 INFO L87 Difference]: Start difference. First operand 1020 states and 1384 transitions. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:37,280 INFO L93 Difference]: Finished difference Result 2178 states and 2979 transitions. [2025-02-05 20:09:37,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:09:37,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-02-05 20:09:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:37,284 INFO L225 Difference]: With dead ends: 2178 [2025-02-05 20:09:37,284 INFO L226 Difference]: Without dead ends: 1392 [2025-02-05 20:09:37,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:37,285 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 251 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:37,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 404 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:09:37,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-02-05 20:09:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 884. [2025-02-05 20:09:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 1.3816534541336354) internal successors, (1220), 883 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1220 transitions. [2025-02-05 20:09:37,301 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1220 transitions. Word has length 143 [2025-02-05 20:09:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:37,301 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1220 transitions. [2025-02-05 20:09:37,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1220 transitions. [2025-02-05 20:09:37,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 20:09:37,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:37,303 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:37,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 20:09:37,304 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:37,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:37,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1917823531, now seen corresponding path program 1 times [2025-02-05 20:09:37,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:37,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101424785] [2025-02-05 20:09:37,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:37,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:37,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 20:09:38,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 20:09:38,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:38,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:39,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:39,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101424785] [2025-02-05 20:09:39,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101424785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:39,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:39,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 20:09:39,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882555541] [2025-02-05 20:09:39,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:39,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:09:39,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:39,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:09:39,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:09:39,601 INFO L87 Difference]: Start difference. First operand 884 states and 1220 transitions. Second operand has 12 states, 12 states have (on average 11.916666666666666) internal successors, (143), 12 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:40,166 INFO L93 Difference]: Finished difference Result 1764 states and 2430 transitions. [2025-02-05 20:09:40,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:09:40,167 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.916666666666666) internal successors, (143), 12 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-02-05 20:09:40,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:40,169 INFO L225 Difference]: With dead ends: 1764 [2025-02-05 20:09:40,169 INFO L226 Difference]: Without dead ends: 1094 [2025-02-05 20:09:40,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-02-05 20:09:40,173 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 276 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:40,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 593 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:09:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2025-02-05 20:09:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1002. [2025-02-05 20:09:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 1001 states have (on average 1.3646353646353646) internal successors, (1366), 1001 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1366 transitions. [2025-02-05 20:09:40,190 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1366 transitions. Word has length 143 [2025-02-05 20:09:40,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:40,190 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1366 transitions. [2025-02-05 20:09:40,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.916666666666666) internal successors, (143), 12 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1366 transitions. [2025-02-05 20:09:40,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 20:09:40,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:40,192 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:40,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 20:09:40,192 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:40,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:40,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1712773112, now seen corresponding path program 1 times [2025-02-05 20:09:40,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:40,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15621440] [2025-02-05 20:09:40,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:40,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:40,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 20:09:40,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 20:09:40,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:40,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 20:09:41,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:41,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15621440] [2025-02-05 20:09:41,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15621440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:41,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:41,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:09:41,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922973187] [2025-02-05 20:09:41,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:41,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:09:41,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:41,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:09:41,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:09:41,276 INFO L87 Difference]: Start difference. First operand 1002 states and 1366 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:41,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:41,378 INFO L93 Difference]: Finished difference Result 1616 states and 2211 transitions. [2025-02-05 20:09:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:09:41,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-05 20:09:41,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:41,380 INFO L225 Difference]: With dead ends: 1616 [2025-02-05 20:09:41,380 INFO L226 Difference]: Without dead ends: 790 [2025-02-05 20:09:41,381 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-05 20:09:41,381 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 217 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:41,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 474 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:41,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-02-05 20:09:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2025-02-05 20:09:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.3713561470215463) internal successors, (1082), 789 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1082 transitions. [2025-02-05 20:09:41,394 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1082 transitions. Word has length 143 [2025-02-05 20:09:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:41,394 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1082 transitions. [2025-02-05 20:09:41,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:41,395 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1082 transitions. [2025-02-05 20:09:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:09:41,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:41,396 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:41,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 20:09:41,396 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:41,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:41,397 INFO L85 PathProgramCache]: Analyzing trace with hash 889808757, now seen corresponding path program 1 times [2025-02-05 20:09:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:41,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757046645] [2025-02-05 20:09:41,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:41,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:41,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:09:42,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:09:42,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:42,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:43,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:43,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757046645] [2025-02-05 20:09:43,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757046645] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:43,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109170338] [2025-02-05 20:09:43,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:43,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:43,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:43,943 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:09:43,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 20:09:44,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:09:44,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:09:44,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:44,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:44,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 1473 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-02-05 20:09:44,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:45,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 65 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:46,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109170338] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:46,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:46,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 34 [2025-02-05 20:09:46,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978877163] [2025-02-05 20:09:46,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:46,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 20:09:46,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:46,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 20:09:46,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 20:09:46,918 INFO L87 Difference]: Start difference. First operand 790 states and 1082 transitions. Second operand has 34 states, 34 states have (on average 11.5) internal successors, (391), 34 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:50,824 INFO L93 Difference]: Finished difference Result 3934 states and 5496 transitions. [2025-02-05 20:09:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-02-05 20:09:50,825 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 11.5) internal successors, (391), 34 states have internal predecessors, (391), 0 states have call successors, (0), 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 144 [2025-02-05 20:09:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:50,833 INFO L225 Difference]: With dead ends: 3934 [2025-02-05 20:09:50,833 INFO L226 Difference]: Without dead ends: 3340 [2025-02-05 20:09:50,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2202 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=921, Invalid=7635, Unknown=0, NotChecked=0, Total=8556 [2025-02-05 20:09:50,837 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 814 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 5721 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 5733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:50,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 1497 Invalid, 5733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 5721 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 20:09:50,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3340 states. [2025-02-05 20:09:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3340 to 1706. [2025-02-05 20:09:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 1.3718475073313783) internal successors, (2339), 1705 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2339 transitions. [2025-02-05 20:09:50,870 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2339 transitions. Word has length 144 [2025-02-05 20:09:50,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:50,870 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 2339 transitions. [2025-02-05 20:09:50,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 11.5) internal successors, (391), 34 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2339 transitions. [2025-02-05 20:09:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:09:50,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:50,874 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:50,887 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-05 20:09:51,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-05 20:09:51,078 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:51,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2101533979, now seen corresponding path program 1 times [2025-02-05 20:09:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:51,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533309360] [2025-02-05 20:09:51,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:51,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:51,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:09:52,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:09:52,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:52,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 55 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:53,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:53,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533309360] [2025-02-05 20:09:53,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533309360] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:09:53,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850197799] [2025-02-05 20:09:53,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:53,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:09:53,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:53,158 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:09:53,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 20:09:53,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:09:54,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:09:54,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:54,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:54,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 1473 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-02-05 20:09:54,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 52 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:54,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 52 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:55,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850197799] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:55,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:55,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 14] total 40 [2025-02-05 20:09:55,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401078671] [2025-02-05 20:09:55,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:55,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-05 20:09:55,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:55,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-05 20:09:55,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1372, Unknown=0, NotChecked=0, Total=1560 [2025-02-05 20:09:55,182 INFO L87 Difference]: Start difference. First operand 1706 states and 2339 transitions. Second operand has 40 states, 40 states have (on average 9.675) internal successors, (387), 40 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:57,494 INFO L93 Difference]: Finished difference Result 5787 states and 7964 transitions. [2025-02-05 20:09:57,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-05 20:09:57,495 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 9.675) internal successors, (387), 40 states have internal predecessors, (387), 0 states have call successors, (0), 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 144 [2025-02-05 20:09:57,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:57,503 INFO L225 Difference]: With dead ends: 5787 [2025-02-05 20:09:57,504 INFO L226 Difference]: Without dead ends: 4021 [2025-02-05 20:09:57,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=736, Invalid=4964, Unknown=0, NotChecked=0, Total=5700 [2025-02-05 20:09:57,507 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1715 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 3801 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 3813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:57,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 1293 Invalid, 3813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3801 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 20:09:57,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4021 states. [2025-02-05 20:09:57,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4021 to 2789. [2025-02-05 20:09:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2788 states have (on average 1.387374461979914) internal successors, (3868), 2788 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3868 transitions. [2025-02-05 20:09:57,544 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3868 transitions. Word has length 144 [2025-02-05 20:09:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:57,544 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 3868 transitions. [2025-02-05 20:09:57,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 9.675) internal successors, (387), 40 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3868 transitions. [2025-02-05 20:09:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 20:09:57,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:57,548 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:57,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 20:09:57,752 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,SelfDestructingSolverStorable24 [2025-02-05 20:09:57,752 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:57,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:57,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1065281612, now seen corresponding path program 1 times [2025-02-05 20:09:57,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:57,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133449209] [2025-02-05 20:09:57,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:57,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:57,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:09:58,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:09:58,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:58,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:01,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:01,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133449209] [2025-02-05 20:10:01,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133449209] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:10:01,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594781207] [2025-02-05 20:10:01,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:01,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:10:01,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:01,033 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:10:01,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 20:10:01,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:10:01,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:10:01,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:01,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:01,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-02-05 20:10:01,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:10:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 43 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:02,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:10:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:03,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594781207] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:10:03,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:10:03,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 15] total 44 [2025-02-05 20:10:03,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392198001] [2025-02-05 20:10:03,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:10:03,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-05 20:10:03,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:03,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-05 20:10:03,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1639, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 20:10:03,798 INFO L87 Difference]: Start difference. First operand 2789 states and 3868 transitions. Second operand has 44 states, 44 states have (on average 9.090909090909092) internal successors, (400), 44 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:07,052 INFO L93 Difference]: Finished difference Result 6685 states and 9276 transitions. [2025-02-05 20:10:07,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-02-05 20:10:07,053 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 9.090909090909092) internal successors, (400), 44 states have internal predecessors, (400), 0 states have call successors, (0), 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 145 [2025-02-05 20:10:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:07,060 INFO L225 Difference]: With dead ends: 6685 [2025-02-05 20:10:07,060 INFO L226 Difference]: Without dead ends: 3291 [2025-02-05 20:10:07,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=983, Invalid=7207, Unknown=0, NotChecked=0, Total=8190 [2025-02-05 20:10:07,065 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 839 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 6383 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 6400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 6383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:07,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1605 Invalid, 6400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 6383 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 20:10:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3291 states. [2025-02-05 20:10:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3291 to 1444. [2025-02-05 20:10:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.3672903672903673) internal successors, (1973), 1443 states have internal predecessors, (1973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1973 transitions. [2025-02-05 20:10:07,085 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1973 transitions. Word has length 145 [2025-02-05 20:10:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:07,085 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1973 transitions. [2025-02-05 20:10:07,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 9.090909090909092) internal successors, (400), 44 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1973 transitions. [2025-02-05 20:10:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 20:10:07,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:07,087 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:07,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 20:10:07,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:10:07,289 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:07,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:07,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1534437604, now seen corresponding path program 1 times [2025-02-05 20:10:07,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:07,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087142241] [2025-02-05 20:10:07,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:07,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:07,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:10:08,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:10:08,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:08,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 20:10:09,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:09,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087142241] [2025-02-05 20:10:09,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087142241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:09,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:09,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:10:09,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897939821] [2025-02-05 20:10:09,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:09,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:10:09,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:09,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:10:09,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:10:09,980 INFO L87 Difference]: Start difference. First operand 1444 states and 1973 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 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-05 20:10:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:10,247 INFO L93 Difference]: Finished difference Result 2582 states and 3532 transitions. [2025-02-05 20:10:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:10:10,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 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 146 [2025-02-05 20:10:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:10,251 INFO L225 Difference]: With dead ends: 2582 [2025-02-05 20:10:10,251 INFO L226 Difference]: Without dead ends: 1293 [2025-02-05 20:10:10,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-05 20:10:10,252 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 202 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:10,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 156 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:10:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2025-02-05 20:10:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1283. [2025-02-05 20:10:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1282 states have (on average 1.3689547581903276) internal successors, (1755), 1282 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1755 transitions. [2025-02-05 20:10:10,265 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1755 transitions. Word has length 146 [2025-02-05 20:10:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:10,265 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1755 transitions. [2025-02-05 20:10:10,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 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-05 20:10:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1755 transitions. [2025-02-05 20:10:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 20:10:10,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:10,266 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:10,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 20:10:10,267 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:10,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash 467280859, now seen corresponding path program 1 times [2025-02-05 20:10:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:10,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566180193] [2025-02-05 20:10:10,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:10,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:10,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:10:10,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:10:10,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:10,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 53 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:11,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:11,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566180193] [2025-02-05 20:10:11,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566180193] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:10:11,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654828459] [2025-02-05 20:10:11,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:11,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:10:11,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:11,858 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:10:11,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 20:10:12,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:10:12,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:10:12,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:12,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:12,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-05 20:10:12,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:10:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:13,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:10:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 37 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:13,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654828459] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:10:13,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:10:13,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 38 [2025-02-05 20:10:13,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866467760] [2025-02-05 20:10:13,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:10:13,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-05 20:10:13,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:13,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-05 20:10:13,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 20:10:13,733 INFO L87 Difference]: Start difference. First operand 1283 states and 1755 transitions. Second operand has 38 states, 38 states have (on average 10.026315789473685) internal successors, (381), 38 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:15,657 INFO L93 Difference]: Finished difference Result 5300 states and 7209 transitions. [2025-02-05 20:10:15,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-05 20:10:15,658 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 10.026315789473685) internal successors, (381), 38 states have internal predecessors, (381), 0 states have call successors, (0), 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 146 [2025-02-05 20:10:15,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:15,667 INFO L225 Difference]: With dead ends: 5300 [2025-02-05 20:10:15,667 INFO L226 Difference]: Without dead ends: 4162 [2025-02-05 20:10:15,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=743, Invalid=4957, Unknown=0, NotChecked=0, Total=5700 [2025-02-05 20:10:15,671 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 1621 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 3667 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1621 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 3680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:15,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1621 Valid, 1366 Invalid, 3680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3667 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 20:10:15,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states. [2025-02-05 20:10:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 3069. [2025-02-05 20:10:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3069 states, 3068 states have (on average 1.384941329856584) internal successors, (4249), 3068 states have internal predecessors, (4249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 4249 transitions. [2025-02-05 20:10:15,711 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 4249 transitions. Word has length 146 [2025-02-05 20:10:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:15,712 INFO L471 AbstractCegarLoop]: Abstraction has 3069 states and 4249 transitions. [2025-02-05 20:10:15,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 10.026315789473685) internal successors, (381), 38 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 4249 transitions. [2025-02-05 20:10:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 20:10:15,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:15,714 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:15,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 20:10:15,918 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,SelfDestructingSolverStorable27 [2025-02-05 20:10:15,918 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:15,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:15,918 INFO L85 PathProgramCache]: Analyzing trace with hash 696455776, now seen corresponding path program 1 times [2025-02-05 20:10:15,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:15,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778043469] [2025-02-05 20:10:15,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:15,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:15,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 20:10:16,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 20:10:16,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:16,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:16,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:16,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778043469] [2025-02-05 20:10:16,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778043469] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:10:16,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477557604] [2025-02-05 20:10:16,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:16,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:10:16,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:16,984 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:10:16,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 20:10:17,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 20:10:17,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 20:10:17,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:17,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:17,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 1478 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-05 20:10:17,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:10:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 37 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:18,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:10:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 74 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:18,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477557604] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:10:18,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:10:18,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2025-02-05 20:10:18,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226788405] [2025-02-05 20:10:18,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:10:18,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 20:10:18,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:18,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 20:10:18,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:10:18,559 INFO L87 Difference]: Start difference. First operand 3069 states and 4249 transitions. Second operand has 21 states, 21 states have (on average 16.80952380952381) internal successors, (353), 21 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:19,841 INFO L93 Difference]: Finished difference Result 10728 states and 14899 transitions. [2025-02-05 20:10:19,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-02-05 20:10:19,842 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 16.80952380952381) internal successors, (353), 21 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2025-02-05 20:10:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:19,860 INFO L225 Difference]: With dead ends: 10728 [2025-02-05 20:10:19,860 INFO L226 Difference]: Without dead ends: 7762 [2025-02-05 20:10:19,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=415, Invalid=2035, Unknown=0, NotChecked=0, Total=2450 [2025-02-05 20:10:19,867 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 717 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 2759 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:19,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 879 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2759 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 20:10:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2025-02-05 20:10:19,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6291. [2025-02-05 20:10:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6291 states, 6290 states have (on average 1.3766295707472178) internal successors, (8659), 6290 states have internal predecessors, (8659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6291 states to 6291 states and 8659 transitions. [2025-02-05 20:10:19,938 INFO L78 Accepts]: Start accepts. Automaton has 6291 states and 8659 transitions. Word has length 147 [2025-02-05 20:10:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:19,939 INFO L471 AbstractCegarLoop]: Abstraction has 6291 states and 8659 transitions. [2025-02-05 20:10:19,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 16.80952380952381) internal successors, (353), 21 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 6291 states and 8659 transitions. [2025-02-05 20:10:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 20:10:19,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:19,942 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:19,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 20:10:20,142 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,SelfDestructingSolverStorable28 [2025-02-05 20:10:20,142 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:20,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:20,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1851248097, now seen corresponding path program 1 times [2025-02-05 20:10:20,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:20,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402945405] [2025-02-05 20:10:20,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:20,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:20,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 20:10:20,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 20:10:20,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:20,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 20:10:21,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:21,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402945405] [2025-02-05 20:10:21,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402945405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:21,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:21,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:10:21,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823426144] [2025-02-05 20:10:21,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:21,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:10:21,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:21,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:10:21,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:10:21,075 INFO L87 Difference]: Start difference. First operand 6291 states and 8659 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:21,478 INFO L93 Difference]: Finished difference Result 12481 states and 17181 transitions. [2025-02-05 20:10:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:10:21,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-02-05 20:10:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:21,486 INFO L225 Difference]: With dead ends: 12481 [2025-02-05 20:10:21,486 INFO L226 Difference]: Without dead ends: 6293 [2025-02-05 20:10:21,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:10:21,493 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 248 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:21,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 159 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:10:21,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6293 states. [2025-02-05 20:10:21,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6293 to 6293. [2025-02-05 20:10:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6293 states, 6292 states have (on average 1.376509853782581) internal successors, (8661), 6292 states have internal predecessors, (8661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6293 states to 6293 states and 8661 transitions. [2025-02-05 20:10:21,554 INFO L78 Accepts]: Start accepts. Automaton has 6293 states and 8661 transitions. Word has length 148 [2025-02-05 20:10:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:21,554 INFO L471 AbstractCegarLoop]: Abstraction has 6293 states and 8661 transitions. [2025-02-05 20:10:21,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 6293 states and 8661 transitions. [2025-02-05 20:10:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 20:10:21,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:21,558 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:21,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 20:10:21,558 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:21,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2041239474, now seen corresponding path program 1 times [2025-02-05 20:10:21,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:21,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716207325] [2025-02-05 20:10:21,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:21,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:21,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 20:10:22,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 20:10:22,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:22,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 171 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 20:10:22,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:22,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716207325] [2025-02-05 20:10:22,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716207325] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:10:22,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417629139] [2025-02-05 20:10:22,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:22,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:10:22,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:22,999 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:10:23,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 20:10:23,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 20:10:23,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 20:10:23,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:23,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:23,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 2085 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-02-05 20:10:23,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:10:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 147 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 20:10:24,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:10:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 154 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 20:10:25,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417629139] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:10:25,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:10:25,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 27 [2025-02-05 20:10:25,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377624452] [2025-02-05 20:10:25,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:10:25,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 20:10:25,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:25,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 20:10:25,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-02-05 20:10:25,354 INFO L87 Difference]: Start difference. First operand 6293 states and 8661 transitions. Second operand has 27 states, 27 states have (on average 18.14814814814815) internal successors, (490), 27 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:29,525 INFO L93 Difference]: Finished difference Result 42679 states and 59739 transitions. [2025-02-05 20:10:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-02-05 20:10:29,526 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 18.14814814814815) internal successors, (490), 27 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2025-02-05 20:10:29,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:29,572 INFO L225 Difference]: With dead ends: 42679 [2025-02-05 20:10:29,573 INFO L226 Difference]: Without dead ends: 36491 [2025-02-05 20:10:29,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3135 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1045, Invalid=9257, Unknown=0, NotChecked=0, Total=10302 [2025-02-05 20:10:29,590 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1638 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 7237 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 7256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 7237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:29,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 2256 Invalid, 7256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 7237 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 20:10:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36491 states.