./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7520cfa04676a157cc3b0d71c42a9ed73acdf0d120a939e33f1a3e61a093ef11 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:58:54,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:58:54,080 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:58:54,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:58:54,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:58:54,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:58:54,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:58:54,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:58:54,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:58:54,111 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:58:54,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:58:54,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:58:54,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:58:54,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:58:54,112 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:58:54,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:58:54,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:58:54,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:58:54,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:58:54,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:58:54,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:58:54,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:58:54,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:58:54,112 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:58:54,112 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:58:54,112 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:58:54,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:58:54,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:58:54,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:58:54,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:58:54,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:58:54,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:58:54,113 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:58:54,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:58:54,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:58:54,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:58:54,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:58:54,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:58:54,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:58:54,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:58:54,113 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7520cfa04676a157cc3b0d71c42a9ed73acdf0d120a939e33f1a3e61a093ef11 [2025-02-07 22:58:54,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:58:54,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:58:54,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:58:54,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:58:54,387 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:58:54,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c [2025-02-07 22:58:55,486 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e53fe74af/f3ae4f4230b14db7bdb774af28b249c2/FLAG0ee4a0550 [2025-02-07 22:58:55,729 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:58:55,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c [2025-02-07 22:58:55,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e53fe74af/f3ae4f4230b14db7bdb774af28b249c2/FLAG0ee4a0550 [2025-02-07 22:58:56,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e53fe74af/f3ae4f4230b14db7bdb774af28b249c2 [2025-02-07 22:58:56,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:58:56,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:58:56,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:58:56,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:58:56,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:58:56,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:58:56" (1/1) ... [2025-02-07 22:58:56,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e7e311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:56, skipping insertion in model container [2025-02-07 22:58:56,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:58:56" (1/1) ... [2025-02-07 22:58:56,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:58:56,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c[1256,1269] [2025-02-07 22:58:56,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:58:56,164 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:58:56,170 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c[1256,1269] [2025-02-07 22:58:56,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:58:56,183 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:58:56,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:56 WrapperNode [2025-02-07 22:58:56,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:58:56,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:58:56,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:58:56,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:58:56,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:56" (1/1) ... [2025-02-07 22:58:56,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:56" (1/1) ... [2025-02-07 22:58:56,204 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2025-02-07 22:58:56,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:58:56,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:58:56,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:58:56,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:58:56,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:56" (1/1) ... [2025-02-07 22:58:56,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:56" (1/1) ... [2025-02-07 22:58:56,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:56" (1/1) ... [2025-02-07 22:58:56,218 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 22:58:56,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:56" (1/1) ... [2025-02-07 22:58:56,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:56" (1/1) ... [2025-02-07 22:58:56,220 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:56" (1/1) ... [2025-02-07 22:58:56,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:56" (1/1) ... [2025-02-07 22:58:56,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:56" (1/1) ... [2025-02-07 22:58:56,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:56" (1/1) ... [2025-02-07 22:58:56,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:58:56,223 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:58:56,223 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:58:56,223 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:58:56,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:56" (1/1) ... [2025-02-07 22:58:56,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:58:56,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:58:56,244 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 22:58:56,249 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 22:58:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:58:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:58:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:58:56,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:58:56,298 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:58:56,299 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:58:56,425 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-07 22:58:56,426 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:58:56,439 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:58:56,439 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:58:56,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:58:56 BoogieIcfgContainer [2025-02-07 22:58:56,440 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:58:56,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:58:56,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:58:56,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:58:56,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:58:56" (1/3) ... [2025-02-07 22:58:56,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ce1d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:58:56, skipping insertion in model container [2025-02-07 22:58:56,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:56" (2/3) ... [2025-02-07 22:58:56,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ce1d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:58:56, skipping insertion in model container [2025-02-07 22:58:56,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:58:56" (3/3) ... [2025-02-07 22:58:56,450 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.count4.c [2025-02-07 22:58:56,469 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:58:56,470 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.count4.c that has 1 procedures, 16 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:58:56,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:58:56,522 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;@5cc2ae8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:58:56,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:58:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:58:56,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 22:58:56,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:56,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 22:58:56,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:56,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1502998585, now seen corresponding path program 1 times [2025-02-07 22:58:56,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:56,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819586393] [2025-02-07 22:58:56,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:56,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:56,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 22:58:56,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 22:58:56,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:56,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:56,904 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 22:58:56,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:56,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819586393] [2025-02-07 22:58:56,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819586393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:56,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:56,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:56,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137883098] [2025-02-07 22:58:56,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:56,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:58:56,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:56,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:58:56,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:58:56,925 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:58:57,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:57,001 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2025-02-07 22:58:57,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:58:57,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-07 22:58:57,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:57,010 INFO L225 Difference]: With dead ends: 28 [2025-02-07 22:58:57,011 INFO L226 Difference]: Without dead ends: 17 [2025-02-07 22:58:57,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:58:57,015 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:57,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 29 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:58:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-07 22:58:57,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-02-07 22:58:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:58:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-02-07 22:58:57,040 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 6 [2025-02-07 22:58:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:57,040 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-02-07 22:58:57,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:58:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-02-07 22:58:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 22:58:57,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:57,041 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:58:57,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 22:58:57,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:57,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:57,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2038278903, now seen corresponding path program 1 times [2025-02-07 22:58:57,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:57,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378333771] [2025-02-07 22:58:57,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:57,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 22:58:57,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 22:58:57,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:57,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:57,261 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 22:58:57,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:57,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378333771] [2025-02-07 22:58:57,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378333771] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:58:57,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798317865] [2025-02-07 22:58:57,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:57,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:58:57,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:58:57,264 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 22:58:57,265 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 22:58:57,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 22:58:57,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 22:58:57,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:57,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:57,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-07 22:58:57,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:58:57,472 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 22:58:57,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:58:57,624 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 22:58:57,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798317865] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:58:57,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:58:57,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 13 [2025-02-07 22:58:57,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237767017] [2025-02-07 22:58:57,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:58:57,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 22:58:57,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:57,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 22:58:57,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-07 22:58:57,628 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:58:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:57,760 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2025-02-07 22:58:57,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:58:57,760 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 22:58:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:57,761 INFO L225 Difference]: With dead ends: 22 [2025-02-07 22:58:57,761 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 22:58:57,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-02-07 22:58:57,762 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 40 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:57,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 15 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:58:57,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 22:58:57,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2025-02-07 22:58:57,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:58:57,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-02-07 22:58:57,764 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2025-02-07 22:58:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:57,764 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-02-07 22:58:57,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:58:57,765 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-02-07 22:58:57,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 22:58:57,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:57,765 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:58:57,775 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 22:58:57,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:58:57,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:57,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:57,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1093226179, now seen corresponding path program 1 times [2025-02-07 22:58:57,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:57,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777207892] [2025-02-07 22:58:57,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:57,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:57,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 22:58:57,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 22:58:57,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:57,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:58,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:58:58,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:58,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777207892] [2025-02-07 22:58:58,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777207892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:58,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:58,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:58:58,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404423445] [2025-02-07 22:58:58,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:58,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:58,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:58,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:58,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:58,060 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:58:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:58,093 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-02-07 22:58:58,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:58:58,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-07 22:58:58,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:58,094 INFO L225 Difference]: With dead ends: 35 [2025-02-07 22:58:58,094 INFO L226 Difference]: Without dead ends: 23 [2025-02-07 22:58:58,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:58,095 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:58,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 16 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:58:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-07 22:58:58,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-02-07 22:58:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:58:58,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-02-07 22:58:58,098 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 12 [2025-02-07 22:58:58,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:58,098 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-02-07 22:58:58,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:58:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2025-02-07 22:58:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 22:58:58,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:58,098 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:58:58,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:58:58,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:58,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash 575576205, now seen corresponding path program 1 times [2025-02-07 22:58:58,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:58,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885410011] [2025-02-07 22:58:58,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:58,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:58,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 22:58:58,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 22:58:58,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:58,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:58,478 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 22:58:58,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:58,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885410011] [2025-02-07 22:58:58,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885410011] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:58:58,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026625953] [2025-02-07 22:58:58,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:58,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:58:58,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:58:58,481 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 22:58:58,481 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 22:58:58,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 22:58:58,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 22:58:58,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:58,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:58,537 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-07 22:58:58,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:58:59,000 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 22:58:59,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:58:59,677 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 22:58:59,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026625953] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:58:59,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:58:59,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 21 [2025-02-07 22:58:59,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367256701] [2025-02-07 22:58:59,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:58:59,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-07 22:58:59,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:59,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-07 22:58:59,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2025-02-07 22:58:59,678 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:58:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:59,839 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-02-07 22:58:59,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:58:59,840 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-07 22:58:59,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:59,840 INFO L225 Difference]: With dead ends: 39 [2025-02-07 22:58:59,841 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 22:58:59,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2025-02-07 22:58:59,842 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:59,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 38 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:58:59,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 22:58:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2025-02-07 22:58:59,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:58:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-02-07 22:58:59,845 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2025-02-07 22:58:59,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:59,845 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-02-07 22:58:59,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:58:59,845 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-02-07 22:58:59,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 22:58:59,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:59,848 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:58:59,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 22:59:00,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:00,052 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:00,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1879258479, now seen corresponding path program 1 times [2025-02-07 22:59:00,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:00,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185966312] [2025-02-07 22:59:00,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:00,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:00,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 22:59:00,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 22:59:00,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:00,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:00,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:00,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185966312] [2025-02-07 22:59:00,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185966312] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:59:00,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388191557] [2025-02-07 22:59:00,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:00,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:00,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:00,296 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 22:59:00,302 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 22:59:00,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 22:59:00,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 22:59:00,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:00,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:00,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-07 22:59:00,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:00,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:59:00,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:00,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388191557] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:59:00,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:59:00,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 22 [2025-02-07 22:59:00,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073546981] [2025-02-07 22:59:00,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:59:00,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 22:59:00,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:00,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 22:59:00,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2025-02-07 22:59:00,861 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:01,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:01,009 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-02-07 22:59:01,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 22:59:01,010 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-07 22:59:01,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:01,010 INFO L225 Difference]: With dead ends: 50 [2025-02-07 22:59:01,010 INFO L226 Difference]: Without dead ends: 38 [2025-02-07 22:59:01,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2025-02-07 22:59:01,011 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:01,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:59:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-07 22:59:01,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-02-07 22:59:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-02-07 22:59:01,018 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 19 [2025-02-07 22:59:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:01,018 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-02-07 22:59:01,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-02-07 22:59:01,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 22:59:01,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:01,019 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-07 22:59:01,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 22:59:01,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:01,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:01,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:01,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1978378681, now seen corresponding path program 2 times [2025-02-07 22:59:01,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:01,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627311993] [2025-02-07 22:59:01,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 22:59:01,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:01,232 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-07 22:59:01,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 22:59:01,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 22:59:01,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:01,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:01,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627311993] [2025-02-07 22:59:01,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627311993] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:59:01,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973695241] [2025-02-07 22:59:01,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 22:59:01,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:01,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:01,676 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 22:59:01,682 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 22:59:01,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-07 22:59:01,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 22:59:01,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 22:59:01,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:01,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-07 22:59:01,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:02,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:59:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:03,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973695241] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:59:03,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:59:03,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 35 [2025-02-07 22:59:03,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269733591] [2025-02-07 22:59:03,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:59:03,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-07 22:59:03,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:03,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-07 22:59:03,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1125, Unknown=0, NotChecked=0, Total=1260 [2025-02-07 22:59:03,852 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 36 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:04,474 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2025-02-07 22:59:04,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 22:59:04,474 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-07 22:59:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:04,474 INFO L225 Difference]: With dead ends: 43 [2025-02-07 22:59:04,474 INFO L226 Difference]: Without dead ends: 41 [2025-02-07 22:59:04,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=245, Invalid=1825, Unknown=0, NotChecked=0, Total=2070 [2025-02-07 22:59:04,476 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:04,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 39 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:59:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-07 22:59:04,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2025-02-07 22:59:04,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-02-07 22:59:04,481 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 20 [2025-02-07 22:59:04,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:04,482 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-02-07 22:59:04,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-02-07 22:59:04,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 22:59:04,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:04,483 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:59:04,489 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 22:59:04,683 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,SelfDestructingSolverStorable5 [2025-02-07 22:59:04,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:04,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:04,685 INFO L85 PathProgramCache]: Analyzing trace with hash 625622011, now seen corresponding path program 1 times [2025-02-07 22:59:04,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:04,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441119569] [2025-02-07 22:59:04,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:04,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:04,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 22:59:04,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 22:59:04,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:04,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 22:59:04,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:04,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441119569] [2025-02-07 22:59:04,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441119569] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:59:04,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626538338] [2025-02-07 22:59:04,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:04,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:04,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:04,811 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 22:59:04,831 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 22:59:04,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 22:59:04,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 22:59:04,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:04,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:04,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-07 22:59:04,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:59:05,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:59:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-07 22:59:05,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626538338] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:59:05,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:59:05,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 9] total 19 [2025-02-07 22:59:05,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69771445] [2025-02-07 22:59:05,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:59:05,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 22:59:05,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:05,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 22:59:05,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-02-07 22:59:05,230 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:05,340 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2025-02-07 22:59:05,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 22:59:05,340 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-07 22:59:05,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:05,340 INFO L225 Difference]: With dead ends: 64 [2025-02-07 22:59:05,340 INFO L226 Difference]: Without dead ends: 52 [2025-02-07 22:59:05,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2025-02-07 22:59:05,341 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:05,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 17 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:59:05,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-07 22:59:05,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-02-07 22:59:05,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:05,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-02-07 22:59:05,345 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 31 [2025-02-07 22:59:05,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:05,345 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-02-07 22:59:05,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-02-07 22:59:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-07 22:59:05,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:05,346 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-07 22:59:05,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 22:59:05,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:05,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:05,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:05,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1974704753, now seen corresponding path program 1 times [2025-02-07 22:59:05,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:05,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373317512] [2025-02-07 22:59:05,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:05,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:05,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 22:59:05,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 22:59:05,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:05,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 22:59:05,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:05,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373317512] [2025-02-07 22:59:05,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373317512] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:59:05,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852863091] [2025-02-07 22:59:05,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:05,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:05,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:05,721 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 22:59:05,722 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 22:59:05,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 22:59:05,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 22:59:05,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:05,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:05,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-07 22:59:05,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 22:59:06,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:59:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 22:59:12,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852863091] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:59:12,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:59:12,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 13] total 26 [2025-02-07 22:59:12,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839796120] [2025-02-07 22:59:12,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:59:12,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 22:59:12,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:12,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 22:59:12,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2025-02-07 22:59:12,403 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 27 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:12,556 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-02-07 22:59:12,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 22:59:12,556 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-07 22:59:12,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:12,557 INFO L225 Difference]: With dead ends: 65 [2025-02-07 22:59:12,557 INFO L226 Difference]: Without dead ends: 43 [2025-02-07 22:59:12,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2025-02-07 22:59:12,558 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:12,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 25 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:59:12,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-07 22:59:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2025-02-07 22:59:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2025-02-07 22:59:12,561 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 32 [2025-02-07 22:59:12,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:12,561 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2025-02-07 22:59:12,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2025-02-07 22:59:12,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 22:59:12,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:12,561 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-07 22:59:12,569 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 22:59:12,766 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,SelfDestructingSolverStorable7 [2025-02-07 22:59:12,766 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:12,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:12,767 INFO L85 PathProgramCache]: Analyzing trace with hash 459309329, now seen corresponding path program 2 times [2025-02-07 22:59:12,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:12,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194024289] [2025-02-07 22:59:12,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 22:59:12,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:12,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-07 22:59:12,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 22:59:12,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 22:59:12,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:13,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:13,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194024289] [2025-02-07 22:59:13,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194024289] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:59:13,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833645677] [2025-02-07 22:59:13,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 22:59:13,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:13,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:13,231 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 22:59:13,232 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 22:59:13,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-07 22:59:13,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 22:59:13,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 22:59:13,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:13,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-02-07 22:59:13,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:13,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:59:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:14,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833645677] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:59:14,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:59:14,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 17] total 36 [2025-02-07 22:59:14,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840572285] [2025-02-07 22:59:14,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:59:14,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-07 22:59:14,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:14,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-07 22:59:14,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1124, Unknown=0, NotChecked=0, Total=1332 [2025-02-07 22:59:14,450 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 37 states, 37 states have (on average 2.189189189189189) internal successors, (81), 36 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:14,937 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-02-07 22:59:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-07 22:59:14,937 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.189189189189189) internal successors, (81), 36 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-07 22:59:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:14,938 INFO L225 Difference]: With dead ends: 82 [2025-02-07 22:59:14,938 INFO L226 Difference]: Without dead ends: 67 [2025-02-07 22:59:14,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=315, Invalid=1755, Unknown=0, NotChecked=0, Total=2070 [2025-02-07 22:59:14,939 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:14,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 34 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:59:14,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-07 22:59:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2025-02-07 22:59:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2025-02-07 22:59:14,943 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 33 [2025-02-07 22:59:14,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:14,943 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2025-02-07 22:59:14,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.189189189189189) internal successors, (81), 36 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2025-02-07 22:59:14,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-07 22:59:14,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:14,944 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2025-02-07 22:59:14,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-07 22:59:15,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:15,146 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:15,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:15,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1175178769, now seen corresponding path program 3 times [2025-02-07 22:59:15,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:15,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843474475] [2025-02-07 22:59:15,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 22:59:15,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:15,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 9 equivalence classes. [2025-02-07 22:59:15,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 22:59:15,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-07 22:59:15,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:17,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:17,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843474475] [2025-02-07 22:59:17,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843474475] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:59:17,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376351090] [2025-02-07 22:59:17,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 22:59:17,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:17,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:17,101 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:59:17,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-07 22:59:17,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 9 equivalence classes. [2025-02-07 22:59:17,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 22:59:17,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-07 22:59:17,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:17,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-02-07 22:59:17,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 23 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:18,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:59:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 15 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:28,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376351090] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:59:28,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:59:28,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 26, 29] total 72 [2025-02-07 22:59:28,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903657773] [2025-02-07 22:59:28,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:59:28,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-02-07 22:59:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:28,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-02-07 22:59:28,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=4557, Unknown=0, NotChecked=0, Total=5256 [2025-02-07 22:59:28,364 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 73 states, 73 states have (on average 2.232876712328767) internal successors, (163), 72 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:30,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:30,451 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2025-02-07 22:59:30,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-07 22:59:30,452 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.232876712328767) internal successors, (163), 72 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-07 22:59:30,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:30,455 INFO L225 Difference]: With dead ends: 131 [2025-02-07 22:59:30,455 INFO L226 Difference]: Without dead ends: 116 [2025-02-07 22:59:30,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3084 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1221, Invalid=7899, Unknown=0, NotChecked=0, Total=9120 [2025-02-07 22:59:30,457 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:30,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:59:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-07 22:59:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2025-02-07 22:59:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2025-02-07 22:59:30,474 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 61 [2025-02-07 22:59:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:30,475 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2025-02-07 22:59:30,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.232876712328767) internal successors, (163), 72 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2025-02-07 22:59:30,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-07 22:59:30,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:30,479 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1] [2025-02-07 22:59:30,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-07 22:59:30,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:30,681 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:30,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:30,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1306541123, now seen corresponding path program 4 times [2025-02-07 22:59:30,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:30,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502372236] [2025-02-07 22:59:30,682 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 22:59:30,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:30,699 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 110 statements into 2 equivalence classes. [2025-02-07 22:59:30,993 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-02-07 22:59:30,994 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 22:59:30,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:59:30,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 22:59:31,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-07 22:59:31,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-07 22:59:31,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:31,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:59:31,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 22:59:31,178 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 22:59:31,178 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 22:59:31,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 22:59:31,181 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2025-02-07 22:59:31,201 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,201 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,201 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,201 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,201 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,201 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,201 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,201 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,201 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,201 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,201 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,201 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,201 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,201 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,202 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,202 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:31,208 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 22:59:31,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 10:59:31 BoogieIcfgContainer [2025-02-07 22:59:31,210 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 22:59:31,210 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 22:59:31,211 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 22:59:31,211 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 22:59:31,211 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:58:56" (3/4) ... [2025-02-07 22:59:31,212 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 22:59:31,213 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 22:59:31,213 INFO L158 Benchmark]: Toolchain (without parser) took 35154.83ms. Allocated memory was 201.3MB in the beginning and 478.2MB in the end (delta: 276.8MB). Free memory was 159.2MB in the beginning and 405.5MB in the end (delta: -246.3MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2025-02-07 22:59:31,214 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 218.1MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:59:31,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 124.54ms. Allocated memory is still 201.3MB. Free memory was 158.9MB in the beginning and 147.9MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 22:59:31,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.69ms. Allocated memory is still 201.3MB. Free memory was 147.9MB in the beginning and 146.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:59:31,214 INFO L158 Benchmark]: Boogie Preprocessor took 17.89ms. Allocated memory is still 201.3MB. Free memory was 146.3MB in the beginning and 145.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:59:31,214 INFO L158 Benchmark]: IcfgBuilder took 217.00ms. Allocated memory is still 201.3MB. Free memory was 144.7MB in the beginning and 130.7MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 22:59:31,214 INFO L158 Benchmark]: TraceAbstraction took 34768.47ms. Allocated memory was 201.3MB in the beginning and 478.2MB in the end (delta: 276.8MB). Free memory was 130.4MB in the beginning and 405.6MB in the end (delta: -275.3MB). Peak memory consumption was 246.6MB. Max. memory is 16.1GB. [2025-02-07 22:59:31,215 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 478.2MB. Free memory was 405.6MB in the beginning and 405.5MB in the end (delta: 99.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:59:31,215 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 218.1MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 124.54ms. Allocated memory is still 201.3MB. Free memory was 158.9MB in the beginning and 147.9MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.69ms. Allocated memory is still 201.3MB. Free memory was 147.9MB in the beginning and 146.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.89ms. Allocated memory is still 201.3MB. Free memory was 146.3MB in the beginning and 145.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 217.00ms. Allocated memory is still 201.3MB. Free memory was 144.7MB in the beginning and 130.7MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 34768.47ms. Allocated memory was 201.3MB in the beginning and 478.2MB in the end (delta: 276.8MB). Free memory was 130.4MB in the beginning and 405.6MB in the end (delta: -275.3MB). Peak memory consumption was 246.6MB. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 478.2MB. Free memory was 405.6MB in the beginning and 405.5MB in the end (delta: 99.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 22]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 55. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 4); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (4 - 1); [L30] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 1); [L31] const SORT_9 msb_SORT_9 = (SORT_9)1 << (1 - 1); [L33] const SORT_1 var_2 = 0; [L34] const SORT_1 var_5 = 1; [L35] const SORT_1 var_8 = mask_SORT_1; [L38] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, var_2=0, var_5=1, var_8=15] [L38] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L40] SORT_1 init_4_arg_1 = var_2; [L41] state_3 = init_4_arg_1 VAL [mask_SORT_1=15, state_3=0, var_5=1, var_8=15] [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=15, var_5=1, var_6=1, var_8=15] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=15, var_5=1, var_8=15] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=15, var_5=1, var_6=2, var_8=15] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=15, var_5=1, var_8=15] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=15, var_5=1, var_6=3, var_8=15] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=15, var_5=1, var_8=15] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=15, var_5=1, var_6=4, var_8=15] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=15, var_5=1, var_8=15] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=15, var_5=1, var_6=5, var_8=15] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=15, var_5=1, var_8=15] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=15, var_5=1, var_6=6, var_8=15] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=15, var_5=1, var_8=15] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=15, var_5=1, var_6=7, var_8=15] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=15, var_5=1, var_8=15] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=15, var_5=1, var_6=8, var_8=15] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=15, var_5=1, var_8=15] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=15, var_5=1, var_6=9, var_8=15] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=15, var_5=1, var_8=15] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=15, var_5=1, var_6=10, var_8=15] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=15, var_5=1, var_8=15] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=15, var_5=1, var_6=11, var_8=15] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=15, var_5=1, var_8=15] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=15, var_5=1, var_6=12, var_8=15] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=15, var_5=1, var_8=15] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=15, var_5=1, var_6=13, var_8=15] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=15, var_5=1, var_8=15] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=15, var_5=1, var_6=14, var_8=15] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=15, var_5=1, var_8=15] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=15, var_5=1, var_6=15, var_8=15] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=15, var_5=1, var_8=15] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.7s, OverallIterations: 11, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 314 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 268 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1846 IncrementalHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 46 mSDtfsCounter, 1846 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 594 GetRequests, 282 SyntacticMatches, 11 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4767 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=10, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 30 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 27.0s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 652 ConstructedInterpolants, 9 QuantifiedInterpolants, 16787 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1168 ConjunctsInSsa, 469 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 287/1091 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-07 22:59:31,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7520cfa04676a157cc3b0d71c42a9ed73acdf0d120a939e33f1a3e61a093ef11 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:59:33,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:59:33,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 22:59:33,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:59:33,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:59:33,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:59:33,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:59:33,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:59:33,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:59:33,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:59:33,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:59:33,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:59:33,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:59:33,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:59:33,256 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:59:33,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:59:33,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:59:33,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:59:33,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:59:33,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:59:33,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:59:33,257 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 22:59:33,257 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 22:59:33,257 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 22:59:33,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:59:33,257 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:59:33,257 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:59:33,257 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:59:33,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:59:33,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:59:33,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:59:33,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:59:33,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:59:33,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:59:33,257 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:59:33,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:59:33,257 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 22:59:33,262 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 22:59:33,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:59:33,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:59:33,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:59:33,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:59:33,263 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7520cfa04676a157cc3b0d71c42a9ed73acdf0d120a939e33f1a3e61a093ef11 [2025-02-07 22:59:33,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:59:33,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:59:33,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:59:33,498 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:59:33,499 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:59:33,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c [2025-02-07 22:59:34,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4a9b2806/8633babb226e4c31a15ecb5522e2bfa5/FLAGb6cede7bb [2025-02-07 22:59:34,947 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:59:34,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c [2025-02-07 22:59:34,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4a9b2806/8633babb226e4c31a15ecb5522e2bfa5/FLAGb6cede7bb [2025-02-07 22:59:35,315 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4a9b2806/8633babb226e4c31a15ecb5522e2bfa5 [2025-02-07 22:59:35,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:59:35,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:59:35,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:59:35,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:59:35,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:59:35,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:59:35" (1/1) ... [2025-02-07 22:59:35,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee1d1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:35, skipping insertion in model container [2025-02-07 22:59:35,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:59:35" (1/1) ... [2025-02-07 22:59:35,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:59:35,427 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c[1256,1269] [2025-02-07 22:59:35,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:59:35,455 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:59:35,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c[1256,1269] [2025-02-07 22:59:35,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:59:35,485 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:59:35,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:35 WrapperNode [2025-02-07 22:59:35,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:59:35,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:59:35,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:59:35,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:59:35,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:35" (1/1) ... [2025-02-07 22:59:35,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:35" (1/1) ... [2025-02-07 22:59:35,505 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2025-02-07 22:59:35,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:59:35,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:59:35,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:59:35,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:59:35,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:35" (1/1) ... [2025-02-07 22:59:35,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:35" (1/1) ... [2025-02-07 22:59:35,513 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:35" (1/1) ... [2025-02-07 22:59:35,520 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 22:59:35,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:35" (1/1) ... [2025-02-07 22:59:35,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:35" (1/1) ... [2025-02-07 22:59:35,524 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:35" (1/1) ... [2025-02-07 22:59:35,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:35" (1/1) ... [2025-02-07 22:59:35,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:35" (1/1) ... [2025-02-07 22:59:35,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:35" (1/1) ... [2025-02-07 22:59:35,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:59:35,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:59:35,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:59:35,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:59:35,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:35" (1/1) ... [2025-02-07 22:59:35,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:59:35,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:35,556 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 22:59:35,561 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 22:59:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:59:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 22:59:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:59:35,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:59:35,636 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:59:35,637 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:59:35,737 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-07 22:59:35,737 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:59:35,745 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:59:35,745 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:59:35,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:59:35 BoogieIcfgContainer [2025-02-07 22:59:35,746 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:59:35,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:59:35,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:59:35,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:59:35,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:59:35" (1/3) ... [2025-02-07 22:59:35,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc74e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:59:35, skipping insertion in model container [2025-02-07 22:59:35,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:35" (2/3) ... [2025-02-07 22:59:35,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc74e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:59:35, skipping insertion in model container [2025-02-07 22:59:35,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:59:35" (3/3) ... [2025-02-07 22:59:35,753 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.count4.c [2025-02-07 22:59:35,763 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:59:35,765 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.count4.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:59:35,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:59:35,808 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;@2fb8dabd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:59:35,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:59:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 22:59:35,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:35,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 22:59:35,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:35,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 22:59:35,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:59:35,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [518286349] [2025-02-07 22:59:35,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:35,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:35,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:35,831 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 22:59:35,833 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 22:59:35,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 22:59:35,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 22:59:35,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:35,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:35,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 22:59:35,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:36,006 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 22:59:36,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:59:36,008 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:59:36,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518286349] [2025-02-07 22:59:36,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518286349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:59:36,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:59:36,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 22:59:36,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851543373] [2025-02-07 22:59:36,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:59:36,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:59:36,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:59:36,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:59:36,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:59:36,030 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:36,072 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-07 22:59:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:59:36,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-07 22:59:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:36,078 INFO L225 Difference]: With dead ends: 16 [2025-02-07 22:59:36,078 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 22:59:36,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:59:36,081 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 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 22:59:36,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:59:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 22:59:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 22:59:36,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 22:59:36,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 22:59:36,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:36,096 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 22:59:36,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 22:59:36,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 22:59:36,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:36,097 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 22:59:36,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 22:59:36,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:36,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:36,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:36,302 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 22:59:36,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:59:36,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1067202929] [2025-02-07 22:59:36,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:36,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:36,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:36,304 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 22:59:36,305 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 22:59:36,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 22:59:36,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 22:59:36,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:36,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:36,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-07 22:59:36,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:36,487 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 22:59:36,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:59:36,549 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 22:59:36,549 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:59:36,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067202929] [2025-02-07 22:59:36,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067202929] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:59:36,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:59:36,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-07 22:59:36,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219234413] [2025-02-07 22:59:36,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 22:59:36,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 22:59:36,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:59:36,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 22:59:36,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:59:36,551 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:36,622 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-02-07 22:59:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:59:36,622 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 22:59:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:36,623 INFO L225 Difference]: With dead ends: 17 [2025-02-07 22:59:36,623 INFO L226 Difference]: Without dead ends: 15 [2025-02-07 22:59:36,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-02-07 22:59:36,623 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:36,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 13 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:59:36,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-07 22:59:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-02-07 22:59:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-02-07 22:59:36,626 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2025-02-07 22:59:36,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:36,626 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-02-07 22:59:36,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-02-07 22:59:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 22:59:36,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:36,626 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2025-02-07 22:59:36,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 22:59:36,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:36,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:36,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:36,827 INFO L85 PathProgramCache]: Analyzing trace with hash 852005001, now seen corresponding path program 2 times [2025-02-07 22:59:36,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:59:36,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841932484] [2025-02-07 22:59:36,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 22:59:36,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:36,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:36,830 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 22:59:36,831 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 22:59:36,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-07 22:59:36,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 22:59:36,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 22:59:36,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:36,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 22:59:36,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:37,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:59:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:37,167 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:59:37,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841932484] [2025-02-07 22:59:37,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841932484] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:59:37,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:59:37,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-07 22:59:37,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214452865] [2025-02-07 22:59:37,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 22:59:37,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 22:59:37,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:59:37,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 22:59:37,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:59:37,168 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:37,394 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-02-07 22:59:37,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 22:59:37,394 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-07 22:59:37,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:37,396 INFO L225 Difference]: With dead ends: 29 [2025-02-07 22:59:37,396 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 22:59:37,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2025-02-07 22:59:37,397 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:37,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 18 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:59:37,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 22:59:37,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-02-07 22:59:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2025-02-07 22:59:37,402 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2025-02-07 22:59:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:37,402 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2025-02-07 22:59:37,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2025-02-07 22:59:37,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 22:59:37,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:37,402 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2025-02-07 22:59:37,412 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 22:59:37,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:37,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:37,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:37,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1857839369, now seen corresponding path program 3 times [2025-02-07 22:59:37,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:59:37,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1036518366] [2025-02-07 22:59:37,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 22:59:37,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:37,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:37,610 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 22:59:37,611 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 22:59:37,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 8 equivalence classes. [2025-02-07 22:59:37,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 22:59:37,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-07 22:59:37,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:37,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-07 22:59:37,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:37,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:59:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:38,263 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:59:38,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036518366] [2025-02-07 22:59:38,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036518366] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:59:38,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:59:38,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-02-07 22:59:38,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609023595] [2025-02-07 22:59:38,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 22:59:38,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 22:59:38,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:59:38,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 22:59:38,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-02-07 22:59:38,264 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:39,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:39,093 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-02-07 22:59:39,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-07 22:59:39,093 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-07 22:59:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:39,093 INFO L225 Difference]: With dead ends: 53 [2025-02-07 22:59:39,093 INFO L226 Difference]: Without dead ends: 51 [2025-02-07 22:59:39,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=515, Invalid=1207, Unknown=0, NotChecked=0, Total=1722 [2025-02-07 22:59:39,095 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:39,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:59:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-07 22:59:39,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-02-07 22:59:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2025-02-07 22:59:39,100 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 25 [2025-02-07 22:59:39,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:39,100 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2025-02-07 22:59:39,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2025-02-07 22:59:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-07 22:59:39,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:39,101 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1] [2025-02-07 22:59:39,110 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 22:59:39,301 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 [2025-02-07 22:59:39,302 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:39,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:39,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1230650871, now seen corresponding path program 4 times [2025-02-07 22:59:39,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:59:39,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [875361167] [2025-02-07 22:59:39,303 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 22:59:39,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:39,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:39,305 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 22:59:39,305 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 22:59:39,384 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-02-07 22:59:39,429 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 22:59:39,429 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 22:59:39,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:59:39,429 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 22:59:39,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 22:59:39,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 22:59:39,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:39,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:59:39,550 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-07 22:59:39,550 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 22:59:39,551 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 22:59:39,566 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 22:59:39,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:39,756 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,786 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,802 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 22:59:39,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 10:59:39 BoogieIcfgContainer [2025-02-07 22:59:39,808 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 22:59:39,809 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 22:59:39,809 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 22:59:39,809 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 22:59:39,811 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:59:35" (3/4) ... [2025-02-07 22:59:39,811 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 22:59:39,822 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,842 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,843 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,843 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,843 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,843 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,843 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,843 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,843 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,843 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,843 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,843 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,843 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,843 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,843 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,843 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:39,914 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 48. [2025-02-07 22:59:39,971 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 22:59:39,971 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 22:59:39,971 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 22:59:39,972 INFO L158 Benchmark]: Toolchain (without parser) took 4654.11ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 90.9MB in the beginning and 115.2MB in the end (delta: -24.3MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2025-02-07 22:59:39,972 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 61.4MB in the beginning and 61.4MB in the end (delta: 17.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:59:39,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.60ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 79.2MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 22:59:39,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.75ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 78.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:59:39,972 INFO L158 Benchmark]: Boogie Preprocessor took 23.97ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 76.9MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 22:59:39,973 INFO L158 Benchmark]: IcfgBuilder took 214.70ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 66.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 22:59:39,973 INFO L158 Benchmark]: TraceAbstraction took 4060.43ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 65.3MB in the beginning and 49.6MB in the end (delta: 15.7MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2025-02-07 22:59:39,973 INFO L158 Benchmark]: Witness Printer took 162.37ms. Allocated memory is still 151.0MB. Free memory was 49.6MB in the beginning and 115.2MB in the end (delta: -65.6MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2025-02-07 22:59:39,974 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 61.4MB in the beginning and 61.4MB in the end (delta: 17.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.60ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 79.2MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.75ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 78.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.97ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 76.9MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 214.70ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 66.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4060.43ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 65.3MB in the beginning and 49.6MB in the end (delta: 15.7MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * Witness Printer took 162.37ms. Allocated memory is still 151.0MB. Free memory was 49.6MB in the beginning and 115.2MB in the end (delta: -65.6MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 4); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (4 - 1); [L30] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 1); [L31] const SORT_9 msb_SORT_9 = (SORT_9)1 << (1 - 1); [L33] const SORT_1 var_2 = 0; [L34] const SORT_1 var_5 = 1; [L35] const SORT_1 var_8 = mask_SORT_1; [L38] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L40] SORT_1 init_4_arg_1 = var_2; [L41] state_3 = init_4_arg_1 VAL [mask_SORT_1=15, state_3=0, var_5=1, var_8=15] [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 359 IncrementalHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 12 mSDtfsCounter, 359 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=4, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 1765 SizeOfPredicates, 15 NumberOfNonLiveVariables, 204 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-07 22:59:39,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE