./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.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 898ef25fdb2ae04f56304d500631f410c196b9a77fbfba6f83248dcfc33b301f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:21:35,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:21:35,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:21:35,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:21:35,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:21:35,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:21:35,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:21:35,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:21:35,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:21:35,273 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:21:35,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:21:35,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:21:35,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:21:35,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:21:35,274 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:21:35,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:21:35,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:21:35,275 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:21:35,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:21:35,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:21:35,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:21:35,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:21:35,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:21:35,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:21:35,275 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:21:35,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:21:35,275 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:21:35,275 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:21:35,275 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:21:35,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:21:35,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:21:35,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:21:35,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:21:35,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:21:35,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:21:35,276 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:21:35,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:21:35,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:21:35,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:21:35,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:21:35,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:21:35,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:21:35,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:21:35,277 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 -> 898ef25fdb2ae04f56304d500631f410c196b9a77fbfba6f83248dcfc33b301f [2025-02-07 20:21:35,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:21:35,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:21:35,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:21:35,540 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:21:35,540 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:21:35,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.c [2025-02-07 20:21:36,678 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3ab077b0/03959dd9ce77446ea3a7a233bf976541/FLAGd4dfb5a01 [2025-02-07 20:21:36,922 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:21:36,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.c [2025-02-07 20:21:36,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3ab077b0/03959dd9ce77446ea3a7a233bf976541/FLAGd4dfb5a01 [2025-02-07 20:21:37,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3ab077b0/03959dd9ce77446ea3a7a233bf976541 [2025-02-07 20:21:37,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:21:37,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:21:37,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:21:37,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:21:37,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:21:37,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1294963c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37, skipping insertion in model container [2025-02-07 20:21:37,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:21:37,366 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/loops-crafted-1/nested3-1_abstracted.c[739,752] [2025-02-07 20:21:37,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:21:37,389 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:21:37,397 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/loops-crafted-1/nested3-1_abstracted.c[739,752] [2025-02-07 20:21:37,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:21:37,413 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:21:37,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37 WrapperNode [2025-02-07 20:21:37,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:21:37,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:21:37,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:21:37,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:21:37,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,437 INFO L138 Inliner]: procedures = 20, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 40 [2025-02-07 20:21:37,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:21:37,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:21:37,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:21:37,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:21:37,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,454 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 20:21:37,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,456 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:21:37,458 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:21:37,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:21:37,458 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:21:37,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:21:37,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:21:37,491 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-07 20:21:37,494 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-07 20:21:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:21:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:21:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:21:37,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:21:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 20:21:37,515 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 20:21:37,554 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:21:37,556 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:21:37,677 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-07 20:21:37,677 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:21:37,684 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:21:37,685 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:21:37,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:21:37 BoogieIcfgContainer [2025-02-07 20:21:37,685 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:21:37,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:21:37,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:21:37,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:21:37,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:21:37" (1/3) ... [2025-02-07 20:21:37,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583fa280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:21:37, skipping insertion in model container [2025-02-07 20:21:37,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (2/3) ... [2025-02-07 20:21:37,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583fa280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:21:37, skipping insertion in model container [2025-02-07 20:21:37,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:21:37" (3/3) ... [2025-02-07 20:21:37,693 INFO L128 eAbstractionObserver]: Analyzing ICFG nested3-1_abstracted.c [2025-02-07 20:21:37,703 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:21:37,705 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested3-1_abstracted.c that has 2 procedures, 21 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 20:21:37,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:21:37,750 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;@f52f426, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:21:37,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:21:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:21:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 20:21:37,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:37,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 20:21:37,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:37,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:37,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1419326589, now seen corresponding path program 1 times [2025-02-07 20:21:37,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:37,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090429636] [2025-02-07 20:21:37,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:21:37,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:37,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 20:21:37,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 20:21:37,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:21:37,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:37,933 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-07 20:21:37,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:37,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090429636] [2025-02-07 20:21:37,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090429636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:21:37,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:21:37,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:21:37,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139791117] [2025-02-07 20:21:37,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:21:37,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:21:37,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:37,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:21:37,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:21:37,953 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-07 20:21:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:37,974 INFO L93 Difference]: Finished difference Result 51 states and 80 transitions. [2025-02-07 20:21:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:21:37,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 6 [2025-02-07 20:21:37,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:37,979 INFO L225 Difference]: With dead ends: 51 [2025-02-07 20:21:37,979 INFO L226 Difference]: Without dead ends: 28 [2025-02-07 20:21:37,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:21:37,984 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:37,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:21:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-07 20:21:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2025-02-07 20:21:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:21:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-02-07 20:21:38,005 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 6 [2025-02-07 20:21:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:38,005 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-02-07 20:21:38,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-07 20:21:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2025-02-07 20:21:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:21:38,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:38,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:38,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:21:38,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:38,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:38,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1010784555, now seen corresponding path program 1 times [2025-02-07 20:21:38,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:38,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396778464] [2025-02-07 20:21:38,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:21:38,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:38,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:21:38,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:21:38,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:21:38,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:38,083 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-07 20:21:38,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:38,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396778464] [2025-02-07 20:21:38,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396778464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:21:38,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:21:38,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:21:38,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69300998] [2025-02-07 20:21:38,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:21:38,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:21:38,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:38,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:21:38,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:21:38,085 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-07 20:21:38,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:38,095 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2025-02-07 20:21:38,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:21:38,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-02-07 20:21:38,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:38,096 INFO L225 Difference]: With dead ends: 43 [2025-02-07 20:21:38,096 INFO L226 Difference]: Without dead ends: 26 [2025-02-07 20:21:38,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:21:38,099 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:38,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 40 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:21:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-07 20:21:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2025-02-07 20:21:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:21:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-02-07 20:21:38,102 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 7 [2025-02-07 20:21:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:38,103 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-02-07 20:21:38,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-07 20:21:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-02-07 20:21:38,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 20:21:38,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:38,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:38,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:21:38,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:38,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:38,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1227248887, now seen corresponding path program 1 times [2025-02-07 20:21:38,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:38,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817069436] [2025-02-07 20:21:38,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:21:38,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:38,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 20:21:38,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:21:38,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:21:38,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:38,167 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-07 20:21:38,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817069436] [2025-02-07 20:21:38,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817069436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:21:38,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:21:38,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:21:38,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316366678] [2025-02-07 20:21:38,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:21:38,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:21:38,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:38,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:21:38,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:21:38,169 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-07 20:21:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:38,181 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2025-02-07 20:21:38,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:21:38,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-07 20:21:38,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:38,182 INFO L225 Difference]: With dead ends: 38 [2025-02-07 20:21:38,182 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 20:21:38,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:21:38,183 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:38,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:21:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 20:21:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-07 20:21:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:21:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-02-07 20:21:38,186 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 8 [2025-02-07 20:21:38,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:38,186 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-02-07 20:21:38,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-07 20:21:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-02-07 20:21:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 20:21:38,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:38,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:38,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:21:38,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:38,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash 312830630, now seen corresponding path program 1 times [2025-02-07 20:21:38,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:38,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253360803] [2025-02-07 20:21:38,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:21:38,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:38,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 20:21:38,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 20:21:38,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:21:38,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:38,361 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-07 20:21:38,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:38,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253360803] [2025-02-07 20:21:38,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253360803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:21:38,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:21:38,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 20:21:38,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220776917] [2025-02-07 20:21:38,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:21:38,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:21:38,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:38,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:21:38,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:21:38,363 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-07 20:21:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:38,433 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-02-07 20:21:38,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:21:38,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 11 [2025-02-07 20:21:38,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:38,434 INFO L225 Difference]: With dead ends: 43 [2025-02-07 20:21:38,434 INFO L226 Difference]: Without dead ends: 25 [2025-02-07 20:21:38,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:21:38,435 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:38,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 77 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:21:38,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-07 20:21:38,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-02-07 20:21:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:21:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-02-07 20:21:38,443 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 11 [2025-02-07 20:21:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:38,443 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-02-07 20:21:38,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-07 20:21:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-02-07 20:21:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:21:38,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:38,444 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:38,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:21:38,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:38,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:38,444 INFO L85 PathProgramCache]: Analyzing trace with hash -709846980, now seen corresponding path program 1 times [2025-02-07 20:21:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:38,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851440618] [2025-02-07 20:21:38,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:21:38,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:38,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:21:38,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:21:38,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:21:38,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:21:38,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:38,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851440618] [2025-02-07 20:21:38,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851440618] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:21:38,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150232713] [2025-02-07 20:21:38,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:21:38,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:38,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:21:38,525 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-07 20:21:38,528 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-07 20:21:38,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:21:38,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:21:38,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:21:38,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:38,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 20:21:38,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:21:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:21:38,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:21:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:21:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150232713] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:21:38,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:21:38,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2025-02-07 20:21:38,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157340259] [2025-02-07 20:21:38,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:21:38,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 20:21:38,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:38,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 20:21:38,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:21:38,707 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:21:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:38,795 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2025-02-07 20:21:38,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:21:38,796 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-02-07 20:21:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:38,797 INFO L225 Difference]: With dead ends: 74 [2025-02-07 20:21:38,797 INFO L226 Difference]: Without dead ends: 52 [2025-02-07 20:21:38,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:21:38,801 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 31 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:38,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 145 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:21:38,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-07 20:21:38,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2025-02-07 20:21:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 20:21:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-02-07 20:21:38,809 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2025-02-07 20:21:38,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:38,809 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-02-07 20:21:38,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:21:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-02-07 20:21:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 20:21:38,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:38,810 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:38,818 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-07 20:21:39,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:39,014 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:39,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:39,015 INFO L85 PathProgramCache]: Analyzing trace with hash -702679925, now seen corresponding path program 2 times [2025-02-07 20:21:39,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:39,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091650882] [2025-02-07 20:21:39,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:21:39,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:39,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-07 20:21:39,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:21:39,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:21:39,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:21:39,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:39,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091650882] [2025-02-07 20:21:39,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091650882] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:21:39,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331955620] [2025-02-07 20:21:39,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:21:39,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:39,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:21:39,113 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-07 20:21:39,114 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-07 20:21:39,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-07 20:21:39,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:21:39,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:21:39,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:39,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 20:21:39,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:21:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:21:39,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:21:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:21:39,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331955620] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:21:39,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:21:39,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-07 20:21:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769727779] [2025-02-07 20:21:39,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:21:39,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 20:21:39,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:39,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 20:21:39,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:21:39,243 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:21:39,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:39,330 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2025-02-07 20:21:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:21:39,331 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2025-02-07 20:21:39,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:39,332 INFO L225 Difference]: With dead ends: 112 [2025-02-07 20:21:39,332 INFO L226 Difference]: Without dead ends: 71 [2025-02-07 20:21:39,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:21:39,333 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:39,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 123 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:21:39,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-07 20:21:39,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-02-07 20:21:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 59 states have internal predecessors, (61), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 20:21:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2025-02-07 20:21:39,343 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 29 [2025-02-07 20:21:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:39,344 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2025-02-07 20:21:39,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:21:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2025-02-07 20:21:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-07 20:21:39,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:39,345 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:39,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 20:21:39,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:39,549 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:39,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:39,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2033527989, now seen corresponding path program 3 times [2025-02-07 20:21:39,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:39,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332864631] [2025-02-07 20:21:39,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:21:39,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:39,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 7 equivalence classes. [2025-02-07 20:21:39,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 73 statements. [2025-02-07 20:21:39,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 20:21:39,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-02-07 20:21:39,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:39,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332864631] [2025-02-07 20:21:39,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332864631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:21:39,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:21:39,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 20:21:39,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578012151] [2025-02-07 20:21:39,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:21:39,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:21:39,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:39,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:21:39,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:21:39,662 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:21:39,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:39,712 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2025-02-07 20:21:39,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:21:39,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2025-02-07 20:21:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:39,713 INFO L225 Difference]: With dead ends: 77 [2025-02-07 20:21:39,713 INFO L226 Difference]: Without dead ends: 73 [2025-02-07 20:21:39,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:21:39,714 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:39,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:21:39,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-07 20:21:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2025-02-07 20:21:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 20:21:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2025-02-07 20:21:39,723 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 73 [2025-02-07 20:21:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:39,724 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2025-02-07 20:21:39,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:21:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2025-02-07 20:21:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-07 20:21:39,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:39,725 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:39,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 20:21:39,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:39,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1596799611, now seen corresponding path program 1 times [2025-02-07 20:21:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:39,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268957796] [2025-02-07 20:21:39,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:21:39,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:39,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-07 20:21:39,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-07 20:21:39,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:21:39,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 15 proven. 111 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 20:21:39,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:39,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268957796] [2025-02-07 20:21:39,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268957796] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:21:39,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69036299] [2025-02-07 20:21:39,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:21:39,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:39,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:21:39,910 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-07 20:21:39,912 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-07 20:21:39,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-07 20:21:39,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-07 20:21:39,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:21:39,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:39,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 20:21:39,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:21:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-02-07 20:21:40,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:21:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-02-07 20:21:40,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69036299] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:21:40,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:21:40,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2025-02-07 20:21:40,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162285120] [2025-02-07 20:21:40,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:21:40,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 20:21:40,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:40,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 20:21:40,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:21:40,298 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-07 20:21:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:40,844 INFO L93 Difference]: Finished difference Result 310 states and 361 transitions. [2025-02-07 20:21:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-07 20:21:40,845 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 80 [2025-02-07 20:21:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:40,846 INFO L225 Difference]: With dead ends: 310 [2025-02-07 20:21:40,846 INFO L226 Difference]: Without dead ends: 251 [2025-02-07 20:21:40,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=402, Invalid=1578, Unknown=0, NotChecked=0, Total=1980 [2025-02-07 20:21:40,847 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 177 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:40,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 678 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:21:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-07 20:21:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 227. [2025-02-07 20:21:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 191 states have (on average 1.0261780104712042) internal successors, (196), 191 states have internal predecessors, (196), 33 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-07 20:21:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 261 transitions. [2025-02-07 20:21:40,878 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 261 transitions. Word has length 80 [2025-02-07 20:21:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:40,878 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 261 transitions. [2025-02-07 20:21:40,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-07 20:21:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 261 transitions. [2025-02-07 20:21:40,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-02-07 20:21:40,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:40,885 INFO L218 NwaCegarLoop]: trace histogram [33, 32, 32, 28, 28, 28, 28, 28, 28, 28, 28, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-02-07 20:21:40,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 20:21:41,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:41,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:41,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:41,086 INFO L85 PathProgramCache]: Analyzing trace with hash 574738621, now seen corresponding path program 2 times [2025-02-07 20:21:41,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:41,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633277193] [2025-02-07 20:21:41,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:21:41,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:41,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 346 statements into 2 equivalence classes. [2025-02-07 20:21:41,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 346 of 346 statements. [2025-02-07 20:21:41,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:21:41,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4834 backedges. 1142 proven. 154 refuted. 0 times theorem prover too weak. 3538 trivial. 0 not checked. [2025-02-07 20:21:41,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633277193] [2025-02-07 20:21:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633277193] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:21:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718176495] [2025-02-07 20:21:41,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:21:41,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:41,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:21:41,638 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-07 20:21:41,639 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-07 20:21:41,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 346 statements into 2 equivalence classes. [2025-02-07 20:21:41,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 346 of 346 statements. [2025-02-07 20:21:41,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:21:41,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:41,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-07 20:21:41,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:21:42,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4834 backedges. 64 proven. 2303 refuted. 0 times theorem prover too weak. 2467 trivial. 0 not checked. [2025-02-07 20:21:42,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:21:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4834 backedges. 151 proven. 2216 refuted. 0 times theorem prover too weak. 2467 trivial. 0 not checked. [2025-02-07 20:21:42,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718176495] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:21:42,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:21:42,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2025-02-07 20:21:42,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257094966] [2025-02-07 20:21:42,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:21:42,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-07 20:21:42,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:42,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-07 20:21:42,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2025-02-07 20:21:42,899 INFO L87 Difference]: Start difference. First operand 227 states and 261 transitions. Second operand has 30 states, 30 states have (on average 6.233333333333333) internal successors, (187), 30 states have internal predecessors, (187), 24 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) [2025-02-07 20:21:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:45,398 INFO L93 Difference]: Finished difference Result 850 states and 1000 transitions. [2025-02-07 20:21:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-02-07 20:21:45,398 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.233333333333333) internal successors, (187), 30 states have internal predecessors, (187), 24 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) Word has length 346 [2025-02-07 20:21:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:45,401 INFO L225 Difference]: With dead ends: 850 [2025-02-07 20:21:45,401 INFO L226 Difference]: Without dead ends: 675 [2025-02-07 20:21:45,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 673 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4341 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2157, Invalid=10499, Unknown=0, NotChecked=0, Total=12656 [2025-02-07 20:21:45,406 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 393 mSDsluCounter, 2650 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 2883 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:45,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 2883 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 20:21:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-02-07 20:21:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 615. [2025-02-07 20:21:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 521 states have (on average 1.021113243761996) internal successors, (532), 521 states have internal predecessors, (532), 91 states have call successors, (91), 3 states have call predecessors, (91), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-07 20:21:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 713 transitions. [2025-02-07 20:21:45,455 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 713 transitions. Word has length 346 [2025-02-07 20:21:45,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:45,455 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 713 transitions. [2025-02-07 20:21:45,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.233333333333333) internal successors, (187), 30 states have internal predecessors, (187), 24 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) [2025-02-07 20:21:45,456 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 713 transitions. [2025-02-07 20:21:45,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 967 [2025-02-07 20:21:45,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:45,469 INFO L218 NwaCegarLoop]: trace histogram [91, 90, 90, 80, 80, 80, 80, 80, 80, 80, 80, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-02-07 20:21:45,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 20:21:45,673 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,SelfDestructingSolverStorable8 [2025-02-07 20:21:45,673 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:45,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:45,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1341886121, now seen corresponding path program 3 times [2025-02-07 20:21:45,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:45,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502738261] [2025-02-07 20:21:45,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:21:45,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:45,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 966 statements into 88 equivalence classes. [2025-02-07 20:21:45,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 114 of 966 statements. [2025-02-07 20:21:45,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-07 20:21:45,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 39310 backedges. 4393 proven. 204 refuted. 0 times theorem prover too weak. 34713 trivial. 0 not checked. [2025-02-07 20:21:45,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:45,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502738261] [2025-02-07 20:21:45,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502738261] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:21:45,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611271742] [2025-02-07 20:21:45,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:21:45,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:45,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:21:45,932 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-07 20:21:45,934 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-07 20:21:46,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 966 statements into 88 equivalence classes. [2025-02-07 20:21:46,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 114 of 966 statements. [2025-02-07 20:21:46,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-07 20:21:46,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:46,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-07 20:21:46,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:21:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 39310 backedges. 4747 proven. 204 refuted. 0 times theorem prover too weak. 34359 trivial. 0 not checked. [2025-02-07 20:21:46,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:21:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 39310 backedges. 4393 proven. 204 refuted. 0 times theorem prover too weak. 34713 trivial. 0 not checked. [2025-02-07 20:21:46,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611271742] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:21:46,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:21:46,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-02-07 20:21:46,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688692429] [2025-02-07 20:21:46,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:21:46,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-07 20:21:46,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:46,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-07 20:21:46,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2025-02-07 20:21:46,618 INFO L87 Difference]: Start difference. First operand 615 states and 713 transitions. Second operand has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 18 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2025-02-07 20:21:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:47,630 INFO L93 Difference]: Finished difference Result 1871 states and 2258 transitions. [2025-02-07 20:21:47,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-07 20:21:47,631 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 18 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) Word has length 966 [2025-02-07 20:21:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:47,637 INFO L225 Difference]: With dead ends: 1871 [2025-02-07 20:21:47,638 INFO L226 Difference]: Without dead ends: 1315 [2025-02-07 20:21:47,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1950 GetRequests, 1923 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=306, Invalid=506, Unknown=0, NotChecked=0, Total=812 [2025-02-07 20:21:47,640 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 50 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:47,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 591 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:21:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2025-02-07 20:21:47,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1315. [2025-02-07 20:21:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1121 states have (on average 1.0098126672613739) internal successors, (1132), 1121 states have internal predecessors, (1132), 191 states have call successors, (191), 3 states have call predecessors, (191), 2 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2025-02-07 20:21:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1513 transitions. [2025-02-07 20:21:47,755 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1513 transitions. Word has length 966 [2025-02-07 20:21:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:47,756 INFO L471 AbstractCegarLoop]: Abstraction has 1315 states and 1513 transitions. [2025-02-07 20:21:47,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 18 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2025-02-07 20:21:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1513 transitions. [2025-02-07 20:21:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2067 [2025-02-07 20:21:47,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:47,794 INFO L218 NwaCegarLoop]: trace histogram [191, 190, 190, 180, 180, 180, 180, 180, 180, 180, 180, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-02-07 20:21:47,800 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-07 20:21:47,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-07 20:21:47,994 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:47,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:47,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2028882793, now seen corresponding path program 4 times [2025-02-07 20:21:47,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:47,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149406550] [2025-02-07 20:21:47,995 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:21:47,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:48,034 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2066 statements into 2 equivalence classes. [2025-02-07 20:21:48,742 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2066 of 2066 statements. [2025-02-07 20:21:48,743 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 20:21:48,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:53,486 INFO L134 CoverageAnalysis]: Checked inductivity of 186960 backedges. 21153 proven. 1089 refuted. 0 times theorem prover too weak. 164718 trivial. 0 not checked. [2025-02-07 20:21:53,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:53,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149406550] [2025-02-07 20:21:53,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149406550] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:21:53,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373508788] [2025-02-07 20:21:53,486 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:21:53,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:53,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:21:53,488 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-07 20:21:53,490 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-07 20:21:53,627 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2066 statements into 2 equivalence classes. [2025-02-07 20:21:53,955 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2066 of 2066 statements. [2025-02-07 20:21:53,955 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 20:21:53,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:53,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 3789 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-07 20:21:53,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:21:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 186960 backedges. 380 proven. 104763 refuted. 0 times theorem prover too weak. 81817 trivial. 0 not checked. [2025-02-07 20:21:55,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:21:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 186960 backedges. 948 proven. 104195 refuted. 0 times theorem prover too weak. 81817 trivial. 0 not checked. [2025-02-07 20:21:58,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373508788] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:21:58,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:21:58,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 24] total 65 [2025-02-07 20:21:58,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608969386] [2025-02-07 20:21:58,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:21:58,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-02-07 20:21:58,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:58,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-02-07 20:21:58,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=3487, Unknown=0, NotChecked=0, Total=4160 [2025-02-07 20:21:58,149 INFO L87 Difference]: Start difference. First operand 1315 states and 1513 transitions. Second operand has 65 states, 65 states have (on average 6.676923076923077) internal successors, (434), 65 states have internal predecessors, (434), 60 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (81), 60 states have call predecessors, (81), 60 states have call successors, (81)