./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-simple/fibo_2calls_6-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 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:58:15,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:58:15,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:58:15,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:58:15,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:58:15,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:58:15,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:58:15,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:58:15,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:58:15,658 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:58:15,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:58:15,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:58:15,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:58:15,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:58:15,661 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:58:15,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:58:15,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:58:15,661 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:58:15,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:58:15,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:58:15,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:58:15,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:58:15,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:58:15,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:58:15,662 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:58:15,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:58:15,662 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:58:15,662 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:58:15,662 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:58:15,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:58:15,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:58:15,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:58:15,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:58:15,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:58:15,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:58:15,664 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:58:15,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:58:15,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:58:15,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:58:15,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:58:15,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:58:15,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:58:15,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:58:15,665 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 -> 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a [2025-02-05 15:58:15,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:58:15,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:58:15,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:58:15,996 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:58:15,997 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:58:15,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2025-02-05 15:58:17,289 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f6c081a4/31947933f0a448a691c3c148e767fdc1/FLAGa2f4dd903 [2025-02-05 15:58:17,528 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:58:17,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2025-02-05 15:58:17,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f6c081a4/31947933f0a448a691c3c148e767fdc1/FLAGa2f4dd903 [2025-02-05 15:58:17,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f6c081a4/31947933f0a448a691c3c148e767fdc1 [2025-02-05 15:58:17,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:58:17,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:58:17,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:58:17,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:58:17,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:58:17,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:58:17" (1/1) ... [2025-02-05 15:58:17,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ac6f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:17, skipping insertion in model container [2025-02-05 15:58:17,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:58:17" (1/1) ... [2025-02-05 15:58:17,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:58:18,006 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-simple/fibo_2calls_6-2.c[946,959] [2025-02-05 15:58:18,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:58:18,018 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:58:18,030 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-simple/fibo_2calls_6-2.c[946,959] [2025-02-05 15:58:18,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:58:18,042 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:58:18,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:18 WrapperNode [2025-02-05 15:58:18,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:58:18,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:58:18,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:58:18,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:58:18,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:18" (1/1) ... [2025-02-05 15:58:18,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:18" (1/1) ... [2025-02-05 15:58:18,063 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2025-02-05 15:58:18,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:58:18,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:58:18,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:58:18,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:58:18,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:18" (1/1) ... [2025-02-05 15:58:18,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:18" (1/1) ... [2025-02-05 15:58:18,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:18" (1/1) ... [2025-02-05 15:58:18,078 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-05 15:58:18,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:18" (1/1) ... [2025-02-05 15:58:18,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:18" (1/1) ... [2025-02-05 15:58:18,081 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:18" (1/1) ... [2025-02-05 15:58:18,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:18" (1/1) ... [2025-02-05 15:58:18,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:18" (1/1) ... [2025-02-05 15:58:18,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:18" (1/1) ... [2025-02-05 15:58:18,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:58:18,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:58:18,084 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:58:18,084 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:58:18,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:18" (1/1) ... [2025-02-05 15:58:18,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:58:18,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:18,114 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-05 15:58:18,116 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-05 15:58:18,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:58:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:58:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2025-02-05 15:58:18,133 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2025-02-05 15:58:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2025-02-05 15:58:18,133 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2025-02-05 15:58:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:58:18,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:58:18,174 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:58:18,175 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:58:18,262 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~ret6;havoc #t~ret7; [2025-02-05 15:58:18,278 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret4;havoc #t~ret5; [2025-02-05 15:58:18,289 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 15:58:18,289 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:58:18,297 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:58:18,298 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:58:18,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:58:18 BoogieIcfgContainer [2025-02-05 15:58:18,298 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:58:18,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:58:18,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:58:18,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:58:18,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:58:17" (1/3) ... [2025-02-05 15:58:18,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5779cf8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:58:18, skipping insertion in model container [2025-02-05 15:58:18,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:18" (2/3) ... [2025-02-05 15:58:18,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5779cf8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:58:18, skipping insertion in model container [2025-02-05 15:58:18,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:58:18" (3/3) ... [2025-02-05 15:58:18,311 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2025-02-05 15:58:18,326 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:58:18,328 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_2calls_6-2.c that has 3 procedures, 29 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 15:58:18,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:58:18,396 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;@41b9dec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:58:18,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:58:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 15:58:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 15:58:18,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:18,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:18,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:18,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:18,415 INFO L85 PathProgramCache]: Analyzing trace with hash -402987893, now seen corresponding path program 1 times [2025-02-05 15:58:18,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:18,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047255965] [2025-02-05 15:58:18,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:18,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:18,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 15:58:18,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 15:58:18,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:18,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:18,621 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-05 15:58:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:18,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047255965] [2025-02-05 15:58:18,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047255965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:58:18,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:58:18,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:58:18,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143284979] [2025-02-05 15:58:18,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:58:18,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:58:18,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:18,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:58:18,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:58:18,648 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-02-05 15:58:18,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:18,695 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-02-05 15:58:18,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:58:18,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2025-02-05 15:58:18,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:18,704 INFO L225 Difference]: With dead ends: 39 [2025-02-05 15:58:18,705 INFO L226 Difference]: Without dead ends: 27 [2025-02-05 15:58:18,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-05 15:58:18,713 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:18,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:58:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-05 15:58:18,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-05 15:58:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-05 15:58:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-02-05 15:58:18,750 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2025-02-05 15:58:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:18,751 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-02-05 15:58:18,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-02-05 15:58:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-02-05 15:58:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 15:58:18,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:18,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:18,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:58:18,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:18,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:18,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1356301235, now seen corresponding path program 1 times [2025-02-05 15:58:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:18,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108340873] [2025-02-05 15:58:18,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:18,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:18,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 15:58:18,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 15:58:18,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:18,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:18,813 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-05 15:58:18,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:18,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108340873] [2025-02-05 15:58:18,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108340873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:58:18,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:58:18,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:58:18,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989077217] [2025-02-05 15:58:18,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:58:18,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:58:18,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:18,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:58:18,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:58:18,816 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-02-05 15:58:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:18,832 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2025-02-05 15:58:18,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:58:18,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-02-05 15:58:18,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:18,833 INFO L225 Difference]: With dead ends: 33 [2025-02-05 15:58:18,834 INFO L226 Difference]: Without dead ends: 29 [2025-02-05 15:58:18,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-05 15:58:18,834 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 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-05 15:58:18,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:58:18,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-05 15:58:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-02-05 15:58:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-05 15:58:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-02-05 15:58:18,840 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2025-02-05 15:58:18,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:18,841 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-02-05 15:58:18,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-02-05 15:58:18,841 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-02-05 15:58:18,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 15:58:18,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:18,842 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:18,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:58:18,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:18,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:18,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1190707769, now seen corresponding path program 1 times [2025-02-05 15:58:18,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:18,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595188178] [2025-02-05 15:58:18,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:18,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:18,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 15:58:18,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 15:58:18,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:18,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:58:18,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:18,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595188178] [2025-02-05 15:58:18,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595188178] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:18,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875275877] [2025-02-05 15:58:18,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:18,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:18,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:18,994 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-05 15:58:18,996 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-05 15:58:19,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 15:58:19,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 15:58:19,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:19,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:19,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:58:19,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:58:19,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:58:19,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875275877] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:19,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:19,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-02-05 15:58:19,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013435538] [2025-02-05 15:58:19,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:19,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:58:19,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:19,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:58:19,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:58:19,407 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 15:58:19,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:19,540 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2025-02-05 15:58:19,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:58:19,541 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2025-02-05 15:58:19,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:19,543 INFO L225 Difference]: With dead ends: 55 [2025-02-05 15:58:19,544 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 15:58:19,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:58:19,546 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:19,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 105 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 15:58:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2025-02-05 15:58:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-05 15:58:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-02-05 15:58:19,554 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2025-02-05 15:58:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:19,555 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-02-05 15:58:19,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 15:58:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-02-05 15:58:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 15:58:19,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:19,556 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:19,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:58:19,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:19,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:19,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1027112458, now seen corresponding path program 1 times [2025-02-05 15:58:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:19,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131714051] [2025-02-05 15:58:19,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:19,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:19,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 15:58:19,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 15:58:19,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:19,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:58:19,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:19,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131714051] [2025-02-05 15:58:19,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131714051] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:19,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106437028] [2025-02-05 15:58:19,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:19,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:19,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:19,872 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-05 15:58:19,874 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-05 15:58:19,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 15:58:19,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 15:58:19,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:19,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:19,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:58:19,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:58:19,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:58:20,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106437028] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:20,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:20,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-02-05 15:58:20,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708132263] [2025-02-05 15:58:20,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:20,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:58:20,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:20,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:58:20,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:58:20,127 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 10 states, 8 states have (on average 3.125) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 15:58:20,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:20,254 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2025-02-05 15:58:20,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:58:20,255 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2025-02-05 15:58:20,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:20,256 INFO L225 Difference]: With dead ends: 40 [2025-02-05 15:58:20,256 INFO L226 Difference]: Without dead ends: 36 [2025-02-05 15:58:20,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:58:20,257 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:20,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 135 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-05 15:58:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-02-05 15:58:20,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-05 15:58:20,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-02-05 15:58:20,270 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 24 [2025-02-05 15:58:20,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:20,270 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-02-05 15:58:20,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 15:58:20,271 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-02-05 15:58:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 15:58:20,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:20,272 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:20,280 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-05 15:58:20,473 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-05 15:58:20,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:20,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:20,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1200844378, now seen corresponding path program 1 times [2025-02-05 15:58:20,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:20,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959800061] [2025-02-05 15:58:20,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:20,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:20,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 15:58:20,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 15:58:20,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:20,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 15:58:20,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:20,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959800061] [2025-02-05 15:58:20,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959800061] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:20,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708188134] [2025-02-05 15:58:20,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:20,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:20,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:20,566 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-05 15:58:20,568 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-05 15:58:20,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 15:58:20,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 15:58:20,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:20,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:20,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:58:20,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 15:58:20,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:58:21,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708188134] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:21,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:21,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2025-02-05 15:58:21,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447831175] [2025-02-05 15:58:21,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:21,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:58:21,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:21,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:58:21,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:58:21,027 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-05 15:58:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:21,175 INFO L93 Difference]: Finished difference Result 69 states and 100 transitions. [2025-02-05 15:58:21,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:58:21,176 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2025-02-05 15:58:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:21,177 INFO L225 Difference]: With dead ends: 69 [2025-02-05 15:58:21,177 INFO L226 Difference]: Without dead ends: 38 [2025-02-05 15:58:21,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:58:21,178 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:21,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 146 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-05 15:58:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-02-05 15:58:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-05 15:58:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2025-02-05 15:58:21,185 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 36 [2025-02-05 15:58:21,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:21,185 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2025-02-05 15:58:21,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-05 15:58:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2025-02-05 15:58:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 15:58:21,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:21,186 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:21,194 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-05 15:58:21,387 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-05 15:58:21,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:21,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:21,387 INFO L85 PathProgramCache]: Analyzing trace with hash -255039370, now seen corresponding path program 1 times [2025-02-05 15:58:21,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:21,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529002608] [2025-02-05 15:58:21,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:21,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:21,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 15:58:21,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 15:58:21,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:21,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:58:21,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:21,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529002608] [2025-02-05 15:58:21,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529002608] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:21,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493776389] [2025-02-05 15:58:21,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:21,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:21,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:21,547 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-05 15:58:21,550 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-05 15:58:21,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 15:58:21,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 15:58:21,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:21,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:21,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:58:21,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 15:58:21,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:58:21,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493776389] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:21,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:21,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2025-02-05 15:58:21,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616470425] [2025-02-05 15:58:21,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:21,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 15:58:21,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:21,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 15:58:21,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-02-05 15:58:21,997 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-05 15:58:22,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:22,400 INFO L93 Difference]: Finished difference Result 101 states and 161 transitions. [2025-02-05 15:58:22,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 15:58:22,401 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2025-02-05 15:58:22,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:22,403 INFO L225 Difference]: With dead ends: 101 [2025-02-05 15:58:22,403 INFO L226 Difference]: Without dead ends: 68 [2025-02-05 15:58:22,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2025-02-05 15:58:22,408 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 39 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:22,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 300 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:58:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-05 15:58:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2025-02-05 15:58:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 39 states have internal predecessors, (41), 11 states have call successors, (11), 3 states have call predecessors, (11), 9 states have return successors, (34), 13 states have call predecessors, (34), 11 states have call successors, (34) [2025-02-05 15:58:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2025-02-05 15:58:22,435 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 37 [2025-02-05 15:58:22,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:22,435 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2025-02-05 15:58:22,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-05 15:58:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2025-02-05 15:58:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 15:58:22,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:22,438 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:22,446 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-05 15:58:22,641 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-05 15:58:22,642 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:22,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1862824006, now seen corresponding path program 1 times [2025-02-05 15:58:22,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:22,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545475971] [2025-02-05 15:58:22,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:22,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:22,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 15:58:22,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 15:58:22,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:22,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:58:22,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:22,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545475971] [2025-02-05 15:58:22,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545475971] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:22,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998467922] [2025-02-05 15:58:22,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:22,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:22,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:22,772 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-05 15:58:22,775 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-05 15:58:22,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 15:58:22,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 15:58:22,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:22,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:22,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:58:22,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:58:22,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:58:23,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998467922] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:23,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:23,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2025-02-05 15:58:23,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809288462] [2025-02-05 15:58:23,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:23,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 15:58:23,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:23,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 15:58:23,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:58:23,380 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2025-02-05 15:58:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:23,582 INFO L93 Difference]: Finished difference Result 102 states and 193 transitions. [2025-02-05 15:58:23,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 15:58:23,583 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) Word has length 51 [2025-02-05 15:58:23,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:23,585 INFO L225 Difference]: With dead ends: 102 [2025-02-05 15:58:23,585 INFO L226 Difference]: Without dead ends: 98 [2025-02-05 15:58:23,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:58:23,586 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:23,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 161 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:23,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-05 15:58:23,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 64. [2025-02-05 15:58:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.15) internal successors, (46), 44 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 11 states have return successors, (48), 16 states have call predecessors, (48), 12 states have call successors, (48) [2025-02-05 15:58:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2025-02-05 15:58:23,602 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 51 [2025-02-05 15:58:23,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:23,602 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2025-02-05 15:58:23,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2025-02-05 15:58:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2025-02-05 15:58:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 15:58:23,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:23,605 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:23,613 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-05 15:58:23,806 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-05 15:58:23,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:23,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:23,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1518497941, now seen corresponding path program 1 times [2025-02-05 15:58:23,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:23,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98304190] [2025-02-05 15:58:23,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:23,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:23,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 15:58:23,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 15:58:23,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:23,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 15:58:24,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:24,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98304190] [2025-02-05 15:58:24,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98304190] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:24,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399662113] [2025-02-05 15:58:24,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:24,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:24,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:24,016 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-05 15:58:24,017 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-05 15:58:24,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 15:58:24,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 15:58:24,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:24,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:24,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 15:58:24,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 71 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-05 15:58:24,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 81 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:58:24,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399662113] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:24,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:24,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 22 [2025-02-05 15:58:24,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733700156] [2025-02-05 15:58:24,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:24,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 15:58:24,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:24,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 15:58:24,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:58:24,898 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand has 22 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 22 states have internal predecessors, (72), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2025-02-05 15:58:25,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:25,399 INFO L93 Difference]: Finished difference Result 177 states and 369 transitions. [2025-02-05 15:58:25,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 15:58:25,399 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 22 states have internal predecessors, (72), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) Word has length 80 [2025-02-05 15:58:25,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:25,402 INFO L225 Difference]: With dead ends: 177 [2025-02-05 15:58:25,402 INFO L226 Difference]: Without dead ends: 104 [2025-02-05 15:58:25,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 148 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=1222, Unknown=0, NotChecked=0, Total=1482 [2025-02-05 15:58:25,405 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 89 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:25,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 324 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:58:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-05 15:58:25,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2025-02-05 15:58:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 64 states have internal predecessors, (73), 16 states have call successors, (16), 8 states have call predecessors, (16), 14 states have return successors, (43), 20 states have call predecessors, (43), 16 states have call successors, (43) [2025-02-05 15:58:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2025-02-05 15:58:25,449 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 80 [2025-02-05 15:58:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:25,449 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2025-02-05 15:58:25,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 22 states have internal predecessors, (72), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2025-02-05 15:58:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2025-02-05 15:58:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:58:25,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:25,457 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:25,467 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-05 15:58:25,657 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-05 15:58:25,658 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:25,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:25,658 INFO L85 PathProgramCache]: Analyzing trace with hash 830576147, now seen corresponding path program 1 times [2025-02-05 15:58:25,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:25,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641158173] [2025-02-05 15:58:25,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:25,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:25,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:58:25,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:58:25,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:25,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 42 proven. 136 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-02-05 15:58:25,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:25,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641158173] [2025-02-05 15:58:25,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641158173] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:25,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482003408] [2025-02-05 15:58:25,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:25,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:25,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:25,860 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-05 15:58:25,862 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-05 15:58:25,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:58:25,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:58:25,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:25,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:25,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 15:58:25,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 42 proven. 136 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-02-05 15:58:25,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 42 proven. 144 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2025-02-05 15:58:26,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482003408] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:26,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:26,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 15 [2025-02-05 15:58:26,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575084149] [2025-02-05 15:58:26,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:26,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 15:58:26,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:26,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 15:58:26,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:58:26,789 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 11 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (18), 8 states have call predecessors, (18), 11 states have call successors, (18) [2025-02-05 15:58:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:26,924 INFO L93 Difference]: Finished difference Result 130 states and 207 transitions. [2025-02-05 15:58:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:58:26,925 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 11 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (18), 8 states have call predecessors, (18), 11 states have call successors, (18) Word has length 133 [2025-02-05 15:58:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:26,927 INFO L225 Difference]: With dead ends: 130 [2025-02-05 15:58:26,927 INFO L226 Difference]: Without dead ends: 126 [2025-02-05 15:58:26,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 258 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-02-05 15:58:26,928 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:26,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 154 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-05 15:58:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 105. [2025-02-05 15:58:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 71 states have internal predecessors, (80), 19 states have call successors, (19), 8 states have call predecessors, (19), 16 states have return successors, (63), 25 states have call predecessors, (63), 19 states have call successors, (63) [2025-02-05 15:58:26,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 162 transitions. [2025-02-05 15:58:26,966 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 162 transitions. Word has length 133 [2025-02-05 15:58:26,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:26,967 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 162 transitions. [2025-02-05 15:58:26,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 11 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (18), 8 states have call predecessors, (18), 11 states have call successors, (18) [2025-02-05 15:58:26,967 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 162 transitions. [2025-02-05 15:58:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-05 15:58:26,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:26,973 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 14, 13, 13, 12, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:26,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:27,173 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-05 15:58:27,174 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:27,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1346988161, now seen corresponding path program 2 times [2025-02-05 15:58:27,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:27,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154347991] [2025-02-05 15:58:27,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:58:27,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:27,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 216 statements into 2 equivalence classes. [2025-02-05 15:58:27,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 15:58:27,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:58:27,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 71 proven. 218 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2025-02-05 15:58:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:27,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154347991] [2025-02-05 15:58:27,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154347991] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:27,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914805888] [2025-02-05 15:58:27,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:58:27,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:27,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:27,432 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:27,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 15:58:27,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 216 statements into 2 equivalence classes. [2025-02-05 15:58:27,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 15:58:27,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:58:27,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:27,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:58:27,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 71 proven. 218 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2025-02-05 15:58:27,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 71 proven. 223 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2025-02-05 15:58:28,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914805888] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:28,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:28,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 13 [2025-02-05 15:58:28,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210863784] [2025-02-05 15:58:28,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:28,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:58:28,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:28,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:58:28,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:58:28,321 INFO L87 Difference]: Start difference. First operand 105 states and 162 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 9 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (15), 7 states have call predecessors, (15), 9 states have call successors, (15) [2025-02-05 15:58:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:28,476 INFO L93 Difference]: Finished difference Result 135 states and 241 transitions. [2025-02-05 15:58:28,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:58:28,476 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 9 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (15), 7 states have call predecessors, (15), 9 states have call successors, (15) Word has length 216 [2025-02-05 15:58:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:28,478 INFO L225 Difference]: With dead ends: 135 [2025-02-05 15:58:28,479 INFO L226 Difference]: Without dead ends: 131 [2025-02-05 15:58:28,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 425 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:58:28,480 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:28,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 150 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-05 15:58:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 105. [2025-02-05 15:58:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 71 states have internal predecessors, (80), 19 states have call successors, (19), 8 states have call predecessors, (19), 16 states have return successors, (63), 25 states have call predecessors, (63), 19 states have call successors, (63) [2025-02-05 15:58:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 162 transitions. [2025-02-05 15:58:28,495 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 162 transitions. Word has length 216 [2025-02-05 15:58:28,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:28,495 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 162 transitions. [2025-02-05 15:58:28,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 9 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (15), 7 states have call predecessors, (15), 9 states have call successors, (15) [2025-02-05 15:58:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 162 transitions. [2025-02-05 15:58:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 15:58:28,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:28,499 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 11, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:28,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:28,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:28,699 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:28,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:28,700 INFO L85 PathProgramCache]: Analyzing trace with hash 433596799, now seen corresponding path program 3 times [2025-02-05 15:58:28,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:28,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373058649] [2025-02-05 15:58:28,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:58:28,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:28,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 187 statements into 11 equivalence classes. [2025-02-05 15:58:28,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 92 of 187 statements. [2025-02-05 15:58:28,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-05 15:58:28,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 276 proven. 26 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2025-02-05 15:58:29,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:29,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373058649] [2025-02-05 15:58:29,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373058649] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:29,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049298403] [2025-02-05 15:58:29,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:58:29,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:29,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:29,019 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:29,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 15:58:29,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 187 statements into 11 equivalence classes. [2025-02-05 15:58:29,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 92 of 187 statements. [2025-02-05 15:58:29,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-05 15:58:29,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:29,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 15:58:29,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 303 proven. 33 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2025-02-05 15:58:29,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 303 proven. 35 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2025-02-05 15:58:29,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049298403] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:29,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:29,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 24 [2025-02-05 15:58:29,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011224537] [2025-02-05 15:58:29,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:29,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 15:58:29,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:29,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 15:58:29,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-02-05 15:58:29,997 INFO L87 Difference]: Start difference. First operand 105 states and 162 transitions. Second operand has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 24 states have internal predecessors, (74), 13 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 10 states have call predecessors, (22), 13 states have call successors, (22) [2025-02-05 15:58:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:30,319 INFO L93 Difference]: Finished difference Result 220 states and 377 transitions. [2025-02-05 15:58:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 15:58:30,320 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 24 states have internal predecessors, (74), 13 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 10 states have call predecessors, (22), 13 states have call successors, (22) Word has length 187 [2025-02-05 15:58:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:30,323 INFO L225 Difference]: With dead ends: 220 [2025-02-05 15:58:30,323 INFO L226 Difference]: Without dead ends: 125 [2025-02-05 15:58:30,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 360 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=988, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 15:58:30,325 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 48 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:30,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 259 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:58:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-05 15:58:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2025-02-05 15:58:30,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 21 states have call successors, (21), 10 states have call predecessors, (21), 18 states have return successors, (79), 29 states have call predecessors, (79), 21 states have call successors, (79) [2025-02-05 15:58:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 190 transitions. [2025-02-05 15:58:30,350 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 190 transitions. Word has length 187 [2025-02-05 15:58:30,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:30,351 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 190 transitions. [2025-02-05 15:58:30,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 24 states have internal predecessors, (74), 13 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 10 states have call predecessors, (22), 13 states have call successors, (22) [2025-02-05 15:58:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 190 transitions. [2025-02-05 15:58:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-05 15:58:30,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:30,354 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 14, 14, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:30,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 15:58:30,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:30,555 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:30,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:30,555 INFO L85 PathProgramCache]: Analyzing trace with hash -842573943, now seen corresponding path program 4 times [2025-02-05 15:58:30,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:30,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057294016] [2025-02-05 15:58:30,556 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:58:30,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:30,566 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 242 statements into 2 equivalence classes. [2025-02-05 15:58:30,589 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 206 of 242 statements. [2025-02-05 15:58:30,589 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 15:58:30,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 243 proven. 106 refuted. 0 times theorem prover too weak. 1245 trivial. 0 not checked. [2025-02-05 15:58:30,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:30,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057294016] [2025-02-05 15:58:30,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057294016] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:30,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792651607] [2025-02-05 15:58:30,771 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:58:30,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:30,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:30,774 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:30,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 15:58:30,842 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 242 statements into 2 equivalence classes. [2025-02-05 15:58:30,883 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 206 of 242 statements. [2025-02-05 15:58:30,883 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 15:58:30,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:30,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 15:58:30,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:30,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 174 proven. 299 refuted. 0 times theorem prover too weak. 1121 trivial. 0 not checked. [2025-02-05 15:58:30,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:32,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 174 proven. 313 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2025-02-05 15:58:32,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792651607] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:32,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:32,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 22 [2025-02-05 15:58:32,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747396380] [2025-02-05 15:58:32,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:32,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 15:58:32,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:32,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 15:58:32,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:58:32,277 INFO L87 Difference]: Start difference. First operand 119 states and 190 transitions. Second operand has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 22 states have internal predecessors, (73), 15 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (28), 13 states have call predecessors, (28), 15 states have call successors, (28) [2025-02-05 15:58:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:32,498 INFO L93 Difference]: Finished difference Result 164 states and 323 transitions. [2025-02-05 15:58:32,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 15:58:32,498 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 22 states have internal predecessors, (73), 15 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (28), 13 states have call predecessors, (28), 15 states have call successors, (28) Word has length 242 [2025-02-05 15:58:32,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:32,500 INFO L225 Difference]: With dead ends: 164 [2025-02-05 15:58:32,500 INFO L226 Difference]: Without dead ends: 132 [2025-02-05 15:58:32,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 468 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2025-02-05 15:58:32,502 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:32,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 369 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:58:32,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-05 15:58:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-02-05 15:58:32,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 87 states have (on average 1.1264367816091954) internal successors, (98), 87 states have internal predecessors, (98), 23 states have call successors, (23), 10 states have call predecessors, (23), 21 states have return successors, (68), 34 states have call predecessors, (68), 23 states have call successors, (68) [2025-02-05 15:58:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 189 transitions. [2025-02-05 15:58:32,515 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 189 transitions. Word has length 242 [2025-02-05 15:58:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:32,516 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 189 transitions. [2025-02-05 15:58:32,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 22 states have internal predecessors, (73), 15 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (28), 13 states have call predecessors, (28), 15 states have call successors, (28) [2025-02-05 15:58:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 189 transitions. [2025-02-05 15:58:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 15:58:32,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:32,519 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:32,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 15:58:32,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 15:58:32,719 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:32,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1081438958, now seen corresponding path program 5 times [2025-02-05 15:58:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:32,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725321044] [2025-02-05 15:58:32,720 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:58:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:32,729 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 188 statements into 11 equivalence classes. [2025-02-05 15:58:32,735 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 75 of 188 statements. [2025-02-05 15:58:32,735 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-05 15:58:32,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:32,871 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 107 proven. 281 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-02-05 15:58:32,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:32,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725321044] [2025-02-05 15:58:32,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725321044] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:32,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350322369] [2025-02-05 15:58:32,872 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:58:32,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:32,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:32,874 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:32,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 15:58:32,949 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 188 statements into 11 equivalence classes. [2025-02-05 15:58:32,966 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 75 of 188 statements. [2025-02-05 15:58:32,966 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-05 15:58:32,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:32,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 15:58:32,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 526 proven. 55 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2025-02-05 15:58:33,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 105 proven. 283 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-02-05 15:58:33,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350322369] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:33,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:33,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 18 [2025-02-05 15:58:33,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557841308] [2025-02-05 15:58:33,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:33,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 15:58:33,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:33,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 15:58:33,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-05 15:58:33,869 INFO L87 Difference]: Start difference. First operand 132 states and 189 transitions. Second operand has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 12 states have call successors, (24), 2 states have call predecessors, (24), 7 states have return successors, (27), 9 states have call predecessors, (27), 12 states have call successors, (27) [2025-02-05 15:58:34,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:34,126 INFO L93 Difference]: Finished difference Result 281 states and 420 transitions. [2025-02-05 15:58:34,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 15:58:34,127 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 12 states have call successors, (24), 2 states have call predecessors, (24), 7 states have return successors, (27), 9 states have call predecessors, (27), 12 states have call successors, (27) Word has length 188 [2025-02-05 15:58:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:34,129 INFO L225 Difference]: With dead ends: 281 [2025-02-05 15:58:34,129 INFO L226 Difference]: Without dead ends: 156 [2025-02-05 15:58:34,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 365 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-02-05 15:58:34,132 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 61 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:34,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 198 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:58:34,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-05 15:58:34,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2025-02-05 15:58:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 90 states have (on average 1.1222222222222222) internal successors, (101), 90 states have internal predecessors, (101), 24 states have call successors, (24), 10 states have call predecessors, (24), 22 states have return successors, (74), 36 states have call predecessors, (74), 24 states have call successors, (74) [2025-02-05 15:58:34,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 199 transitions. [2025-02-05 15:58:34,147 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 199 transitions. Word has length 188 [2025-02-05 15:58:34,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:34,147 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 199 transitions. [2025-02-05 15:58:34,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 12 states have call successors, (24), 2 states have call predecessors, (24), 7 states have return successors, (27), 9 states have call predecessors, (27), 12 states have call successors, (27) [2025-02-05 15:58:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 199 transitions. [2025-02-05 15:58:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 15:58:34,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:34,150 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:34,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 15:58:34,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 15:58:34,350 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:34,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:34,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1132371489, now seen corresponding path program 6 times [2025-02-05 15:58:34,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:34,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357838628] [2025-02-05 15:58:34,351 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:58:34,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:34,358 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 147 statements into 9 equivalence classes. [2025-02-05 15:58:34,365 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 74 of 147 statements. [2025-02-05 15:58:34,369 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-05 15:58:34,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 111 proven. 27 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2025-02-05 15:58:34,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:34,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357838628] [2025-02-05 15:58:34,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357838628] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:34,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134507454] [2025-02-05 15:58:34,443 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:58:34,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:34,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:34,445 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:34,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 15:58:34,527 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 147 statements into 9 equivalence classes. [2025-02-05 15:58:34,547 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 74 of 147 statements. [2025-02-05 15:58:34,547 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-05 15:58:34,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:34,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:58:34,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 109 proven. 27 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2025-02-05 15:58:34,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 109 proven. 29 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2025-02-05 15:58:34,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134507454] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:34,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:34,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 12 [2025-02-05 15:58:34,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558273080] [2025-02-05 15:58:34,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:34,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:58:34,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:34,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:58:34,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:58:34,979 INFO L87 Difference]: Start difference. First operand 137 states and 199 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-05 15:58:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:35,102 INFO L93 Difference]: Finished difference Result 161 states and 238 transitions. [2025-02-05 15:58:35,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:58:35,103 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) Word has length 147 [2025-02-05 15:58:35,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:35,105 INFO L225 Difference]: With dead ends: 161 [2025-02-05 15:58:35,105 INFO L226 Difference]: Without dead ends: 157 [2025-02-05 15:58:35,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 287 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:58:35,106 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:35,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 100 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-05 15:58:35,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 148. [2025-02-05 15:58:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 97 states have (on average 1.134020618556701) internal successors, (110), 97 states have internal predecessors, (110), 27 states have call successors, (27), 11 states have call predecessors, (27), 23 states have return successors, (85), 39 states have call predecessors, (85), 27 states have call successors, (85) [2025-02-05 15:58:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2025-02-05 15:58:35,124 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 147 [2025-02-05 15:58:35,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:35,125 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2025-02-05 15:58:35,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-05 15:58:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2025-02-05 15:58:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 15:58:35,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:35,127 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:35,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-05 15:58:35,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:35,328 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:35,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:35,328 INFO L85 PathProgramCache]: Analyzing trace with hash -91407830, now seen corresponding path program 7 times [2025-02-05 15:58:35,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:35,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568427807] [2025-02-05 15:58:35,328 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 15:58:35,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:35,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 15:58:35,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 15:58:35,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:35,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 146 proven. 51 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2025-02-05 15:58:35,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:35,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568427807] [2025-02-05 15:58:35,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568427807] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:35,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388062288] [2025-02-05 15:58:35,468 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 15:58:35,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:35,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:35,470 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:35,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 15:58:35,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 15:58:35,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 15:58:35,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:35,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:35,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:58:35,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 146 proven. 51 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2025-02-05 15:58:35,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 148 proven. 54 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-02-05 15:58:36,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388062288] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:36,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:36,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 13 [2025-02-05 15:58:36,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047618268] [2025-02-05 15:58:36,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:36,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:58:36,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:36,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:58:36,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:58:36,182 INFO L87 Difference]: Start difference. First operand 148 states and 222 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 9 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (15), 7 states have call predecessors, (15), 9 states have call successors, (15) [2025-02-05 15:58:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:36,304 INFO L93 Difference]: Finished difference Result 158 states and 232 transitions. [2025-02-05 15:58:36,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:58:36,304 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 9 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (15), 7 states have call predecessors, (15), 9 states have call successors, (15) Word has length 160 [2025-02-05 15:58:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:36,308 INFO L225 Difference]: With dead ends: 158 [2025-02-05 15:58:36,309 INFO L226 Difference]: Without dead ends: 154 [2025-02-05 15:58:36,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 313 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:58:36,310 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:36,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 137 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-05 15:58:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 148. [2025-02-05 15:58:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 97 states have (on average 1.134020618556701) internal successors, (110), 97 states have internal predecessors, (110), 27 states have call successors, (27), 11 states have call predecessors, (27), 23 states have return successors, (85), 39 states have call predecessors, (85), 27 states have call successors, (85) [2025-02-05 15:58:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2025-02-05 15:58:36,325 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 160 [2025-02-05 15:58:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:36,326 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2025-02-05 15:58:36,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 9 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (15), 7 states have call predecessors, (15), 9 states have call successors, (15) [2025-02-05 15:58:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2025-02-05 15:58:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 15:58:36,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:36,328 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:36,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-05 15:58:36,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:36,532 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:36,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:36,532 INFO L85 PathProgramCache]: Analyzing trace with hash 300597469, now seen corresponding path program 8 times [2025-02-05 15:58:36,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:36,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328444821] [2025-02-05 15:58:36,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:58:36,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:36,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-02-05 15:58:36,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 15:58:36,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:58:36,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:58:36,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:58:36,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 15:58:36,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 15:58:36,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:36,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:58:36,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:58:36,605 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:58:36,606 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:58:36,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:58:36,610 INFO L422 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:36,661 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:58:36,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:58:36 BoogieIcfgContainer [2025-02-05 15:58:36,664 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:58:36,664 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:58:36,665 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:58:36,665 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:58:36,666 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:58:18" (3/4) ... [2025-02-05 15:58:36,666 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:58:36,725 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 97. [2025-02-05 15:58:36,819 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:58:36,820 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:58:36,820 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:58:36,821 INFO L158 Benchmark]: Toolchain (without parser) took 18968.61ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 121.8MB in the beginning and 149.4MB in the end (delta: -27.6MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2025-02-05 15:58:36,821 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:58:36,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.97ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 111.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:58:36,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.70ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 110.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:58:36,822 INFO L158 Benchmark]: Boogie Preprocessor took 19.81ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 109.0MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:58:36,822 INFO L158 Benchmark]: IcfgBuilder took 214.59ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 97.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:58:36,822 INFO L158 Benchmark]: TraceAbstraction took 18362.68ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 97.5MB in the beginning and 157.8MB in the end (delta: -60.3MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2025-02-05 15:58:36,822 INFO L158 Benchmark]: Witness Printer took 155.59ms. Allocated memory is still 243.3MB. Free memory was 157.8MB in the beginning and 149.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:58:36,823 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.23ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.97ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 111.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.70ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 110.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.81ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 109.0MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 214.59ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 97.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18362.68ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 97.5MB in the beginning and 157.8MB in the end (delta: -60.3MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Witness Printer took 155.59ms. Allocated memory is still 243.3MB. Free memory was 157.8MB in the beginning and 149.4MB in the end (delta: 8.4MB). 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: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 6; VAL [x=6] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=6] [L39] int result = fibo1(x); [L40] COND TRUE result == 8 VAL [x=6] [L41] reach_error() VAL [x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 16, TraceHistogramMax: 18, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 498 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 420 mSDsluCounter, 2787 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2397 mSDsCounter, 430 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3020 IncrementalHoareTripleChecker+Invalid, 3450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 430 mSolverCounterUnsat, 390 mSDtfsCounter, 3020 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3261 GetRequests, 2935 SyntacticMatches, 59 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=14, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 152 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 3243 NumberOfCodeBlocks, 2609 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 4552 ConstructedInterpolants, 0 QuantifiedInterpolants, 7351 SizeOfPredicates, 38 NumberOfNonLiveVariables, 2871 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 16721/19788 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-05 15:58:36,843 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