./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.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.count2.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 02da88a4f4d1ccaffb329e5ada42e451b6381aa731e6c7a9ccc4142d0ea1fbdc --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:58:47,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:58:48,030 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:48,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:58:48,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:58:48,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:58:48,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:58:48,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:58:48,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:58:48,056 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:58:48,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:58:48,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:58:48,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:58:48,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:58:48,057 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:58:48,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:58:48,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:58:48,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:58:48,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:58:48,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:58:48,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:58:48,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:58:48,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:58:48,058 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:58:48,058 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:58:48,059 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:58:48,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:58:48,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:58:48,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:58:48,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:58:48,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:58:48,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:58:48,060 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:58:48,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:58:48,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:58:48,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:58:48,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:58:48,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:58:48,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:58:48,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:58:48,060 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 -> 02da88a4f4d1ccaffb329e5ada42e451b6381aa731e6c7a9ccc4142d0ea1fbdc [2025-02-07 22:58:48,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:58:48,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:58:48,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:58:48,284 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:58:48,284 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:58:48,286 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.count2.c [2025-02-07 22:58:49,482 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e97f9d78/88ce7df701704242aa22fa5f99663b59/FLAG296e97f22 [2025-02-07 22:58:49,704 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:58:49,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.c [2025-02-07 22:58:49,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e97f9d78/88ce7df701704242aa22fa5f99663b59/FLAG296e97f22 [2025-02-07 22:58:50,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e97f9d78/88ce7df701704242aa22fa5f99663b59 [2025-02-07 22:58:50,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:58:50,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:58:50,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:58:50,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:58:50,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:58:50,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:58:50" (1/1) ... [2025-02-07 22:58:50,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5f9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:50, skipping insertion in model container [2025-02-07 22:58:50,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:58:50" (1/1) ... [2025-02-07 22:58:50,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:58:50,159 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.count2.c[1256,1269] [2025-02-07 22:58:50,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:58:50,195 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:58:50,204 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.count2.c[1256,1269] [2025-02-07 22:58:50,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:58:50,224 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:58:50,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:50 WrapperNode [2025-02-07 22:58:50,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:58:50,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:58:50,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:58:50,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:58:50,231 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:50" (1/1) ... [2025-02-07 22:58:50,238 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:50" (1/1) ... [2025-02-07 22:58:50,254 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2025-02-07 22:58:50,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:58:50,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:58:50,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:58:50,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:58:50,261 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:50" (1/1) ... [2025-02-07 22:58:50,262 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:50" (1/1) ... [2025-02-07 22:58:50,263 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:50" (1/1) ... [2025-02-07 22:58:50,270 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:50,270 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:50" (1/1) ... [2025-02-07 22:58:50,271 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:50" (1/1) ... [2025-02-07 22:58:50,273 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:50" (1/1) ... [2025-02-07 22:58:50,273 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:50" (1/1) ... [2025-02-07 22:58:50,274 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:50" (1/1) ... [2025-02-07 22:58:50,274 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:50" (1/1) ... [2025-02-07 22:58:50,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:58:50,276 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:58:50,276 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:58:50,276 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:58:50,277 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:50" (1/1) ... [2025-02-07 22:58:50,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:58:50,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:58:50,312 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:50,314 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:50,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:58:50,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:58:50,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:58:50,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:58:50,376 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:58:50,377 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:58:50,531 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-07 22:58:50,532 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:58:50,552 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:58:50,554 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:58:50,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:58:50 BoogieIcfgContainer [2025-02-07 22:58:50,554 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:58:50,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:58:50,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:58:50,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:58:50,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:58:50" (1/3) ... [2025-02-07 22:58:50,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f49aeaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:58:50, skipping insertion in model container [2025-02-07 22:58:50,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:58:50" (2/3) ... [2025-02-07 22:58:50,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f49aeaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:58:50, skipping insertion in model container [2025-02-07 22:58:50,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:58:50" (3/3) ... [2025-02-07 22:58:50,562 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.count2.c [2025-02-07 22:58:50,571 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:58:50,573 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.count2.c that has 1 procedures, 16 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:58:50,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:58:50,625 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;@7d058243, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:58:50,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:58:50,628 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:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 22:58:50,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:50,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 22:58:50,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:50,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1502998585, now seen corresponding path program 1 times [2025-02-07 22:58:50,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:50,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486921650] [2025-02-07 22:58:50,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:50,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:50,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 22:58:50,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 22:58:50,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:50,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:50,969 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:50,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:50,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486921650] [2025-02-07 22:58:50,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486921650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:50,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:50,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:58:50,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650191716] [2025-02-07 22:58:50,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:50,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:50,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:50,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:50,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:50,991 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 5 states, 5 states have (on average 1.2) internal successors, (6), 4 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:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:51,033 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2025-02-07 22:58:51,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:58:51,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 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:51,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:51,040 INFO L225 Difference]: With dead ends: 28 [2025-02-07 22:58:51,040 INFO L226 Difference]: Without dead ends: 17 [2025-02-07 22:58:51,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:58:51,044 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:51,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:58:51,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-07 22:58:51,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-02-07 22:58:51,063 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:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-02-07 22:58:51,068 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 6 [2025-02-07 22:58:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:51,068 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-02-07 22:58:51,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 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:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-02-07 22:58:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 22:58:51,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:51,070 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:58:51,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 22:58:51,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:51,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2038278903, now seen corresponding path program 1 times [2025-02-07 22:58:51,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:51,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872639712] [2025-02-07 22:58:51,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:51,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:51,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 22:58:51,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 22:58:51,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:51,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:58:51,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:51,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872639712] [2025-02-07 22:58:51,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872639712] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:58:51,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583686310] [2025-02-07 22:58:51,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:51,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:58:51,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:58:51,325 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:51,326 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:51,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 22:58:51,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 22:58:51,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:51,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:51,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-07 22:58:51,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:58:51,611 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:51,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:58:51,772 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:51,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583686310] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:58:51,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:58:51,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 12 [2025-02-07 22:58:51,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026057448] [2025-02-07 22:58:51,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:58:51,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 22:58:51,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:51,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 22:58:51,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-02-07 22:58:51,775 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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:51,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:51,855 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2025-02-07 22:58:51,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:58:51,855 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:51,855 INFO L225 Difference]: With dead ends: 22 [2025-02-07 22:58:51,856 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 22:58:51,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-02-07 22:58:51,856 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:51,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 77 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:58:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 22:58:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2025-02-07 22:58:51,858 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:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-02-07 22:58:51,859 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2025-02-07 22:58:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:51,859 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-02-07 22:58:51,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-02-07 22:58:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 22:58:51,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:51,860 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:58:51,866 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:52,064 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:52,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:52,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:52,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1093226179, now seen corresponding path program 1 times [2025-02-07 22:58:52,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:52,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943715419] [2025-02-07 22:58:52,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:52,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:52,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 22:58:52,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 22:58:52,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:52,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:52,183 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:52,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:52,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943715419] [2025-02-07 22:58:52,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943715419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:52,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:52,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:58:52,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25282689] [2025-02-07 22:58:52,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:52,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:52,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:52,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:52,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:52,185 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:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:52,232 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-02-07 22:58:52,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:58:52,233 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:52,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:52,233 INFO L225 Difference]: With dead ends: 35 [2025-02-07 22:58:52,233 INFO L226 Difference]: Without dead ends: 23 [2025-02-07 22:58:52,233 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:52,234 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:52,234 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:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-07 22:58:52,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-02-07 22:58:52,241 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:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-02-07 22:58:52,242 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 12 [2025-02-07 22:58:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:52,242 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-02-07 22:58:52,242 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:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2025-02-07 22:58:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 22:58:52,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:52,242 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:58:52,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:58:52,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:52,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:52,243 INFO L85 PathProgramCache]: Analyzing trace with hash 575576205, now seen corresponding path program 1 times [2025-02-07 22:58:52,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:52,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489882191] [2025-02-07 22:58:52,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:52,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:52,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 22:58:52,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 22:58:52,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:52,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:52,620 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:52,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:52,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489882191] [2025-02-07 22:58:52,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489882191] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:58:52,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806118145] [2025-02-07 22:58:52,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:52,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:58:52,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:58:52,623 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:52,625 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:52,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 22:58:52,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 22:58:52,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:52,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:52,672 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-07 22:58:52,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:58:53,228 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:53,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:58:53,580 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:53,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806118145] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:58:53,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:58:53,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2025-02-07 22:58:53,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340748915] [2025-02-07 22:58:53,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:58:53,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-07 22:58:53,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:53,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-07 22:58:53,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-02-07 22:58:53,582 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 states have internal predecessors, (35), 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:53,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:53,801 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-02-07 22:58:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:58:53,801 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 states have internal predecessors, (35), 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:53,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:53,801 INFO L225 Difference]: With dead ends: 39 [2025-02-07 22:58:53,801 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 22:58:53,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2025-02-07 22:58:53,806 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:53,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 40 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:58:53,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 22:58:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2025-02-07 22:58:53,808 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:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-02-07 22:58:53,808 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2025-02-07 22:58:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:53,808 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-02-07 22:58:53,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 states have internal predecessors, (35), 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:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-02-07 22:58:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 22:58:53,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:53,809 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:58:53,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 22:58:54,009 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:58:54,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:54,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:54,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1879258479, now seen corresponding path program 1 times [2025-02-07 22:58:54,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:54,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198145609] [2025-02-07 22:58:54,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:54,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:54,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 22:58:54,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 22:58:54,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:54,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:54,229 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:58:54,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198145609] [2025-02-07 22:58:54,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198145609] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:58:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903976178] [2025-02-07 22:58:54,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:54,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:58:54,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:58:54,231 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:58:54,233 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:58:54,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 22:58:54,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 22:58:54,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:54,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:54,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-07 22:58:54,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:58:54,500 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:58:54,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:58:54,842 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:58:54,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903976178] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:58:54,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:58:54,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 22 [2025-02-07 22:58:54,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801005945] [2025-02-07 22:58:54,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:58:54,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 22:58:54,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:54,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 22:58:54,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-02-07 22:58:54,844 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:58:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:54,968 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-02-07 22:58:54,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 22:58:54,969 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:58:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:54,969 INFO L225 Difference]: With dead ends: 50 [2025-02-07 22:58:54,970 INFO L226 Difference]: Without dead ends: 38 [2025-02-07 22:58:54,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2025-02-07 22:58:54,971 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:54,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 34 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:58:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-07 22:58:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-02-07 22:58:54,976 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:58:54,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-02-07 22:58:54,977 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 19 [2025-02-07 22:58:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:54,978 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-02-07 22:58:54,978 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:58:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-02-07 22:58:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 22:58:54,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:54,978 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-07 22:58:54,985 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:58:55,179 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:58:55,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:55,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:55,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1978378681, now seen corresponding path program 2 times [2025-02-07 22:58:55,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:55,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996340165] [2025-02-07 22:58:55,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 22:58:55,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:55,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-07 22:58:55,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 22:58:55,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 22:58:55,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:55,540 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:58:55,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:55,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996340165] [2025-02-07 22:58:55,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996340165] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:58:55,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178698460] [2025-02-07 22:58:55,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 22:58:55,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:58:55,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:58:55,543 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:58:55,545 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:58:55,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-07 22:58:55,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 22:58:55,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 22:58:55,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:55,611 WARN L254 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-07 22:58:55,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:58:56,028 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:58:56,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:58:58,376 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:58:58,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178698460] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:58:58,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:58:58,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 35 [2025-02-07 22:58:58,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358920755] [2025-02-07 22:58:58,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:58:58,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-07 22:58:58,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:58,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-07 22:58:58,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2025-02-07 22:58:58,378 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:58:58,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:58,880 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2025-02-07 22:58:58,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 22:58:58,881 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:58:58,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:58,881 INFO L225 Difference]: With dead ends: 43 [2025-02-07 22:58:58,881 INFO L226 Difference]: Without dead ends: 41 [2025-02-07 22:58:58,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=247, Invalid=1559, Unknown=0, NotChecked=0, Total=1806 [2025-02-07 22:58:58,882 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:58,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 51 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:58:58,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-07 22:58:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2025-02-07 22:58:58,889 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:58:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-02-07 22:58:58,891 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 20 [2025-02-07 22:58:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:58,891 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-02-07 22:58:58,891 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:58:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-02-07 22:58:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 22:58:58,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:58,892 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:58:58,898 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:58:59,092 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:58:59,092 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:59,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:59,093 INFO L85 PathProgramCache]: Analyzing trace with hash 625622011, now seen corresponding path program 1 times [2025-02-07 22:58:59,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:59,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385057598] [2025-02-07 22:58:59,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:59,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:59,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 22:58:59,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 22:58:59,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:59,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:59,215 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:58:59,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:59,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385057598] [2025-02-07 22:58:59,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385057598] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:58:59,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83961904] [2025-02-07 22:58:59,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:59,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:58:59,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:58:59,218 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:58:59,230 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:58:59,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 22:58:59,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 22:58:59,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:59,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:59,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-07 22:58:59,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:58:59,444 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:58:59,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:58:59,574 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:58:59,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83961904] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:58:59,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:58:59,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 9] total 19 [2025-02-07 22:58:59,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867522319] [2025-02-07 22:58:59,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:58:59,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 22:58:59,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:59,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 22:58:59,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-02-07 22:58:59,575 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:58:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:59,710 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2025-02-07 22:58:59,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 22:58:59,710 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:58:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:59,711 INFO L225 Difference]: With dead ends: 64 [2025-02-07 22:58:59,711 INFO L226 Difference]: Without dead ends: 52 [2025-02-07 22:58:59,711 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:58:59,712 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:59,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 24 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:58:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-07 22:58:59,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-02-07 22:58:59,717 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:58:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-02-07 22:58:59,717 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 31 [2025-02-07 22:58:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:59,717 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-02-07 22:58:59,717 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:58:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-02-07 22:58:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-07 22:58:59,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:59,718 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-07 22:58:59,724 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:58:59,918 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:58:59,918 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:59,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:59,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1974704753, now seen corresponding path program 1 times [2025-02-07 22:58:59,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:59,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41317855] [2025-02-07 22:58:59,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:59,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:59,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 22:58:59,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 22:58:59,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:59,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 22:59:00,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:00,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41317855] [2025-02-07 22:59:00,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41317855] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:59:00,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781700693] [2025-02-07 22:59:00,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:00,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:00,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:00,237 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:00,238 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:00,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 22:59:00,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 22:59:00,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:00,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:00,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 53 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,753 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:00,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:59:06,380 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:06,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781700693] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:59:06,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:59:06,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 13] total 28 [2025-02-07 22:59:06,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379736333] [2025-02-07 22:59:06,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:59:06,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-07 22:59:06,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:06,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-07 22:59:06,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2025-02-07 22:59:06,383 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 28 states have internal predecessors, (71), 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:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:06,549 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-02-07 22:59:06,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 22:59:06,549 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 28 states have internal predecessors, (71), 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:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:06,550 INFO L225 Difference]: With dead ends: 65 [2025-02-07 22:59:06,550 INFO L226 Difference]: Without dead ends: 43 [2025-02-07 22:59:06,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2025-02-07 22:59:06,551 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:06,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 27 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:59:06,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-07 22:59:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2025-02-07 22:59:06,554 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:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2025-02-07 22:59:06,554 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 32 [2025-02-07 22:59:06,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:06,555 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2025-02-07 22:59:06,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 28 states have internal predecessors, (71), 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:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2025-02-07 22:59:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 22:59:06,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:06,555 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-07 22:59:06,562 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:06,756 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:06,756 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:06,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash 459309329, now seen corresponding path program 2 times [2025-02-07 22:59:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:06,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885522432] [2025-02-07 22:59:06,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 22:59:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:06,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-07 22:59:06,793 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:06,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 22:59:06,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:07,371 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:07,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:07,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885522432] [2025-02-07 22:59:07,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885522432] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:59:07,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864200810] [2025-02-07 22:59:07,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 22:59:07,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:07,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:07,373 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:07,374 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:07,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-07 22:59:07,713 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:07,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 22:59:07,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:07,715 WARN L254 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-02-07 22:59:07,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:08,752 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:08,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:59:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:12,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864200810] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:59:12,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:59:12,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 24] total 52 [2025-02-07 22:59:12,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910237365] [2025-02-07 22:59:12,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:59:12,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-02-07 22:59:12,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:12,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-02-07 22:59:12,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2374, Unknown=0, NotChecked=0, Total=2756 [2025-02-07 22:59:12,187 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 52 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:21,069 WARN L286 SmtUtils]: Spent 7.19s on a formula simplification. DAG size of input: 118 DAG size of output: 96 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-07 22:59:23,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 22:59:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:35,468 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2025-02-07 22:59:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-02-07 22:59:35,468 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 52 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-07 22:59:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:35,470 INFO L225 Difference]: With dead ends: 110 [2025-02-07 22:59:35,470 INFO L226 Difference]: Without dead ends: 95 [2025-02-07 22:59:35,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2047 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=810, Invalid=5832, Unknown=0, NotChecked=0, Total=6642 [2025-02-07 22:59:35,471 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 54 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:35,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 44 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-02-07 22:59:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-07 22:59:35,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 60. [2025-02-07 22:59:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 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,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2025-02-07 22:59:35,487 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 33 [2025-02-07 22:59:35,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:35,487 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2025-02-07 22:59:35,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 52 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:35,488 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2025-02-07 22:59:35,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-07 22:59:35,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:35,488 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2025-02-07 22:59:35,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-07 22:59:35,689 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:35,689 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:35,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:35,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1491296835, now seen corresponding path program 3 times [2025-02-07 22:59:35,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:35,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245062088] [2025-02-07 22:59:35,689 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 22:59:35,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:35,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 8 equivalence classes. [2025-02-07 22:59:35,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 54 of 54 statements. [2025-02-07 22:59:35,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-07 22:59:35,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:59:35,774 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 22:59:35,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-07 22:59:35,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-07 22:59:35,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:35,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:59:35,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 22:59:35,854 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 22:59:35,855 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 22:59:35,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 22:59:35,860 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2025-02-07 22:59:35,881 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:35,883 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:35,883 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:35,883 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:35,883 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:35,883 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:35,883 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:35,883 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:35,888 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 22:59:35,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 10:59:35 BoogieIcfgContainer [2025-02-07 22:59:35,892 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 22:59:35,892 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 22:59:35,892 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 22:59:35,892 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 22:59:35,893 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:50" (3/4) ... [2025-02-07 22:59:35,895 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 22:59:35,896 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 22:59:35,896 INFO L158 Benchmark]: Toolchain (without parser) took 45859.27ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 155.9MB in the beginning and 128.5MB in the end (delta: 27.4MB). Peak memory consumption was 176.9MB. Max. memory is 16.1GB. [2025-02-07 22:59:35,898 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:59:35,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.62ms. Allocated memory is still 201.3MB. Free memory was 155.9MB in the beginning and 144.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 22:59:35,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.64ms. Allocated memory is still 201.3MB. Free memory was 144.7MB in the beginning and 142.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:59:35,899 INFO L158 Benchmark]: Boogie Preprocessor took 20.17ms. Allocated memory is still 201.3MB. Free memory was 142.8MB in the beginning and 141.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:59:35,899 INFO L158 Benchmark]: IcfgBuilder took 278.27ms. Allocated memory is still 201.3MB. Free memory was 141.4MB in the beginning and 127.5MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 22:59:35,899 INFO L158 Benchmark]: TraceAbstraction took 45335.74ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 127.1MB in the beginning and 128.7MB in the end (delta: -1.6MB). Peak memory consumption was 151.7MB. Max. memory is 16.1GB. [2025-02-07 22:59:35,899 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 352.3MB. Free memory was 128.7MB in the beginning and 128.5MB in the end (delta: 110.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:59:35,900 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.46ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.62ms. Allocated memory is still 201.3MB. Free memory was 155.9MB in the beginning and 144.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.64ms. Allocated memory is still 201.3MB. Free memory was 144.7MB in the beginning and 142.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.17ms. Allocated memory is still 201.3MB. Free memory was 142.8MB in the beginning and 141.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 278.27ms. Allocated memory is still 201.3MB. Free memory was 141.4MB in the beginning and 127.5MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 45335.74ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 127.1MB in the beginning and 128.7MB in the end (delta: -1.6MB). Peak memory consumption was 151.7MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 352.3MB. Free memory was 128.7MB in the beginning and 128.5MB in the end (delta: 110.7kB). 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 - 3); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 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=7, var_2=0, var_5=1, var_8=7] [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=7, state_3=0, var_5=1, var_8=7] [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=7, var_5=1, var_6=1, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=7, var_5=1, var_8=7] [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=7, var_5=1, var_6=2, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=7, var_5=1, var_8=7] [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=7, var_5=1, var_6=3, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=7, var_5=1, var_8=7] [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=7, var_5=1, var_6=4, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=7, var_5=1, var_8=7] [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=7, var_5=1, var_6=5, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=7, var_5=1, var_8=7] [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=7, var_5=1, var_6=6, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=7, var_5=1, var_8=7] [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=7, var_5=1, var_6=7, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=7, var_5=1, var_8=7] [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: 45.3s, OverallIterations: 10, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 354 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 301 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1790 IncrementalHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 53 mSDtfsCounter, 1790 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 426 GetRequests, 180 SyntacticMatches, 5 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3438 ImplicationChecksByTransitivity, 25.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=9, InterpolantAutomatonStates: 127, 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, 9 MinimizatonAttempts, 59 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 472 ConstructedInterpolants, 18 QuantifiedInterpolants, 12171 SizeOfPredicates, 20 NumberOfNonLiveVariables, 888 ConjunctsInSsa, 379 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 236/476 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:35,925 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.count2.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 02da88a4f4d1ccaffb329e5ada42e451b6381aa731e6c7a9ccc4142d0ea1fbdc --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:59:37,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:59:37,806 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:37,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:59:37,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:59:37,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:59:37,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:59:37,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:59:37,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:59:37,846 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:59:37,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:59:37,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:59:37,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:59:37,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:59:37,847 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:59:37,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:59:37,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:59:37,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:59:37,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:59:37,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:59:37,848 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:59:37,848 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 22:59:37,848 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 22:59:37,848 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 22:59:37,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:59:37,849 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:59:37,849 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:59:37,849 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:59:37,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:59:37,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:59:37,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:59:37,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:59:37,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:59:37,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:59:37,850 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:59:37,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:59:37,850 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 22:59:37,851 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 22:59:37,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:59:37,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:59:37,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:59:37,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:59:37,851 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 -> 02da88a4f4d1ccaffb329e5ada42e451b6381aa731e6c7a9ccc4142d0ea1fbdc [2025-02-07 22:59:38,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:59:38,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:59:38,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:59:38,155 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:59:38,155 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:59:38,156 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.count2.c [2025-02-07 22:59:39,328 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e18a5b065/f21dddb3e88d4ff5b04631a48ec31614/FLAGa5c8e5557 [2025-02-07 22:59:39,514 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:59:39,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.c [2025-02-07 22:59:39,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e18a5b065/f21dddb3e88d4ff5b04631a48ec31614/FLAGa5c8e5557 [2025-02-07 22:59:39,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e18a5b065/f21dddb3e88d4ff5b04631a48ec31614 [2025-02-07 22:59:39,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:59:39,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:59:39,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:59:39,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:59:39,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:59:39,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:59:39" (1/1) ... [2025-02-07 22:59:39,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae86a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:39, skipping insertion in model container [2025-02-07 22:59:39,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:59:39" (1/1) ... [2025-02-07 22:59:39,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:59:39,992 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.count2.c[1256,1269] [2025-02-07 22:59:40,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:59:40,015 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:59:40,022 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.count2.c[1256,1269] [2025-02-07 22:59:40,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:59:40,037 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:59:40,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:40 WrapperNode [2025-02-07 22:59:40,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:59:40,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:59:40,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:59:40,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:59:40,042 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:40" (1/1) ... [2025-02-07 22:59:40,047 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:40" (1/1) ... [2025-02-07 22:59:40,055 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2025-02-07 22:59:40,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:59:40,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:59:40,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:59:40,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:59:40,061 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:40" (1/1) ... [2025-02-07 22:59:40,061 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:40" (1/1) ... [2025-02-07 22:59:40,062 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:40" (1/1) ... [2025-02-07 22:59:40,067 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:40,067 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:40" (1/1) ... [2025-02-07 22:59:40,067 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:40" (1/1) ... [2025-02-07 22:59:40,070 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:40" (1/1) ... [2025-02-07 22:59:40,070 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:40" (1/1) ... [2025-02-07 22:59:40,072 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:40" (1/1) ... [2025-02-07 22:59:40,072 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:40" (1/1) ... [2025-02-07 22:59:40,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:59:40,073 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:59:40,074 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:59:40,074 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:59:40,074 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:40" (1/1) ... [2025-02-07 22:59:40,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:59:40,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:40,104 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:40,107 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:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:59:40,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 22:59:40,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:59:40,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:59:40,179 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:59:40,181 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:59:40,290 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-07 22:59:40,294 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:59:40,299 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:59:40,300 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:59:40,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:59:40 BoogieIcfgContainer [2025-02-07 22:59:40,301 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:59:40,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:59:40,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:59:40,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:59:40,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:59:39" (1/3) ... [2025-02-07 22:59:40,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79315e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:59:40, skipping insertion in model container [2025-02-07 22:59:40,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:40" (2/3) ... [2025-02-07 22:59:40,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79315e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:59:40, skipping insertion in model container [2025-02-07 22:59:40,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:59:40" (3/3) ... [2025-02-07 22:59:40,310 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.count2.c [2025-02-07 22:59:40,320 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:59:40,322 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.count2.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:59:40,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:59:40,367 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;@c06b8c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:59:40,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:59:40,370 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:40,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 22:59:40,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:40,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 22:59:40,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:40,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:40,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 22:59:40,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:59:40,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [537791281] [2025-02-07 22:59:40,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:40,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:40,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:40,386 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:40,388 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:40,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 22:59:40,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 22:59:40,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:40,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:40,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 22:59:40,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:40,562 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:40,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:59:40,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:59:40,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537791281] [2025-02-07 22:59:40,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537791281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:59:40,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:59:40,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 22:59:40,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337245861] [2025-02-07 22:59:40,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:59:40,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:59:40,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:59:40,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:59:40,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:59:40,583 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:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:40,618 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-07 22:59:40,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:59:40,620 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:40,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:40,625 INFO L225 Difference]: With dead ends: 16 [2025-02-07 22:59:40,625 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 22:59:40,627 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:40,630 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:40,631 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:40,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 22:59:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 22:59:40,647 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:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 22:59:40,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 22:59:40,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:40,651 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 22:59:40,651 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:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 22:59:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 22:59:40,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:40,651 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 22:59:40,658 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:59:40,853 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:40,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:40,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:40,854 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 22:59:40,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:59:40,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1822814307] [2025-02-07 22:59:40,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:40,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:40,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:40,857 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:40,858 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:40,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 22:59:40,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 22:59:40,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:40,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:40,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-07 22:59:40,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:41,052 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:41,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:59:41,130 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:41,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:59:41,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822814307] [2025-02-07 22:59:41,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822814307] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:59:41,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:59:41,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-07 22:59:41,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458300226] [2025-02-07 22:59:41,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 22:59:41,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 22:59:41,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:59:41,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 22:59:41,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:59:41,134 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:41,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:41,224 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-02-07 22:59:41,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:59:41,225 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:41,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:41,225 INFO L225 Difference]: With dead ends: 17 [2025-02-07 22:59:41,225 INFO L226 Difference]: Without dead ends: 15 [2025-02-07 22:59:41,226 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:41,226 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:41,226 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:41,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-07 22:59:41,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-02-07 22:59:41,228 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:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-02-07 22:59:41,229 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2025-02-07 22:59:41,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:41,229 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-02-07 22:59:41,229 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:41,229 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-02-07 22:59:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 22:59:41,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:41,229 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2025-02-07 22:59:41,236 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:41,430 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:41,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:41,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:41,432 INFO L85 PathProgramCache]: Analyzing trace with hash 852005001, now seen corresponding path program 2 times [2025-02-07 22:59:41,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:59:41,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1868182486] [2025-02-07 22:59:41,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 22:59:41,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:41,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:41,435 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:41,438 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:41,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-07 22:59:41,481 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:41,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 22:59:41,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:41,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 22:59:41,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:41,626 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:41,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:59:41,829 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:41,830 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:59:41,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868182486] [2025-02-07 22:59:41,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868182486] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:59:41,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:59:41,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-07 22:59:41,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851157200] [2025-02-07 22:59:41,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 22:59:41,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 22:59:41,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:59:41,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 22:59:41,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:59:41,831 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:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:42,127 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-02-07 22:59:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 22:59:42,127 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:42,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:42,127 INFO L225 Difference]: With dead ends: 29 [2025-02-07 22:59:42,127 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 22:59:42,128 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:42,128 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:42,128 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:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 22:59:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-02-07 22:59:42,132 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:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2025-02-07 22:59:42,132 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2025-02-07 22:59:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:42,132 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2025-02-07 22:59:42,132 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:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2025-02-07 22:59:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 22:59:42,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:42,133 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2025-02-07 22:59:42,139 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:42,337 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:42,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:42,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:42,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1857839369, now seen corresponding path program 3 times [2025-02-07 22:59:42,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:59:42,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1282953174] [2025-02-07 22:59:42,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 22:59:42,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:42,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:42,342 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:42,344 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:42,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 8 equivalence classes. [2025-02-07 22:59:42,414 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:42,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-07 22:59:42,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:59:42,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 22:59:42,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 22:59:42,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 22:59:42,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:42,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:59:42,454 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-07 22:59:42,454 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 22:59:42,455 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 22:59:42,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 22:59:42,660 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:42,663 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-02-07 22:59:42,690 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,690 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,690 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,690 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,690 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,690 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,690 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,690 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,702 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 22:59:42,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 10:59:42 BoogieIcfgContainer [2025-02-07 22:59:42,704 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 22:59:42,704 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 22:59:42,704 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 22:59:42,704 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 22:59:42,705 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:40" (3/4) ... [2025-02-07 22:59:42,706 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 22:59:42,717 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,717 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,717 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,717 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,717 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,717 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,717 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,717 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:59:42,784 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 24. [2025-02-07 22:59:42,834 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 22:59:42,838 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 22:59:42,838 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 22:59:42,839 INFO L158 Benchmark]: Toolchain (without parser) took 2941.27ms. Allocated memory is still 83.9MB. Free memory was 59.5MB in the beginning and 45.0MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2025-02-07 22:59:42,839 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:59:42,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 140.20ms. Allocated memory is still 83.9MB. Free memory was 59.5MB in the beginning and 48.0MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 22:59:42,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.19ms. Allocated memory is still 83.9MB. Free memory was 48.0MB in the beginning and 46.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:59:42,839 INFO L158 Benchmark]: Boogie Preprocessor took 16.90ms. Allocated memory is still 83.9MB. Free memory was 46.5MB in the beginning and 45.5MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 22:59:42,839 INFO L158 Benchmark]: IcfgBuilder took 227.40ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 34.6MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 22:59:42,840 INFO L158 Benchmark]: TraceAbstraction took 2401.42ms. Allocated memory is still 83.9MB. Free memory was 34.3MB in the beginning and 52.6MB in the end (delta: -18.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:59:42,840 INFO L158 Benchmark]: Witness Printer took 133.93ms. Allocated memory is still 83.9MB. Free memory was 51.8MB in the beginning and 45.0MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 22:59:42,841 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.37ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 140.20ms. Allocated memory is still 83.9MB. Free memory was 59.5MB in the beginning and 48.0MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.19ms. Allocated memory is still 83.9MB. Free memory was 48.0MB in the beginning and 46.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.90ms. Allocated memory is still 83.9MB. Free memory was 46.5MB in the beginning and 45.5MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 227.40ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 34.6MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2401.42ms. Allocated memory is still 83.9MB. Free memory was 34.3MB in the beginning and 52.6MB in the end (delta: -18.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 133.93ms. Allocated memory is still 83.9MB. Free memory was 51.8MB in the beginning and 45.0MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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 - 3); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 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=7, state_3=0, var_5=1, var_8=7] [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: 2.3s, OverallIterations: 4, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 9 mSDtfsCounter, 122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=3, InterpolantAutomatonStates: 28, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 504 SizeOfPredicates, 11 NumberOfNonLiveVariables, 119 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/34 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:42,858 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