./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/nla-digbench-scaling/hard2_unwindbound5.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f094e7ea34d2025ab25ab51a4a0b06d8f845826c76dbd06e91f3d4a761fa19b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:20:58,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:20:58,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:20:58,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:20:58,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:20:58,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:20:58,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:20:58,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:20:58,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:20:58,395 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:20:58,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:20:58,395 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:20:58,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:20:58,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:20:58,395 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:20:58,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:20:58,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:20:58,396 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:20:58,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:20:58,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:20:58,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:20:58,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:20:58,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:20:58,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:20:58,396 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:20:58,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:20:58,397 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:20:58,397 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:20:58,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:20:58,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:20:58,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:20:58,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:20:58,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:20:58,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:20:58,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:20:58,397 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:20:58,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:20:58,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:20:58,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:20:58,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:20:58,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:20:58,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:20:58,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:20:58,398 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f094e7ea34d2025ab25ab51a4a0b06d8f845826c76dbd06e91f3d4a761fa19b [2025-02-05 15:20:58,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:20:58,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:20:58,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:20:58,604 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:20:58,604 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:20:58,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound5.c [2025-02-05 15:20:59,702 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f279a03e0/ca15df049b9347508580b04215938f1e/FLAG4412da42d [2025-02-05 15:20:59,927 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:20:59,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound5.c [2025-02-05 15:20:59,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f279a03e0/ca15df049b9347508580b04215938f1e/FLAG4412da42d [2025-02-05 15:21:00,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f279a03e0/ca15df049b9347508580b04215938f1e [2025-02-05 15:21:00,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:21:00,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:21:00,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:21:00,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:21:00,274 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:21:00,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:21:00" (1/1) ... [2025-02-05 15:21:00,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f16c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:21:00, skipping insertion in model container [2025-02-05 15:21:00,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:21:00" (1/1) ... [2025-02-05 15:21:00,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:21:00,388 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/nla-digbench-scaling/hard2_unwindbound5.c[526,539] [2025-02-05 15:21:00,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:21:00,410 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:21:00,418 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/nla-digbench-scaling/hard2_unwindbound5.c[526,539] [2025-02-05 15:21:00,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:21:00,435 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:21:00,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:21:00 WrapperNode [2025-02-05 15:21:00,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:21:00,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:21:00,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:21:00,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:21:00,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:21:00" (1/1) ... [2025-02-05 15:21:00,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:21:00" (1/1) ... [2025-02-05 15:21:00,453 INFO L138 Inliner]: procedures = 14, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2025-02-05 15:21:00,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:21:00,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:21:00,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:21:00,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:21:00,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:21:00" (1/1) ... [2025-02-05 15:21:00,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:21:00" (1/1) ... [2025-02-05 15:21:00,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:21:00" (1/1) ... [2025-02-05 15:21:00,466 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-05 15:21:00,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:21:00" (1/1) ... [2025-02-05 15:21:00,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:21:00" (1/1) ... [2025-02-05 15:21:00,469 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:21:00" (1/1) ... [2025-02-05 15:21:00,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:21:00" (1/1) ... [2025-02-05 15:21:00,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:21:00" (1/1) ... [2025-02-05 15:21:00,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:21:00" (1/1) ... [2025-02-05 15:21:00,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:21:00,476 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:21:00,476 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:21:00,476 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:21:00,477 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:21:00" (1/1) ... [2025-02-05 15:21:00,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:21:00,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:21:00,499 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 15:21:00,502 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 15:21:00,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:21:00,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:21:00,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:21:00,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:21:00,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:21:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 15:21:00,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 15:21:00,552 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:21:00,553 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:21:00,647 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-02-05 15:21:00,647 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:21:00,654 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:21:00,654 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:21:00,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:21:00 BoogieIcfgContainer [2025-02-05 15:21:00,655 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:21:00,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:21:00,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:21:00,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:21:00,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:21:00" (1/3) ... [2025-02-05 15:21:00,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14551ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:21:00, skipping insertion in model container [2025-02-05 15:21:00,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:21:00" (2/3) ... [2025-02-05 15:21:00,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14551ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:21:00, skipping insertion in model container [2025-02-05 15:21:00,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:21:00" (3/3) ... [2025-02-05 15:21:00,661 INFO L128 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound5.c [2025-02-05 15:21:00,670 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:21:00,671 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard2_unwindbound5.c that has 2 procedures, 26 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:21:00,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:21:00,721 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;@34947fab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:21:00,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:21:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 15:21:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 15:21:00,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:00,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:21:00,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:00,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1337721167, now seen corresponding path program 1 times [2025-02-05 15:21:00,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:00,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889817061] [2025-02-05 15:21:00,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:00,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:00,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 15:21:00,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 15:21:00,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:00,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:00,935 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 15:21:00,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:21:00,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889817061] [2025-02-05 15:21:00,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889817061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:21:00,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:21:00,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:21:00,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322213825] [2025-02-05 15:21:00,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:21:00,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:21:00,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:21:00,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:21:00,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:21:00,953 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:21:01,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:21:01,004 INFO L93 Difference]: Finished difference Result 64 states and 109 transitions. [2025-02-05 15:21:01,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:21:01,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 15:21:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:21:01,010 INFO L225 Difference]: With dead ends: 64 [2025-02-05 15:21:01,010 INFO L226 Difference]: Without dead ends: 34 [2025-02-05 15:21:01,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:21:01,014 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:21:01,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 112 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:21:01,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-05 15:21:01,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2025-02-05 15:21:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 15:21:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-02-05 15:21:01,046 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 8 [2025-02-05 15:21:01,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:21:01,046 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-02-05 15:21:01,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:21:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-02-05 15:21:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 15:21:01,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:01,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:21:01,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:21:01,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:01,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:01,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1248916916, now seen corresponding path program 1 times [2025-02-05 15:21:01,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:01,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337649402] [2025-02-05 15:21:01,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:01,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:01,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 15:21:01,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 15:21:01,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:01,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:01,112 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 15:21:01,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:21:01,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337649402] [2025-02-05 15:21:01,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337649402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:21:01,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:21:01,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:21:01,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725046846] [2025-02-05 15:21:01,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:21:01,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:21:01,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:21:01,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:21:01,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:21:01,114 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:21:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:21:01,133 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2025-02-05 15:21:01,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:21:01,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-05 15:21:01,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:21:01,136 INFO L225 Difference]: With dead ends: 42 [2025-02-05 15:21:01,136 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 15:21:01,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 15:21:01,137 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:21:01,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:21:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 15:21:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-05 15:21:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 15:21:01,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-02-05 15:21:01,143 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2025-02-05 15:21:01,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:21:01,143 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-02-05 15:21:01,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:21:01,143 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-02-05 15:21:01,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 15:21:01,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:01,144 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:21:01,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:21:01,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:01,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:01,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1610903053, now seen corresponding path program 1 times [2025-02-05 15:21:01,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:01,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711786772] [2025-02-05 15:21:01,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:01,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:01,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 15:21:01,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 15:21:01,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:01,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:21:01,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:21:01,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711786772] [2025-02-05 15:21:01,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711786772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:21:01,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:21:01,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:21:01,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096369194] [2025-02-05 15:21:01,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:21:01,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:21:01,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:21:01,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:21:01,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:21:01,213 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:21:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:21:01,253 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2025-02-05 15:21:01,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:21:01,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-05 15:21:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:21:01,254 INFO L225 Difference]: With dead ends: 42 [2025-02-05 15:21:01,254 INFO L226 Difference]: Without dead ends: 40 [2025-02-05 15:21:01,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:21:01,255 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:21:01,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 94 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:21:01,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-05 15:21:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2025-02-05 15:21:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 15:21:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-02-05 15:21:01,260 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2025-02-05 15:21:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:21:01,260 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-02-05 15:21:01,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:21:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-02-05 15:21:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 15:21:01,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:01,261 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:21:01,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:21:01,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:01,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:01,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1890824207, now seen corresponding path program 1 times [2025-02-05 15:21:01,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:01,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231641270] [2025-02-05 15:21:01,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:01,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:01,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:21:01,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:21:01,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:01,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:21:01,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [606546899] [2025-02-05 15:21:01,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:01,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:01,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:21:01,280 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 15:21:01,282 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 15:21:01,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:21:01,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:21:01,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:01,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:01,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:21:01,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:21:01,417 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:21:01,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:21:01,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:21:01,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231641270] [2025-02-05 15:21:01,418 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:21:01,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606546899] [2025-02-05 15:21:01,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606546899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:21:01,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:21:01,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:21:01,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908870496] [2025-02-05 15:21:01,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:21:01,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:21:01,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:21:01,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:21:01,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:21:01,420 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:21:01,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:21:01,485 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2025-02-05 15:21:01,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:21:01,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-02-05 15:21:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:21:01,487 INFO L225 Difference]: With dead ends: 61 [2025-02-05 15:21:01,488 INFO L226 Difference]: Without dead ends: 46 [2025-02-05 15:21:01,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:21:01,488 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:21:01,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:21:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-05 15:21:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-05 15:21:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 15:21:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2025-02-05 15:21:01,500 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 18 [2025-02-05 15:21:01,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:21:01,500 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2025-02-05 15:21:01,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:21:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2025-02-05 15:21:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 15:21:01,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:01,501 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:21:01,515 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 15:21:01,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:01,703 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:01,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:01,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1939108053, now seen corresponding path program 1 times [2025-02-05 15:21:01,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:01,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279487475] [2025-02-05 15:21:01,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:01,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:01,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 15:21:01,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 15:21:01,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:01,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:21:01,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1389907984] [2025-02-05 15:21:01,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:01,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:01,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:21:01,719 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 15:21:01,723 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 15:21:01,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 15:21:01,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 15:21:01,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:01,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:01,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 15:21:01,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:21:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 15:21:01,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:21:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 15:21:01,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:21:01,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279487475] [2025-02-05 15:21:01,938 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:21:01,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389907984] [2025-02-05 15:21:01,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389907984] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:21:01,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:21:01,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-02-05 15:21:01,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902179079] [2025-02-05 15:21:01,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:21:01,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:21:01,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:21:01,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:21:01,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:21:01,940 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:21:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:21:02,010 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2025-02-05 15:21:02,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:21:02,010 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-02-05 15:21:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:21:02,012 INFO L225 Difference]: With dead ends: 64 [2025-02-05 15:21:02,012 INFO L226 Difference]: Without dead ends: 61 [2025-02-05 15:21:02,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:21:02,012 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:21:02,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 80 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:21:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-05 15:21:02,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2025-02-05 15:21:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-05 15:21:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2025-02-05 15:21:02,023 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 26 [2025-02-05 15:21:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:21:02,023 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2025-02-05 15:21:02,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:21:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2025-02-05 15:21:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-05 15:21:02,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:02,024 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:21:02,030 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 15:21:02,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:02,225 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:02,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:02,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1363596918, now seen corresponding path program 1 times [2025-02-05 15:21:02,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:02,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093223871] [2025-02-05 15:21:02,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:02,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:02,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 15:21:02,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 15:21:02,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:02,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:21:02,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:21:02,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093223871] [2025-02-05 15:21:02,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093223871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:21:02,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494210920] [2025-02-05 15:21:02,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:02,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:02,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:21:02,278 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 15:21:02,280 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 15:21:02,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 15:21:02,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 15:21:02,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:02,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:02,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 15:21:02,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:21:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 15:21:02,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:21:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:21:02,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494210920] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:21:02,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:21:02,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2025-02-05 15:21:02,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284527676] [2025-02-05 15:21:02,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:21:02,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:21:02,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:21:02,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:21:02,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:21:02,393 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:21:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:21:02,470 INFO L93 Difference]: Finished difference Result 155 states and 190 transitions. [2025-02-05 15:21:02,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:21:02,471 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 33 [2025-02-05 15:21:02,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:21:02,472 INFO L225 Difference]: With dead ends: 155 [2025-02-05 15:21:02,472 INFO L226 Difference]: Without dead ends: 130 [2025-02-05 15:21:02,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:21:02,473 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 47 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:21:02,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 144 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:21:02,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-05 15:21:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2025-02-05 15:21:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 83 states have internal predecessors, (95), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 15:21:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. [2025-02-05 15:21:02,485 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 146 transitions. Word has length 33 [2025-02-05 15:21:02,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:21:02,485 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 146 transitions. [2025-02-05 15:21:02,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:21:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 146 transitions. [2025-02-05 15:21:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 15:21:02,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:02,486 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-05 15:21:02,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:21:02,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:02,690 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:02,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:02,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1138305543, now seen corresponding path program 1 times [2025-02-05 15:21:02,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:02,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917970624] [2025-02-05 15:21:02,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:02,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:02,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 15:21:02,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 15:21:02,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:02,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:21:02,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909732524] [2025-02-05 15:21:02,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:02,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:02,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:21:02,702 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 15:21:02,704 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 15:21:02,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 15:21:02,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 15:21:02,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:02,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:02,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:21:02,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:21:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:21:02,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:21:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 15:21:02,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:21:02,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917970624] [2025-02-05 15:21:02,858 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:21:02,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909732524] [2025-02-05 15:21:02,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909732524] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 15:21:02,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:21:02,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-02-05 15:21:02,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147867730] [2025-02-05 15:21:02,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:21:02,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:21:02,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:21:02,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:21:02,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:21:02,860 INFO L87 Difference]: Start difference. First operand 123 states and 146 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 15:21:03,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:21:03,456 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2025-02-05 15:21:03,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:21:03,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-02-05 15:21:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:21:03,458 INFO L225 Difference]: With dead ends: 146 [2025-02-05 15:21:03,458 INFO L226 Difference]: Without dead ends: 140 [2025-02-05 15:21:03,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:21:03,459 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:21:03,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 92 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 15:21:03,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-05 15:21:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2025-02-05 15:21:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 86 states have (on average 1.1744186046511629) internal successors, (101), 90 states have internal predecessors, (101), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 15:21:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2025-02-05 15:21:03,485 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 36 [2025-02-05 15:21:03,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:21:03,486 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2025-02-05 15:21:03,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 15:21:03,486 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2025-02-05 15:21:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 15:21:03,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:03,486 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 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 15:21:03,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:21:03,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-05 15:21:03,687 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:03,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:03,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1167569937, now seen corresponding path program 1 times [2025-02-05 15:21:03,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:03,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700607121] [2025-02-05 15:21:03,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:03,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:03,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 15:21:03,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 15:21:03,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:03,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 15:21:03,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:21:03,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700607121] [2025-02-05 15:21:03,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700607121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:21:03,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:21:03,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:21:03,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125141333] [2025-02-05 15:21:03,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:21:03,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:21:03,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:21:03,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:21:03,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:21:03,821 INFO L87 Difference]: Start difference. First operand 132 states and 155 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 15:21:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:21:03,875 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2025-02-05 15:21:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:21:03,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2025-02-05 15:21:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:21:03,876 INFO L225 Difference]: With dead ends: 137 [2025-02-05 15:21:03,876 INFO L226 Difference]: Without dead ends: 118 [2025-02-05 15:21:03,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:21:03,877 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:21:03,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 111 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:21:03,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-05 15:21:03,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-05 15:21:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 80 states have internal predecessors, (91), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 15:21:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2025-02-05 15:21:03,889 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 42 [2025-02-05 15:21:03,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:21:03,889 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2025-02-05 15:21:03,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 15:21:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2025-02-05 15:21:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 15:21:03,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:03,890 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:21:03,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:21:03,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:03,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:03,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2110847750, now seen corresponding path program 1 times [2025-02-05 15:21:03,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:03,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542569701] [2025-02-05 15:21:03,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:03,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:03,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 15:21:03,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 15:21:03,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:03,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 15:21:03,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:21:03,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542569701] [2025-02-05 15:21:03,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542569701] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:21:03,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381430042] [2025-02-05 15:21:03,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:03,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:03,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:21:03,971 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 15:21:03,972 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 15:21:03,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 15:21:04,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 15:21:04,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:04,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:04,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 15:21:04,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:21:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:21:04,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:21:04,107 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 15:21:04,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381430042] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:21:04,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:21:04,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 9 [2025-02-05 15:21:04,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071575139] [2025-02-05 15:21:04,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:21:04,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:21:04,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:21:04,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:21:04,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:21:04,109 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-02-05 15:21:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:21:04,206 INFO L93 Difference]: Finished difference Result 194 states and 232 transitions. [2025-02-05 15:21:04,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:21:04,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 49 [2025-02-05 15:21:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:21:04,207 INFO L225 Difference]: With dead ends: 194 [2025-02-05 15:21:04,207 INFO L226 Difference]: Without dead ends: 173 [2025-02-05 15:21:04,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:21:04,208 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 51 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:21:04,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 182 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:21:04,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-05 15:21:04,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2025-02-05 15:21:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 110 states have (on average 1.1818181818181819) internal successors, (130), 116 states have internal predecessors, (130), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 15:21:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 201 transitions. [2025-02-05 15:21:04,232 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 201 transitions. Word has length 49 [2025-02-05 15:21:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:21:04,232 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 201 transitions. [2025-02-05 15:21:04,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-02-05 15:21:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 201 transitions. [2025-02-05 15:21:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 15:21:04,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:04,233 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:21:04,240 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 15:21:04,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:04,438 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:04,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:04,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1455298504, now seen corresponding path program 1 times [2025-02-05 15:21:04,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:04,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565973229] [2025-02-05 15:21:04,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:04,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:04,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 15:21:04,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 15:21:04,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:04,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:21:04,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [161502704] [2025-02-05 15:21:04,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:04,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:04,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:21:04,509 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 15:21:04,510 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 15:21:04,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 15:21:04,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 15:21:04,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:04,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:04,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 15:21:04,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:21:04,786 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-05 15:21:04,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:21:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-05 15:21:05,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:21:05,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565973229] [2025-02-05 15:21:05,882 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:21:05,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161502704] [2025-02-05 15:21:05,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161502704] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:21:05,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:21:05,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-02-05 15:21:05,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126560543] [2025-02-05 15:21:05,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:21:05,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 15:21:05,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:21:05,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 15:21:05,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:21:05,885 INFO L87 Difference]: Start difference. First operand 168 states and 201 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2025-02-05 15:21:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:21:06,417 INFO L93 Difference]: Finished difference Result 261 states and 330 transitions. [2025-02-05 15:21:06,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 15:21:06,417 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 58 [2025-02-05 15:21:06,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:21:06,419 INFO L225 Difference]: With dead ends: 261 [2025-02-05 15:21:06,419 INFO L226 Difference]: Without dead ends: 223 [2025-02-05 15:21:06,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-02-05 15:21:06,420 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:21:06,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 271 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:21:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-05 15:21:06,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 210. [2025-02-05 15:21:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 141 states have (on average 1.2127659574468086) internal successors, (171), 148 states have internal predecessors, (171), 44 states have call successors, (44), 24 states have call predecessors, (44), 24 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 15:21:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 257 transitions. [2025-02-05 15:21:06,497 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 257 transitions. Word has length 58 [2025-02-05 15:21:06,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:21:06,497 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 257 transitions. [2025-02-05 15:21:06,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2025-02-05 15:21:06,497 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 257 transitions. [2025-02-05 15:21:06,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 15:21:06,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:06,498 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:21:06,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:21:06,702 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,SelfDestructingSolverStorable9 [2025-02-05 15:21:06,703 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:06,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:06,703 INFO L85 PathProgramCache]: Analyzing trace with hash -284772378, now seen corresponding path program 1 times [2025-02-05 15:21:06,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:06,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289744323] [2025-02-05 15:21:06,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:06,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:06,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 15:21:06,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 15:21:06,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:06,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:21:06,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1162665499] [2025-02-05 15:21:06,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:06,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:06,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:21:06,729 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 15:21:06,729 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 15:21:06,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 15:21:06,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 15:21:06,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:06,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:06,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-05 15:21:06,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:21:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 19 proven. 39 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-02-05 15:21:06,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:21:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 19 proven. 39 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-02-05 15:21:07,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:21:07,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289744323] [2025-02-05 15:21:07,461 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:21:07,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162665499] [2025-02-05 15:21:07,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162665499] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:21:07,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:21:07,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2025-02-05 15:21:07,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204443305] [2025-02-05 15:21:07,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:21:07,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 15:21:07,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:21:07,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 15:21:07,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:21:07,463 INFO L87 Difference]: Start difference. First operand 210 states and 257 transitions. Second operand has 16 states, 14 states have (on average 3.0) internal successors, (42), 15 states have internal predecessors, (42), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2025-02-05 15:21:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:21:07,753 INFO L93 Difference]: Finished difference Result 264 states and 328 transitions. [2025-02-05 15:21:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:21:07,754 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0) internal successors, (42), 15 states have internal predecessors, (42), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 69 [2025-02-05 15:21:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:21:07,755 INFO L225 Difference]: With dead ends: 264 [2025-02-05 15:21:07,755 INFO L226 Difference]: Without dead ends: 220 [2025-02-05 15:21:07,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-02-05 15:21:07,756 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 28 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:21:07,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 236 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:21:07,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-05 15:21:07,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 193. [2025-02-05 15:21:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 135 states have internal predecessors, (152), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 15:21:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2025-02-05 15:21:07,783 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 69 [2025-02-05 15:21:07,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:21:07,784 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2025-02-05 15:21:07,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0) internal successors, (42), 15 states have internal predecessors, (42), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2025-02-05 15:21:07,784 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2025-02-05 15:21:07,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 15:21:07,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:07,785 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:21:07,791 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 15:21:07,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:07,989 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:07,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:07,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1844647172, now seen corresponding path program 1 times [2025-02-05 15:21:07,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:07,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757830481] [2025-02-05 15:21:07,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:07,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:07,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 15:21:08,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 15:21:08,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:08,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-05 15:21:08,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:21:08,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757830481] [2025-02-05 15:21:08,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757830481] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:21:08,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603027797] [2025-02-05 15:21:08,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:08,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:08,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:21:08,278 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 15:21:08,279 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 15:21:08,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 15:21:08,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 15:21:08,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:08,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:08,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 15:21:08,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:21:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-05 15:21:08,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:21:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-05 15:21:08,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603027797] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:21:08,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:21:08,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-05 15:21:08,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249873093] [2025-02-05 15:21:08,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:21:08,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:21:08,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:21:08,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:21:08,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:21:08,712 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 7 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2025-02-05 15:21:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:21:08,859 INFO L93 Difference]: Finished difference Result 217 states and 253 transitions. [2025-02-05 15:21:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:21:08,860 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 7 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) Word has length 74 [2025-02-05 15:21:08,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:21:08,867 INFO L225 Difference]: With dead ends: 217 [2025-02-05 15:21:08,869 INFO L226 Difference]: Without dead ends: 165 [2025-02-05 15:21:08,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:21:08,870 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:21:08,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 253 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:21:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-05 15:21:08,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2025-02-05 15:21:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 108 states have (on average 1.1574074074074074) internal successors, (125), 111 states have internal predecessors, (125), 31 states have call successors, (31), 20 states have call predecessors, (31), 20 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 15:21:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 186 transitions. [2025-02-05 15:21:08,890 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 186 transitions. Word has length 74 [2025-02-05 15:21:08,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:21:08,891 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 186 transitions. [2025-02-05 15:21:08,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 7 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2025-02-05 15:21:08,891 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 186 transitions. [2025-02-05 15:21:08,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 15:21:08,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:08,892 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:21:08,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 15:21:09,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:09,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:09,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:09,093 INFO L85 PathProgramCache]: Analyzing trace with hash -785921239, now seen corresponding path program 1 times [2025-02-05 15:21:09,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:09,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438685752] [2025-02-05 15:21:09,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:09,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:09,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 15:21:09,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:21:09,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:09,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-05 15:21:09,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:21:09,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438685752] [2025-02-05 15:21:09,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438685752] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:21:09,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316900272] [2025-02-05 15:21:09,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:09,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:09,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:21:09,220 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 15:21:09,221 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 15:21:09,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 15:21:09,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:21:09,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:09,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:09,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:21:09,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:21:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 72 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 15:21:09,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:21:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-05 15:21:09,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316900272] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:21:09,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:21:09,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2025-02-05 15:21:09,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216378467] [2025-02-05 15:21:09,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:21:09,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:21:09,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:21:09,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:21:09,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:21:09,422 INFO L87 Difference]: Start difference. First operand 160 states and 186 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-02-05 15:21:09,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:21:09,502 INFO L93 Difference]: Finished difference Result 218 states and 264 transitions. [2025-02-05 15:21:09,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:21:09,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 87 [2025-02-05 15:21:09,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:21:09,507 INFO L225 Difference]: With dead ends: 218 [2025-02-05 15:21:09,507 INFO L226 Difference]: Without dead ends: 162 [2025-02-05 15:21:09,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 168 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:21:09,507 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:21:09,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 110 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:21:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-05 15:21:09,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-05 15:21:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 110 states have (on average 1.1545454545454545) internal successors, (127), 113 states have internal predecessors, (127), 31 states have call successors, (31), 20 states have call predecessors, (31), 20 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 15:21:09,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2025-02-05 15:21:09,545 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 87 [2025-02-05 15:21:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:21:09,546 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2025-02-05 15:21:09,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-02-05 15:21:09,546 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2025-02-05 15:21:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 15:21:09,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:09,547 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-05 15:21:09,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 15:21:09,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:09,751 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:09,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash 808388229, now seen corresponding path program 2 times [2025-02-05 15:21:09,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:09,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739958553] [2025-02-05 15:21:09,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:21:09,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:09,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-02-05 15:21:09,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 15:21:09,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:21:09,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-05 15:21:09,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:21:09,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739958553] [2025-02-05 15:21:09,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739958553] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:21:09,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25964650] [2025-02-05 15:21:09,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:21:09,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:09,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:21:09,914 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 15:21:09,915 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 15:21:09,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-02-05 15:21:09,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 15:21:09,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:21:09,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:09,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:21:09,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:21:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 322 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 15:21:10,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:21:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-05 15:21:10,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25964650] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:21:10,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:21:10,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 9 [2025-02-05 15:21:10,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657802514] [2025-02-05 15:21:10,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:21:10,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:21:10,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:21:10,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:21:10,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:21:10,130 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 6 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-02-05 15:21:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:21:10,217 INFO L93 Difference]: Finished difference Result 209 states and 246 transitions. [2025-02-05 15:21:10,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:21:10,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 6 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 90 [2025-02-05 15:21:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:21:10,219 INFO L225 Difference]: With dead ends: 209 [2025-02-05 15:21:10,220 INFO L226 Difference]: Without dead ends: 155 [2025-02-05 15:21:10,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 174 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:21:10,221 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 47 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:21:10,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 193 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:21:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-05 15:21:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2025-02-05 15:21:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 98 states have (on average 1.0816326530612246) internal successors, (106), 101 states have internal predecessors, (106), 26 states have call successors, (26), 20 states have call predecessors, (26), 20 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 15:21:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2025-02-05 15:21:10,261 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 90 [2025-02-05 15:21:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:21:10,262 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2025-02-05 15:21:10,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 6 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-02-05 15:21:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2025-02-05 15:21:10,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 15:21:10,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:10,263 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:21:10,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 15:21:10,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 15:21:10,464 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:10,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash 809192586, now seen corresponding path program 1 times [2025-02-05 15:21:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:10,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380012279] [2025-02-05 15:21:10,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:10,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:10,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 15:21:10,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 15:21:10,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:10,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:21:10,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295212719] [2025-02-05 15:21:10,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:21:10,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:10,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:21:10,491 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:21:10,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 15:21:10,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 15:21:10,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 15:21:10,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:10,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:21:10,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-05 15:21:10,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:21:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-05 15:21:10,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:21:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-05 15:21:24,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:21:24,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380012279] [2025-02-05 15:21:24,777 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:21:24,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295212719] [2025-02-05 15:21:24,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295212719] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:21:24,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:21:24,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2025-02-05 15:21:24,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501910275] [2025-02-05 15:21:24,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:21:24,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 15:21:24,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:21:24,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 15:21:24,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-02-05 15:21:24,778 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2025-02-05 15:21:25,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:21:25,591 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2025-02-05 15:21:25,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 15:21:25,591 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) Word has length 90 [2025-02-05 15:21:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:21:25,592 INFO L225 Difference]: With dead ends: 181 [2025-02-05 15:21:25,592 INFO L226 Difference]: Without dead ends: 179 [2025-02-05 15:21:25,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2025-02-05 15:21:25,593 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 62 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:21:25,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 534 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:21:25,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-05 15:21:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 148. [2025-02-05 15:21:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.0792079207920793) internal successors, (109), 104 states have internal predecessors, (109), 25 states have call successors, (25), 21 states have call predecessors, (25), 21 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 15:21:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2025-02-05 15:21:25,615 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 90 [2025-02-05 15:21:25,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:21:25,616 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2025-02-05 15:21:25,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2025-02-05 15:21:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2025-02-05 15:21:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 15:21:25,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:21:25,616 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:21:25,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 15:21:25,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 15:21:25,822 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:21:25,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:21:25,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1807410221, now seen corresponding path program 2 times [2025-02-05 15:21:25,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:21:25,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705803762] [2025-02-05 15:21:25,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:21:25,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:21:25,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-02-05 15:21:25,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 15:21:25,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:21:25,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:21:25,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2069750209] [2025-02-05 15:21:25,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:21:25,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:25,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:21:25,848 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:21:25,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 15:21:25,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-02-05 15:21:25,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 15:21:25,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:21:25,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:21:25,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:21:25,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 15:21:25,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 15:21:25,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:21:25,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:21:25,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:21:25,927 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:21:25,928 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:21:25,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-05 15:21:26,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:21:26,132 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:21:26,160 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:21:26,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:21:26 BoogieIcfgContainer [2025-02-05 15:21:26,162 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:21:26,163 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:21:26,163 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:21:26,163 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:21:26,163 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:21:00" (3/4) ... [2025-02-05 15:21:26,164 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:21:26,205 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 63. [2025-02-05 15:21:26,269 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:21:26,269 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:21:26,269 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:21:26,269 INFO L158 Benchmark]: Toolchain (without parser) took 26004.85ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 112.7MB in the beginning and 247.5MB in the end (delta: -134.8MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2025-02-05 15:21:26,269 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:21:26,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.94ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 101.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:21:26,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.70ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:21:26,270 INFO L158 Benchmark]: Boogie Preprocessor took 17.13ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:21:26,270 INFO L158 Benchmark]: IcfgBuilder took 179.04ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 86.8MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:21:26,270 INFO L158 Benchmark]: TraceAbstraction took 25505.77ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 86.3MB in the beginning and 259.9MB in the end (delta: -173.6MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2025-02-05 15:21:26,270 INFO L158 Benchmark]: Witness Printer took 106.35ms. Allocated memory is still 352.3MB. Free memory was 259.9MB in the beginning and 247.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:21:26,271 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.94ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.94ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 101.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.70ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.13ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 179.04ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 86.8MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25505.77ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 86.3MB in the beginning and 259.9MB in the end (delta: -173.6MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * Witness Printer took 106.35ms. Allocated memory is still 352.3MB. Free memory was 259.9MB in the beginning and 247.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] int A, B; [L25] int r, d, p, q; [L26] A = __VERIFIER_nondet_int() [L27] B = 1 [L29] r = A [L30] d = B [L31] p = 1 [L32] q = 0 VAL [A=7, B=1, counter=0, d=1, p=1, q=0, r=7] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [A=7, B=1, counter=1, d=2, p=2, q=0, r=7] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [A=7, B=1, counter=2, d=4, p=4, q=0, r=7] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [A=7, B=1, counter=3, d=8, p=8, q=0, r=7] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L38] COND TRUE !(r >= d) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L44] COND TRUE counter++<5 [L44] EXPR counter++ VAL [A=7, B=1, counter=5, d=8, p=8, q=0, r=7] [L44] COND TRUE counter++<5 [L45] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L45] RET __VERIFIER_assert(A == q*B + r) VAL [A=7, B=1, counter=5, d=8, p=8, q=0, r=7] [L46] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L46] RET __VERIFIER_assert(d == B*p) VAL [A=7, B=1, counter=5, d=8, p=8, q=0, r=7] [L48] COND FALSE !(!(p != 1)) [L50] d = d / 2 [L51] p = p / 2 VAL [A=7, B=1, counter=5, d=4, p=4, q=0, r=7] [L52] COND TRUE r >= d [L53] r = r - d [L54] q = q + p VAL [A=7, B=1, counter=5, d=4, p=4, q=4, r=3] [L44] COND TRUE counter++<5 [L44] EXPR counter++ VAL [A=7, B=1, counter=6, d=4, p=4, q=4, r=3] [L44] COND FALSE !(counter++<5) [L58] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=0, counter=6] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L17] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.4s, OverallIterations: 16, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 404 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 366 mSDsluCounter, 2595 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2064 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1681 IncrementalHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 531 mSDtfsCounter, 1681 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1306 GetRequests, 1142 SyntacticMatches, 18 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=10, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 127 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 1521 NumberOfCodeBlocks, 1521 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1618 ConstructedInterpolants, 0 QuantifiedInterpolants, 16250 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1817 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 4343/5079 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-05 15:21:26,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE