./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/recHanoi03-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/recursive/recHanoi03-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6256a35b65d93a8e45ad38c9510c3be689a890aeee58265a5723be13a7385a72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:04:25,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:04:25,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:04:25,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:04:25,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:04:25,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:04:25,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:04:25,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:04:25,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:04:25,348 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:04:25,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:04:25,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:04:25,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:04:25,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:04:25,350 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:04:25,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:04:25,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:04:25,351 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:04:25,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:04:25,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:04:25,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:04:25,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:04:25,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:04:25,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:04:25,352 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:04:25,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:04:25,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:04:25,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:04:25,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:04:25,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:04:25,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:04:25,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:04:25,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:04:25,353 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:04:25,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:04:25,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:04:25,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:04:25,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:04:25,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:04:25,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:04:25,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:04:25,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:04:25,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:04:25,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:04:25,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:04:25,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:04:25,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:04:25,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:04:25,355 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6256a35b65d93a8e45ad38c9510c3be689a890aeee58265a5723be13a7385a72 [2025-01-09 04:04:25,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:04:25,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:04:25,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:04:25,548 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:04:25,549 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:04:25,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/recHanoi03-2.c [2025-01-09 04:04:26,764 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/567b1bca7/8cbd888b2f324fa0a218956ca6d6ae02/FLAG2ec284775 [2025-01-09 04:04:27,073 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:04:27,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi03-2.c [2025-01-09 04:04:27,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/567b1bca7/8cbd888b2f324fa0a218956ca6d6ae02/FLAG2ec284775 [2025-01-09 04:04:27,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/567b1bca7/8cbd888b2f324fa0a218956ca6d6ae02 [2025-01-09 04:04:27,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:04:27,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:04:27,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:04:27,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:04:27,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:04:27,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:04:27" (1/1) ... [2025-01-09 04:04:27,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2979425c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27, skipping insertion in model container [2025-01-09 04:04:27,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:04:27" (1/1) ... [2025-01-09 04:04:27,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:04:27,458 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/recursive/recHanoi03-2.c[769,782] [2025-01-09 04:04:27,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:04:27,466 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:04:27,474 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/recursive/recHanoi03-2.c[769,782] [2025-01-09 04:04:27,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:04:27,483 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:04:27,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27 WrapperNode [2025-01-09 04:04:27,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:04:27,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:04:27,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:04:27,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:04:27,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27" (1/1) ... [2025-01-09 04:04:27,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27" (1/1) ... [2025-01-09 04:04:27,506 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2025-01-09 04:04:27,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:04:27,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:04:27,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:04:27,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:04:27,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27" (1/1) ... [2025-01-09 04:04:27,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27" (1/1) ... [2025-01-09 04:04:27,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27" (1/1) ... [2025-01-09 04:04:27,522 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-01-09 04:04:27,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27" (1/1) ... [2025-01-09 04:04:27,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27" (1/1) ... [2025-01-09 04:04:27,524 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27" (1/1) ... [2025-01-09 04:04:27,528 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27" (1/1) ... [2025-01-09 04:04:27,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27" (1/1) ... [2025-01-09 04:04:27,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27" (1/1) ... [2025-01-09 04:04:27,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27" (1/1) ... [2025-01-09 04:04:27,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:04:27,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:04:27,531 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:04:27,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:04:27,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27" (1/1) ... [2025-01-09 04:04:27,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:04:27,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:27,554 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-01-09 04:04:27,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:04:27,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:04:27,578 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2025-01-09 04:04:27,579 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2025-01-09 04:04:27,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:04:27,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:04:27,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:04:27,617 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:04:27,618 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:04:27,696 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 04:04:27,696 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:04:27,704 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:04:27,706 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:04:27,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:04:27 BoogieIcfgContainer [2025-01-09 04:04:27,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:04:27,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:04:27,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:04:27,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:04:27,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:04:27" (1/3) ... [2025-01-09 04:04:27,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bb3bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:04:27, skipping insertion in model container [2025-01-09 04:04:27,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:27" (2/3) ... [2025-01-09 04:04:27,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bb3bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:04:27, skipping insertion in model container [2025-01-09 04:04:27,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:04:27" (3/3) ... [2025-01-09 04:04:27,715 INFO L128 eAbstractionObserver]: Analyzing ICFG recHanoi03-2.c [2025-01-09 04:04:27,725 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:04:27,727 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recHanoi03-2.c that has 2 procedures, 17 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:04:27,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:04:27,771 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;@1724cdf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:04:27,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:04:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:04:27,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 04:04:27,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:27,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:27,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:27,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:27,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2025-01-09 04:04:27,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:27,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337902423] [2025-01-09 04:04:27,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:04:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:27,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 04:04:27,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 04:04:27,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:04:27,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:04:28,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:28,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337902423] [2025-01-09 04:04:28,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337902423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:04:28,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:04:28,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:04:28,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693249352] [2025-01-09 04:04:28,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:04:28,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:04:28,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:28,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:04:28,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:04:28,103 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:04:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:28,178 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2025-01-09 04:04:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:04:28,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-01-09 04:04:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:28,184 INFO L225 Difference]: With dead ends: 26 [2025-01-09 04:04:28,184 INFO L226 Difference]: Without dead ends: 16 [2025-01-09 04:04:28,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:04:28,188 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:28,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:04:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-01-09 04:04:28,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-09 04:04:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:04:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-01-09 04:04:28,211 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2025-01-09 04:04:28,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:28,211 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-01-09 04:04:28,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:04:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2025-01-09 04:04:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 04:04:28,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:28,213 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:28,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:04:28,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:28,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:28,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2053638732, now seen corresponding path program 1 times [2025-01-09 04:04:28,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:28,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777956101] [2025-01-09 04:04:28,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:04:28,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:28,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 04:04:28,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 04:04:28,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:04:28,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:04:28,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:28,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777956101] [2025-01-09 04:04:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777956101] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:04:28,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314846166] [2025-01-09 04:04:28,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:04:28,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:28,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:28,380 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-01-09 04:04:28,382 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-01-09 04:04:28,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 04:04:28,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 04:04:28,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:04:28,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:28,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 04:04:28,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:04:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:04:28,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:04:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 04:04:28,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314846166] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:04:28,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:04:28,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 19 [2025-01-09 04:04:28,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812481952] [2025-01-09 04:04:28,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:04:28,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 04:04:28,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:28,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 04:04:28,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:04:28,882 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 13 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 04:04:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:29,041 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-01-09 04:04:29,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:04:29,041 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 13 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 17 [2025-01-09 04:04:29,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:29,042 INFO L225 Difference]: With dead ends: 28 [2025-01-09 04:04:29,042 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 04:04:29,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:04:29,043 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:29,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 80 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:04:29,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 04:04:29,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-09 04:04:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:04:29,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-01-09 04:04:29,049 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2025-01-09 04:04:29,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:29,049 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-01-09 04:04:29,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 13 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 04:04:29,050 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-01-09 04:04:29,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 04:04:29,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:29,050 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:29,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:04:29,251 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-01-09 04:04:29,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:29,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:29,252 INFO L85 PathProgramCache]: Analyzing trace with hash -491101836, now seen corresponding path program 2 times [2025-01-09 04:04:29,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:29,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037082490] [2025-01-09 04:04:29,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:04:29,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:29,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 04:04:29,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 04:04:29,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:04:29,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:04:29,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:29,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037082490] [2025-01-09 04:04:29,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037082490] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:04:29,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654890777] [2025-01-09 04:04:29,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:04:29,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:29,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:29,491 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-01-09 04:04:29,492 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-01-09 04:04:29,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 04:04:29,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 04:04:29,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:04:29,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:29,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 04:04:29,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:04:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 04:04:29,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:04:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:04:30,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654890777] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:04:30,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:04:30,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 30 [2025-01-09 04:04:30,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72749658] [2025-01-09 04:04:30,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:04:30,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 04:04:30,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:30,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 04:04:30,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2025-01-09 04:04:30,622 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 20 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 04:04:30,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:30,865 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2025-01-09 04:04:30,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:04:30,865 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3) internal successors, (39), 20 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) Word has length 29 [2025-01-09 04:04:30,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:30,866 INFO L225 Difference]: With dead ends: 37 [2025-01-09 04:04:30,866 INFO L226 Difference]: Without dead ends: 31 [2025-01-09 04:04:30,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=1387, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 04:04:30,867 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:30,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 123 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:04:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-09 04:04:30,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-01-09 04:04:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:04:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2025-01-09 04:04:30,871 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2025-01-09 04:04:30,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:30,871 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2025-01-09 04:04:30,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.3) internal successors, (39), 20 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 04:04:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2025-01-09 04:04:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 04:04:30,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:30,873 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:30,878 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-01-09 04:04:31,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:31,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:31,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:31,078 INFO L85 PathProgramCache]: Analyzing trace with hash 278928068, now seen corresponding path program 3 times [2025-01-09 04:04:31,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:31,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562323086] [2025-01-09 04:04:31,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:04:31,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:31,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 7 equivalence classes. [2025-01-09 04:04:31,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 04:04:31,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 04:04:31,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 14 proven. 65 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 04:04:31,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:31,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562323086] [2025-01-09 04:04:31,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562323086] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:04:31,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646273553] [2025-01-09 04:04:31,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:04:31,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:31,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:31,575 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-01-09 04:04:31,576 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-01-09 04:04:31,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 7 equivalence classes. [2025-01-09 04:04:31,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 04:04:31,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 04:04:31,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:31,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 04:04:31,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:04:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 04:04:31,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:04:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 04:04:34,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646273553] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:04:34,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:04:34,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 24] total 46 [2025-01-09 04:04:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834795962] [2025-01-09 04:04:34,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:04:34,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 04:04:34,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:34,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 04:04:34,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1834, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 04:04:34,981 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 30 states have internal predecessors, (59), 9 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (21), 16 states have call predecessors, (21), 9 states have call successors, (21) [2025-01-09 04:04:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:35,427 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2025-01-09 04:04:35,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 04:04:35,428 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 30 states have internal predecessors, (59), 9 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (21), 16 states have call predecessors, (21), 9 states have call successors, (21) Word has length 47 [2025-01-09 04:04:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:35,429 INFO L225 Difference]: With dead ends: 55 [2025-01-09 04:04:35,429 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 04:04:35,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=631, Invalid=3925, Unknown=0, NotChecked=0, Total=4556 [2025-01-09 04:04:35,431 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:35,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 265 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:04:35,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 04:04:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 04:04:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:04:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2025-01-09 04:04:35,436 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2025-01-09 04:04:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:35,436 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2025-01-09 04:04:35,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 30 states have internal predecessors, (59), 9 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (21), 16 states have call predecessors, (21), 9 states have call successors, (21) [2025-01-09 04:04:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2025-01-09 04:04:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:04:35,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:35,438 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:35,444 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-01-09 04:04:35,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:35,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:35,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:35,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2030797316, now seen corresponding path program 4 times [2025-01-09 04:04:35,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:35,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91848360] [2025-01-09 04:04:35,643 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 04:04:35,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:35,648 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-01-09 04:04:35,657 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:04:35,657 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 04:04:35,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-01-09 04:04:36,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:36,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91848360] [2025-01-09 04:04:36,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91848360] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:04:36,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038130045] [2025-01-09 04:04:36,734 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 04:04:36,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:36,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:36,737 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-01-09 04:04:36,738 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-01-09 04:04:36,794 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-01-09 04:04:36,813 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:04:36,814 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 04:04:36,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:36,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-01-09 04:04:36,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:04:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-01-09 04:04:37,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:05:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-09 04:05:00,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038130045] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:05:00,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:05:00,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 42] total 75 [2025-01-09 04:05:00,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603028840] [2025-01-09 04:05:00,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:05:00,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2025-01-09 04:05:00,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:05:00,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2025-01-09 04:05:00,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=5001, Unknown=0, NotChecked=0, Total=5550 [2025-01-09 04:05:00,551 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 75 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 47 states have internal predecessors, (94), 15 states have call successors, (15), 1 states have call predecessors, (15), 27 states have return successors, (39), 28 states have call predecessors, (39), 15 states have call successors, (39) [2025-01-09 04:05:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:05:02,240 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2025-01-09 04:05:02,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-01-09 04:05:02,240 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 47 states have internal predecessors, (94), 15 states have call successors, (15), 1 states have call predecessors, (15), 27 states have return successors, (39), 28 states have call predecessors, (39), 15 states have call successors, (39) Word has length 83 [2025-01-09 04:05:02,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:05:02,241 INFO L225 Difference]: With dead ends: 91 [2025-01-09 04:05:02,241 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 04:05:02,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2890 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1810, Invalid=12710, Unknown=0, NotChecked=0, Total=14520 [2025-01-09 04:05:02,244 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 124 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:05:02,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 680 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:05:02,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 04:05:02,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-01-09 04:05:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 58 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (26), 25 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 04:05:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2025-01-09 04:05:02,252 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2025-01-09 04:05:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:05:02,252 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2025-01-09 04:05:02,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 47 states have internal predecessors, (94), 15 states have call successors, (15), 1 states have call predecessors, (15), 27 states have return successors, (39), 28 states have call predecessors, (39), 15 states have call successors, (39) [2025-01-09 04:05:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2025-01-09 04:05:02,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 04:05:02,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:05:02,256 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:05:02,262 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-01-09 04:05:02,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:05:02,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:05:02,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:05:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash -341184380, now seen corresponding path program 5 times [2025-01-09 04:05:02,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:05:02,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305397463] [2025-01-09 04:05:02,461 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 04:05:02,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:05:02,478 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 155 statements into 25 equivalence classes. [2025-01-09 04:05:02,538 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 04:05:02,538 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2025-01-09 04:05:02,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:05:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2025-01-09 04:05:04,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:05:04,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305397463] [2025-01-09 04:05:04,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305397463] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:05:04,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10774991] [2025-01-09 04:05:04,912 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 04:05:04,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:05:04,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:05:04,915 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-01-09 04:05:04,916 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-01-09 04:05:05,211 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 155 statements into 25 equivalence classes. [2025-01-09 04:05:05,287 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 04:05:05,288 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2025-01-09 04:05:05,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:05:05,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 04:05:05,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:05:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 876 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2025-01-09 04:05:08,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:05:08,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10774991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:05:08,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:05:08,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [54] total 106 [2025-01-09 04:05:08,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89684879] [2025-01-09 04:05:08,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:05:08,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-01-09 04:05:08,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:05:08,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-01-09 04:05:08,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=10343, Unknown=0, NotChecked=0, Total=11130 [2025-01-09 04:05:08,509 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 54 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (25), 25 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 04:05:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:05:08,705 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2025-01-09 04:05:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-01-09 04:05:08,706 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (25), 25 states have call predecessors, (25), 2 states have call successors, (25) Word has length 155 [2025-01-09 04:05:08,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:05:08,707 INFO L225 Difference]: With dead ends: 85 [2025-01-09 04:05:08,707 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:05:08,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=787, Invalid=10343, Unknown=0, NotChecked=0, Total=11130 [2025-01-09 04:05:08,710 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:05:08,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 467 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:05:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:05:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:05:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-01-09 04:05:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:05:08,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2025-01-09 04:05:08,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:05:08,711 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:05:08,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (25), 25 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 04:05:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:05:08,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:05:08,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:05:08,721 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-01-09 04:05:08,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:05:08,920 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1] [2025-01-09 04:05:08,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:05:09,394 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:05:09,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:05:09 BoogieIcfgContainer [2025-01-09 04:05:09,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:05:09,399 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:05:09,399 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:05:09,399 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:05:09,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:04:27" (3/4) ... [2025-01-09 04:05:09,402 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:05:09,406 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure hanoi [2025-01-09 04:05:09,409 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-09 04:05:09,410 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 04:05:09,410 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 04:05:09,410 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:05:09,461 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:05:09,462 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:05:09,462 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:05:09,463 INFO L158 Benchmark]: Toolchain (without parser) took 42104.45ms. Allocated memory was 201.3MB in the beginning and 469.8MB in the end (delta: 268.4MB). Free memory was 154.7MB in the beginning and 335.4MB in the end (delta: -180.7MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2025-01-09 04:05:09,463 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:05:09,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 125.32ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 144.1MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:05:09,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.64ms. Allocated memory is still 201.3MB. Free memory was 144.1MB in the beginning and 142.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:05:09,464 INFO L158 Benchmark]: Boogie Preprocessor took 23.48ms. Allocated memory is still 201.3MB. Free memory was 142.8MB in the beginning and 142.0MB in the end (delta: 849.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:05:09,464 INFO L158 Benchmark]: RCFGBuilder took 176.41ms. Allocated memory is still 201.3MB. Free memory was 142.0MB in the beginning and 131.7MB in the end (delta: 10.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:05:09,465 INFO L158 Benchmark]: TraceAbstraction took 41689.32ms. Allocated memory was 201.3MB in the beginning and 469.8MB in the end (delta: 268.4MB). Free memory was 131.3MB in the beginning and 339.4MB in the end (delta: -208.1MB). Peak memory consumption was 236.9MB. Max. memory is 16.1GB. [2025-01-09 04:05:09,465 INFO L158 Benchmark]: Witness Printer took 62.99ms. Allocated memory is still 469.8MB. Free memory was 339.4MB in the beginning and 335.4MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:05:09,466 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 125.32ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 144.1MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.64ms. Allocated memory is still 201.3MB. Free memory was 144.1MB in the beginning and 142.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.48ms. Allocated memory is still 201.3MB. Free memory was 142.8MB in the beginning and 142.0MB in the end (delta: 849.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 176.41ms. Allocated memory is still 201.3MB. Free memory was 142.0MB in the beginning and 131.7MB in the end (delta: 10.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 41689.32ms. Allocated memory was 201.3MB in the beginning and 469.8MB in the end (delta: 268.4MB). Free memory was 131.3MB in the beginning and 339.4MB in the end (delta: -208.1MB). Peak memory consumption was 236.9MB. Max. memory is 16.1GB. * Witness Printer took 62.99ms. Allocated memory is still 469.8MB. Free memory was 339.4MB in the beginning and 335.4MB in the end (delta: 3.9MB). 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 - PositiveResult [Line: 35]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.2s, OverallIterations: 6, TraceHistogramMax: 25, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 1663 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1532 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2245 IncrementalHoareTripleChecker+Invalid, 2320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 131 mSDtfsCounter, 2245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 755 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4767 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=5, InterpolantAutomatonStates: 174, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 36.3s InterpolantComputationTime, 673 NumberOfCodeBlocks, 673 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 834 ConstructedInterpolants, 0 QuantifiedInterpolants, 3460 SizeOfPredicates, 22 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 3292/5280 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 04:05:09,491 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 Result: TRUE