./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.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/nla-digbench-scaling/dijkstra-u_unwindbound10.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 26517bdd67184dea6352cf50b6d9992d41ecfd853675bfc685354b90b7b5bf40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:28:30,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:28:30,700 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:28:30,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:28:30,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:28:30,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:28:30,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:28:30,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:28:30,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:28:30,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:28:30,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:28:30,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:28:30,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:28:30,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:28:30,730 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:28:30,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:28:30,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:28:30,730 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:28:30,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:28:30,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:28:30,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:28:30,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:28:30,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:28:30,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:28:30,730 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:28:30,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:28:30,730 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:28:30,730 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:28:30,730 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:28:30,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:28:30,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:28:30,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:28:30,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:28:30,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:28:30,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:28:30,731 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:28:30,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:28:30,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:28:30,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:28:30,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:28:30,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:28:30,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:28:30,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:28:30,731 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 -> 26517bdd67184dea6352cf50b6d9992d41ecfd853675bfc685354b90b7b5bf40 [2025-02-07 20:28:30,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:28:30,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:28:30,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:28:30,962 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:28:30,962 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:28:30,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2025-02-07 20:28:32,135 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f4704718/0097bf2ece7c47708ae658325520287f/FLAG94db2e635 [2025-02-07 20:28:32,357 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:28:32,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2025-02-07 20:28:32,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f4704718/0097bf2ece7c47708ae658325520287f/FLAG94db2e635 [2025-02-07 20:28:32,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f4704718/0097bf2ece7c47708ae658325520287f [2025-02-07 20:28:32,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:28:32,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:28:32,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:28:32,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:28:32,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:28:32,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:28:32" (1/1) ... [2025-02-07 20:28:32,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ef33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:32, skipping insertion in model container [2025-02-07 20:28:32,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:28:32" (1/1) ... [2025-02-07 20:28:32,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:28:32,840 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.c[525,538] [2025-02-07 20:28:32,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:28:32,865 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:28:32,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.c[525,538] [2025-02-07 20:28:32,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:28:32,910 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:28:32,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:32 WrapperNode [2025-02-07 20:28:32,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:28:32,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:28:32,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:28:32,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:28:32,917 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:28:32" (1/1) ... [2025-02-07 20:28:32,924 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:28:32" (1/1) ... [2025-02-07 20:28:32,938 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-02-07 20:28:32,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:28:32,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:28:32,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:28:32,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:28:32,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:32" (1/1) ... [2025-02-07 20:28:32,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:32" (1/1) ... [2025-02-07 20:28:32,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:32" (1/1) ... [2025-02-07 20:28:32,960 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:28:32,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:32" (1/1) ... [2025-02-07 20:28:32,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:32" (1/1) ... [2025-02-07 20:28:32,962 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:32" (1/1) ... [2025-02-07 20:28:32,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:32" (1/1) ... [2025-02-07 20:28:32,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:32" (1/1) ... [2025-02-07 20:28:32,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:32" (1/1) ... [2025-02-07 20:28:32,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:28:32,965 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:28:32,965 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:28:32,965 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:28:32,966 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:32" (1/1) ... [2025-02-07 20:28:32,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:28:32,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:28:32,994 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:28:32,996 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:28:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:28:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:28:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:28:33,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:28:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 20:28:33,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 20:28:33,053 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:28:33,058 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:28:33,235 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-07 20:28:33,235 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:28:33,248 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:28:33,248 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:28:33,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:28:33 BoogieIcfgContainer [2025-02-07 20:28:33,249 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:28:33,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:28:33,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:28:33,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:28:33,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:28:32" (1/3) ... [2025-02-07 20:28:33,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53497ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:28:33, skipping insertion in model container [2025-02-07 20:28:33,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:28:32" (2/3) ... [2025-02-07 20:28:33,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53497ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:28:33, skipping insertion in model container [2025-02-07 20:28:33,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:28:33" (3/3) ... [2025-02-07 20:28:33,257 INFO L128 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound10.c [2025-02-07 20:28:33,268 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:28:33,270 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dijkstra-u_unwindbound10.c that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 20:28:33,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:28:33,317 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;@5e010de0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:28:33,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:28:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 20:28:33,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:28:33,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:33,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:33,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:33,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:33,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1518983890, now seen corresponding path program 1 times [2025-02-07 20:28:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:33,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384221103] [2025-02-07 20:28:33,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:33,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:28:33,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:28:33,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:33,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:33,439 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:28:33,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:33,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384221103] [2025-02-07 20:28:33,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384221103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:28:33,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:28:33,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:28:33,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49943372] [2025-02-07 20:28:33,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:28:33,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:28:33,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:33,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:28:33,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:28:33,467 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:28:33,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:28:33,494 INFO L93 Difference]: Finished difference Result 54 states and 94 transitions. [2025-02-07 20:28:33,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:28:33,495 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2025-02-07 20:28:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:28:33,503 INFO L225 Difference]: With dead ends: 54 [2025-02-07 20:28:33,504 INFO L226 Difference]: Without dead ends: 25 [2025-02-07 20:28:33,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:28:33,510 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:28:33,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:28:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-07 20:28:33,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-07 20:28:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-07 20:28:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2025-02-07 20:28:33,538 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 9 [2025-02-07 20:28:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:28:33,538 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2025-02-07 20:28:33,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:28:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2025-02-07 20:28:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 20:28:33,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:33,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:33,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:28:33,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:33,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:33,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1098429594, now seen corresponding path program 1 times [2025-02-07 20:28:33,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:33,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041316537] [2025-02-07 20:28:33,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:33,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:33,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 20:28:33,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 20:28:33,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:33,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:33,597 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:28:33,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:33,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041316537] [2025-02-07 20:28:33,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041316537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:28:33,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:28:33,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:28:33,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178204250] [2025-02-07 20:28:33,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:28:33,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:28:33,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:33,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:28:33,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:28:33,600 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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:28:33,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:28:33,625 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2025-02-07 20:28:33,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:28:33,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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:28:33,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:28:33,626 INFO L225 Difference]: With dead ends: 46 [2025-02-07 20:28:33,626 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 20:28:33,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:28:33,627 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:28:33,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:28:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 20:28:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-07 20:28:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-07 20:28:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2025-02-07 20:28:33,632 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 11 [2025-02-07 20:28:33,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:28:33,632 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2025-02-07 20:28:33,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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:28:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2025-02-07 20:28:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:28:33,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:33,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:33,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:28:33,633 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:33,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:33,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1249900870, now seen corresponding path program 1 times [2025-02-07 20:28:33,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:33,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572935669] [2025-02-07 20:28:33,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:33,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:33,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 20:28:33,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:28:33,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:33,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:33,923 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:28:33,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:33,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572935669] [2025-02-07 20:28:33,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572935669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:28:33,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:28:33,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:28:33,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290366465] [2025-02-07 20:28:33,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:28:33,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:28:33,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:33,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:28:33,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:28:33,928 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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:28:35,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:28:35,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:28:35,078 INFO L93 Difference]: Finished difference Result 63 states and 96 transitions. [2025-02-07 20:28:35,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:28:35,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 12 [2025-02-07 20:28:35,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:28:35,079 INFO L225 Difference]: With dead ends: 63 [2025-02-07 20:28:35,079 INFO L226 Difference]: Without dead ends: 44 [2025-02-07 20:28:35,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:28:35,080 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:28:35,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 138 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 20:28:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-07 20:28:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2025-02-07 20:28:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-07 20:28:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2025-02-07 20:28:35,088 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 12 [2025-02-07 20:28:35,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:28:35,088 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2025-02-07 20:28:35,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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:28:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2025-02-07 20:28:35,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:28:35,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:35,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:35,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:28:35,089 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:35,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:35,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1250466899, now seen corresponding path program 1 times [2025-02-07 20:28:35,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:35,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136839219] [2025-02-07 20:28:35,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:35,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:35,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 20:28:35,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:28:35,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:35,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:35,134 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:28:35,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:35,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136839219] [2025-02-07 20:28:35,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136839219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:28:35,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:28:35,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:28:35,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855169156] [2025-02-07 20:28:35,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:28:35,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:28:35,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:35,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:28:35,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:28:35,135 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (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:28:35,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:28:35,159 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2025-02-07 20:28:35,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:28:35,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (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 12 [2025-02-07 20:28:35,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:28:35,161 INFO L225 Difference]: With dead ends: 51 [2025-02-07 20:28:35,162 INFO L226 Difference]: Without dead ends: 42 [2025-02-07 20:28:35,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:28:35,162 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:28:35,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 128 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:28:35,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-07 20:28:35,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-02-07 20:28:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-07 20:28:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2025-02-07 20:28:35,177 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 12 [2025-02-07 20:28:35,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:28:35,177 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-02-07 20:28:35,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (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:28:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2025-02-07 20:28:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:28:35,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:35,178 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:35,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:28:35,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:35,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:35,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1378941817, now seen corresponding path program 1 times [2025-02-07 20:28:35,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:35,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306241913] [2025-02-07 20:28:35,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:35,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:35,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:28:35,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:28:35,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:35,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:35,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:35,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306241913] [2025-02-07 20:28:35,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306241913] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:28:35,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908510261] [2025-02-07 20:28:35,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:35,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:28:35,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:28:35,231 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:28:35,236 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:28:35,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:28:35,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:28:35,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:35,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:35,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:28:35,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:28:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:35,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:28:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:35,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908510261] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:28:35,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:28:35,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-07 20:28:35,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363132715] [2025-02-07 20:28:35,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:28:35,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:28:35,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:35,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:28:35,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:28:35,319 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:28:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:28:35,560 INFO L93 Difference]: Finished difference Result 97 states and 141 transitions. [2025-02-07 20:28:35,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 20:28:35,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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 14 [2025-02-07 20:28:35,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:28:35,561 INFO L225 Difference]: With dead ends: 97 [2025-02-07 20:28:35,561 INFO L226 Difference]: Without dead ends: 78 [2025-02-07 20:28:35,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:28:35,562 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 58 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:28:35,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 175 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:28:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-07 20:28:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2025-02-07 20:28:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 36 states have internal predecessors, (44), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-07 20:28:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2025-02-07 20:28:35,571 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 14 [2025-02-07 20:28:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:28:35,571 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2025-02-07 20:28:35,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:28:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2025-02-07 20:28:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:28:35,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:35,571 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:35,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 20:28:35,772 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:28:35,772 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:35,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:35,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1143956549, now seen corresponding path program 1 times [2025-02-07 20:28:35,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:35,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842565881] [2025-02-07 20:28:35,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:35,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:35,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:28:35,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:28:35,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:35,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:35,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:35,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842565881] [2025-02-07 20:28:35,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842565881] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:28:35,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692988778] [2025-02-07 20:28:35,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:35,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:28:35,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:28:35,970 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:28:35,975 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:28:35,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:28:36,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:28:36,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:36,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:36,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 20:28:36,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:28:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:36,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:28:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:36,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692988778] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:28:36,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:28:36,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-07 20:28:36,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91562091] [2025-02-07 20:28:36,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:28:36,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 20:28:36,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:36,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 20:28:36,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-07 20:28:36,310 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:28:40,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:28:44,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:28:49,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 20:28:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:28:49,432 INFO L93 Difference]: Finished difference Result 145 states and 229 transitions. [2025-02-07 20:28:49,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 20:28:49,434 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-07 20:28:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:28:49,435 INFO L225 Difference]: With dead ends: 145 [2025-02-07 20:28:49,435 INFO L226 Difference]: Without dead ends: 122 [2025-02-07 20:28:49,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-02-07 20:28:49,436 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 57 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 156 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:28:49,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 240 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 174 Invalid, 3 Unknown, 0 Unchecked, 13.0s Time] [2025-02-07 20:28:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-07 20:28:49,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 87. [2025-02-07 20:28:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 53 states have internal predecessors, (63), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-07 20:28:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2025-02-07 20:28:49,458 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 15 [2025-02-07 20:28:49,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:28:49,458 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2025-02-07 20:28:49,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:28:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2025-02-07 20:28:49,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:28:49,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:49,460 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:49,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 20:28:49,664 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:28:49,664 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:49,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:49,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1144522578, now seen corresponding path program 1 times [2025-02-07 20:28:49,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:49,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446346749] [2025-02-07 20:28:49,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:49,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:49,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:28:49,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:28:49,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:49,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:49,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:49,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446346749] [2025-02-07 20:28:49,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446346749] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:28:49,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859904991] [2025-02-07 20:28:49,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:49,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:28:49,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:28:49,723 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:28:49,728 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:28:49,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:28:49,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:28:49,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:49,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:49,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 20:28:49,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:28:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:49,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:28:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:49,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859904991] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:28:49,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:28:49,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-07 20:28:49,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671968641] [2025-02-07 20:28:49,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:28:49,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 20:28:49,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:49,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 20:28:49,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:28:49,824 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:28:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:28:50,283 INFO L93 Difference]: Finished difference Result 169 states and 231 transitions. [2025-02-07 20:28:50,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 20:28:50,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 15 [2025-02-07 20:28:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:28:50,290 INFO L225 Difference]: With dead ends: 169 [2025-02-07 20:28:50,290 INFO L226 Difference]: Without dead ends: 159 [2025-02-07 20:28:50,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-02-07 20:28:50,291 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 139 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 20:28:50,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 197 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 20:28:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-07 20:28:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2025-02-07 20:28:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 94 states have internal predecessors, (109), 51 states have call successors, (51), 11 states have call predecessors, (51), 11 states have return successors, (47), 44 states have call predecessors, (47), 47 states have call successors, (47) [2025-02-07 20:28:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 207 transitions. [2025-02-07 20:28:50,306 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 207 transitions. Word has length 15 [2025-02-07 20:28:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:28:50,306 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 207 transitions. [2025-02-07 20:28:50,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:28:50,306 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 207 transitions. [2025-02-07 20:28:50,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 20:28:50,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:50,307 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:50,316 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:28:50,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:28:50,507 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:50,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:50,508 INFO L85 PathProgramCache]: Analyzing trace with hash -713396090, now seen corresponding path program 1 times [2025-02-07 20:28:50,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:50,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640904176] [2025-02-07 20:28:50,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:50,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:50,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:28:50,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:28:50,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:50,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:28:50,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1898262863] [2025-02-07 20:28:50,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:50,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:28:50,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:28:50,536 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:28:50,540 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:28:50,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:28:50,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:28:50,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:50,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:50,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 20:28:50,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:28:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:28:50,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:28:50,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:50,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640904176] [2025-02-07 20:28:50,618 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:28:50,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898262863] [2025-02-07 20:28:50,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898262863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:28:50,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:28:50,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:28:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256960663] [2025-02-07 20:28:50,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:28:50,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:28:50,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:50,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:28:50,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:28:50,619 INFO L87 Difference]: Start difference. First operand 150 states and 207 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:28:50,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:28:50,695 INFO L93 Difference]: Finished difference Result 208 states and 288 transitions. [2025-02-07 20:28:50,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:28:50,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-02-07 20:28:50,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:28:50,697 INFO L225 Difference]: With dead ends: 208 [2025-02-07 20:28:50,697 INFO L226 Difference]: Without dead ends: 200 [2025-02-07 20:28:50,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:28:50,698 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:28:50,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:28:50,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-07 20:28:50,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-02-07 20:28:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 111 states have (on average 1.2162162162162162) internal successors, (135), 118 states have internal predecessors, (135), 72 states have call successors, (72), 17 states have call predecessors, (72), 16 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-07 20:28:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 272 transitions. [2025-02-07 20:28:50,723 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 272 transitions. Word has length 22 [2025-02-07 20:28:50,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:28:50,724 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 272 transitions. [2025-02-07 20:28:50,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:28:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 272 transitions. [2025-02-07 20:28:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:28:50,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:28:50,724 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:28:50,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 20:28:50,925 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,SelfDestructingSolverStorable7 [2025-02-07 20:28:50,925 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:28:50,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:28:50,925 INFO L85 PathProgramCache]: Analyzing trace with hash 994370494, now seen corresponding path program 1 times [2025-02-07 20:28:50,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:28:50,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8421193] [2025-02-07 20:28:50,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:50,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:28:50,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:28:50,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:28:50,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:50,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:28:50,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [63243166] [2025-02-07 20:28:50,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:28:50,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:28:50,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:28:50,968 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:28:50,970 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:28:50,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:28:51,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:28:51,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:28:51,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:28:51,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 20:28:51,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:28:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:51,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:28:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:28:51,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:28:51,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8421193] [2025-02-07 20:28:51,719 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:28:51,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63243166] [2025-02-07 20:28:51,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63243166] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:28:51,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:28:51,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-02-07 20:28:51,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124482964] [2025-02-07 20:28:51,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:28:51,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 20:28:51,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:28:51,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 20:28:51,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:28:51,721 INFO L87 Difference]: Start difference. First operand 200 states and 272 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:28:57,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:28:59,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:02,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:04,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:06,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:10,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:15,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:19,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:23,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:27,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:31,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:35,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:40,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:29:41,727 INFO L93 Difference]: Finished difference Result 286 states and 387 transitions. [2025-02-07 20:29:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:29:41,727 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-02-07 20:29:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:29:41,728 INFO L225 Difference]: With dead ends: 286 [2025-02-07 20:29:41,728 INFO L226 Difference]: Without dead ends: 250 [2025-02-07 20:29:41,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:29:41,729 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 65 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:29:41,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 324 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 195 Invalid, 8 Unknown, 0 Unchecked, 48.5s Time] [2025-02-07 20:29:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-07 20:29:41,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 242. [2025-02-07 20:29:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 137 states have (on average 1.1824817518248176) internal successors, (162), 143 states have internal predecessors, (162), 82 states have call successors, (82), 23 states have call predecessors, (82), 22 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-02-07 20:29:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 320 transitions. [2025-02-07 20:29:41,753 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 320 transitions. Word has length 23 [2025-02-07 20:29:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:29:41,754 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 320 transitions. [2025-02-07 20:29:41,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:29:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 320 transitions. [2025-02-07 20:29:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:29:41,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:29:41,755 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:29:41,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 20:29:41,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:29:41,959 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:29:41,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:29:41,959 INFO L85 PathProgramCache]: Analyzing trace with hash 715539494, now seen corresponding path program 2 times [2025-02-07 20:29:41,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:29:41,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098427911] [2025-02-07 20:29:41,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:29:41,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:29:41,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-07 20:29:41,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 23 statements. [2025-02-07 20:29:41,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 20:29:41,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:29:42,020 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-07 20:29:42,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:29:42,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098427911] [2025-02-07 20:29:42,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098427911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:29:42,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:29:42,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:29:42,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308851512] [2025-02-07 20:29:42,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:29:42,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:29:42,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:29:42,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:29:42,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:29:42,022 INFO L87 Difference]: Start difference. First operand 242 states and 320 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:29:42,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:29:42,067 INFO L93 Difference]: Finished difference Result 289 states and 381 transitions. [2025-02-07 20:29:42,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:29:42,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 23 [2025-02-07 20:29:42,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:29:42,071 INFO L225 Difference]: With dead ends: 289 [2025-02-07 20:29:42,071 INFO L226 Difference]: Without dead ends: 249 [2025-02-07 20:29:42,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:29:42,071 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:29:42,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:29:42,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-07 20:29:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 244. [2025-02-07 20:29:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 138 states have (on average 1.1666666666666667) internal successors, (161), 144 states have internal predecessors, (161), 82 states have call successors, (82), 24 states have call predecessors, (82), 23 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-02-07 20:29:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 319 transitions. [2025-02-07 20:29:42,110 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 319 transitions. Word has length 23 [2025-02-07 20:29:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:29:42,110 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 319 transitions. [2025-02-07 20:29:42,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:29:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 319 transitions. [2025-02-07 20:29:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 20:29:42,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:29:42,111 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:29:42,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 20:29:42,111 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:29:42,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:29:42,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2120677360, now seen corresponding path program 1 times [2025-02-07 20:29:42,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:29:42,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429335656] [2025-02-07 20:29:42,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:29:42,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:29:42,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 20:29:42,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 20:29:42,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:29:42,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:29:42,213 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:29:42,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:29:42,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429335656] [2025-02-07 20:29:42,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429335656] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:29:42,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94167801] [2025-02-07 20:29:42,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:29:42,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:29:42,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:29:42,217 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:29:42,218 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:29:42,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 20:29:42,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 20:29:42,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:29:42,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:29:42,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 20:29:42,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:29:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:29:42,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:29:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:29:42,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94167801] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:29:42,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:29:42,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2025-02-07 20:29:42,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343010785] [2025-02-07 20:29:42,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:29:42,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 20:29:42,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:29:42,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 20:29:42,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-07 20:29:42,383 INFO L87 Difference]: Start difference. First operand 244 states and 319 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:29:44,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 20:29:48,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:29:52,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 20:29:56,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:30:00,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:30:04,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:30:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:30:04,746 INFO L93 Difference]: Finished difference Result 445 states and 587 transitions. [2025-02-07 20:30:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-07 20:30:04,746 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-02-07 20:30:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:30:04,748 INFO L225 Difference]: With dead ends: 445 [2025-02-07 20:30:04,748 INFO L226 Difference]: Without dead ends: 433 [2025-02-07 20:30:04,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=321, Unknown=0, NotChecked=0, Total=506 [2025-02-07 20:30:04,749 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 240 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 50 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:30:04,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 232 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 184 Invalid, 5 Unknown, 0 Unchecked, 22.2s Time] [2025-02-07 20:30:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-02-07 20:30:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 293. [2025-02-07 20:30:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 166 states have (on average 1.180722891566265) internal successors, (196), 174 states have internal predecessors, (196), 99 states have call successors, (99), 28 states have call predecessors, (99), 27 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-07 20:30:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 386 transitions. [2025-02-07 20:30:04,799 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 386 transitions. Word has length 31 [2025-02-07 20:30:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:30:04,799 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 386 transitions. [2025-02-07 20:30:04,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:30:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 386 transitions. [2025-02-07 20:30:04,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-07 20:30:04,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:30:04,800 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:30:04,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 20:30:05,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-07 20:30:05,001 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:30:05,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:30:05,002 INFO L85 PathProgramCache]: Analyzing trace with hash 220689810, now seen corresponding path program 1 times [2025-02-07 20:30:05,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:30:05,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043043270] [2025-02-07 20:30:05,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:30:05,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:30:05,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 20:30:05,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 20:30:05,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:30:05,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:30:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:30:05,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:30:05,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043043270] [2025-02-07 20:30:05,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043043270] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:30:05,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247169990] [2025-02-07 20:30:05,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:30:05,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:30:05,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:30:05,151 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:30:05,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 20:30:05,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 20:30:05,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 20:30:05,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:30:05,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:30:05,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-07 20:30:05,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:30:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:30:05,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:30:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:30:05,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247169990] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:30:05,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:30:05,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 14 [2025-02-07 20:30:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551140629] [2025-02-07 20:30:05,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:30:05,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 20:30:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:30:05,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 20:30:05,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-07 20:30:05,321 INFO L87 Difference]: Start difference. First operand 293 states and 386 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:30:10,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:30:14,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:30:18,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []