./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_8-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_8-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 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:58:23,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:58:23,644 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:23,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:58:23,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:58:23,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:58:23,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:58:23,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:58:23,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:58:23,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:58:23,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:58:23,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:58:23,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:58:23,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:58:23,669 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:58:23,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:58:23,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:58:23,670 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:58:23,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:58:23,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:58:23,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:58:23,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:58:23,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:58:23,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:58:23,670 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:58:23,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:58:23,671 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:58:23,671 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:58:23,671 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:58:23,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:58:23,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:58:23,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:58:23,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:58:23,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:58:23,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:58:23,672 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:58:23,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:58:23,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:58:23,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:58:23,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:58:23,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:58:23,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:58:23,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:58:23,672 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 -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2025-02-05 15:58:23,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:58:23,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:58:23,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:58:23,915 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:58:23,916 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:58:23,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2025-02-05 15:58:25,055 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/786a188fc/f237c502f6c54146be0b009997147b90/FLAGfbb3a802d [2025-02-05 15:58:25,296 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:58:25,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2025-02-05 15:58:25,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/786a188fc/f237c502f6c54146be0b009997147b90/FLAGfbb3a802d [2025-02-05 15:58:25,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/786a188fc/f237c502f6c54146be0b009997147b90 [2025-02-05 15:58:25,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:58:25,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:58:25,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:58:25,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:58:25,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:58:25,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:58:25" (1/1) ... [2025-02-05 15:58:25,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d73d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:25, skipping insertion in model container [2025-02-05 15:58:25,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:58:25" (1/1) ... [2025-02-05 15:58:25,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:58:25,742 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_8-2.c[947,960] [2025-02-05 15:58:25,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:58:25,752 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:58:25,761 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_8-2.c[947,960] [2025-02-05 15:58:25,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:58:25,771 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:58:25,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:25 WrapperNode [2025-02-05 15:58:25,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:58:25,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:58:25,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:58:25,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:58:25,777 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:25" (1/1) ... [2025-02-05 15:58:25,782 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:25" (1/1) ... [2025-02-05 15:58:25,791 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2025-02-05 15:58:25,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:58:25,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:58:25,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:58:25,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:58:25,797 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:25" (1/1) ... [2025-02-05 15:58:25,797 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:25" (1/1) ... [2025-02-05 15:58:25,802 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:25" (1/1) ... [2025-02-05 15:58:25,808 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:25,809 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:25" (1/1) ... [2025-02-05 15:58:25,809 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:25" (1/1) ... [2025-02-05 15:58:25,811 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:25" (1/1) ... [2025-02-05 15:58:25,814 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:25" (1/1) ... [2025-02-05 15:58:25,814 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:25" (1/1) ... [2025-02-05 15:58:25,815 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:25" (1/1) ... [2025-02-05 15:58:25,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:58:25,816 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:58:25,818 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:58:25,818 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:58:25,818 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:25" (1/1) ... [2025-02-05 15:58:25,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:58:25,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:25,844 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:25,847 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:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:58:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:58:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2025-02-05 15:58:25,865 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2025-02-05 15:58:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2025-02-05 15:58:25,865 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2025-02-05 15:58:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:58:25,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:58:25,907 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:58:25,908 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:58:25,975 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~ret6;havoc #t~ret7; [2025-02-05 15:58:25,988 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret4;havoc #t~ret5; [2025-02-05 15:58:25,996 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 15:58:25,997 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:58:26,003 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:58:26,003 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:58:26,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:58:26 BoogieIcfgContainer [2025-02-05 15:58:26,004 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:58:26,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:58:26,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:58:26,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:58:26,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:58:25" (1/3) ... [2025-02-05 15:58:26,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b87f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:58:26, skipping insertion in model container [2025-02-05 15:58:26,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:25" (2/3) ... [2025-02-05 15:58:26,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b87f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:58:26, skipping insertion in model container [2025-02-05 15:58:26,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:58:26" (3/3) ... [2025-02-05 15:58:26,010 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2025-02-05 15:58:26,021 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:58:26,023 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_2calls_8-2.c that has 3 procedures, 29 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 15:58:26,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:58:26,065 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;@679639c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:58:26,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:58:26,067 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:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 15:58:26,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:26,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:26,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:26,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:26,076 INFO L85 PathProgramCache]: Analyzing trace with hash -402987893, now seen corresponding path program 1 times [2025-02-05 15:58:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:26,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111913697] [2025-02-05 15:58:26,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:26,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:26,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 15:58:26,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 15:58:26,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:26,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:26,237 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:26,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:26,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111913697] [2025-02-05 15:58:26,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111913697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:58:26,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:58:26,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:58:26,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106831935] [2025-02-05 15:58:26,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:58:26,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:58:26,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:26,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:58:26,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:58:26,257 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:26,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:26,296 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-02-05 15:58:26,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:58:26,297 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:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:26,302 INFO L225 Difference]: With dead ends: 39 [2025-02-05 15:58:26,302 INFO L226 Difference]: Without dead ends: 27 [2025-02-05 15:58:26,304 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:26,309 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:26,310 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:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-05 15:58:26,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-05 15:58:26,332 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:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-02-05 15:58:26,338 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2025-02-05 15:58:26,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:26,339 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-02-05 15:58:26,339 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:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-02-05 15:58:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 15:58:26,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:26,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:26,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:58:26,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:26,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:26,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1356301235, now seen corresponding path program 1 times [2025-02-05 15:58:26,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:26,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960007500] [2025-02-05 15:58:26,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:26,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:26,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 15:58:26,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 15:58:26,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:26,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:26,420 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:26,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:26,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960007500] [2025-02-05 15:58:26,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960007500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:58:26,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:58:26,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:58:26,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190710470] [2025-02-05 15:58:26,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:58:26,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:58:26,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:26,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:58:26,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:58:26,423 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:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:26,439 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2025-02-05 15:58:26,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:58:26,441 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:26,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:26,441 INFO L225 Difference]: With dead ends: 33 [2025-02-05 15:58:26,441 INFO L226 Difference]: Without dead ends: 29 [2025-02-05 15:58:26,442 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:26,442 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:26,442 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:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-05 15:58:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-02-05 15:58:26,449 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:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-02-05 15:58:26,450 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2025-02-05 15:58:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:26,450 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-02-05 15:58:26,451 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:26,451 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-02-05 15:58:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 15:58:26,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:26,452 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:26,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:58:26,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:26,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1190707769, now seen corresponding path program 1 times [2025-02-05 15:58:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:26,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380330344] [2025-02-05 15:58:26,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:26,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:26,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 15:58:26,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 15:58:26,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:26,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:26,558 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:26,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:26,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380330344] [2025-02-05 15:58:26,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380330344] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:26,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400477150] [2025-02-05 15:58:26,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:26,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:26,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:26,561 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:26,563 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:26,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 15:58:26,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 15:58:26,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:26,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:26,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:58:26,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:26,688 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:26,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:26,888 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:26,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400477150] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:26,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:26,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-02-05 15:58:26,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609310536] [2025-02-05 15:58:26,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:26,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:58:26,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:26,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:58:26,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:58:26,892 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:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:27,004 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2025-02-05 15:58:27,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:58:27,004 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:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:27,005 INFO L225 Difference]: With dead ends: 55 [2025-02-05 15:58:27,005 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 15:58:27,005 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:27,006 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:27,006 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:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 15:58:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2025-02-05 15:58:27,009 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:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-02-05 15:58:27,010 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2025-02-05 15:58:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:27,010 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-02-05 15:58:27,011 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:27,011 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-02-05 15:58:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 15:58:27,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:27,011 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:27,017 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:27,216 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:27,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:27,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:27,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1027112458, now seen corresponding path program 1 times [2025-02-05 15:58:27,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:27,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655356577] [2025-02-05 15:58:27,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:27,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:27,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 15:58:27,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 15:58:27,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:27,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:27,326 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:27,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:27,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655356577] [2025-02-05 15:58:27,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655356577] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:27,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915218259] [2025-02-05 15:58:27,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:27,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:27,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:27,328 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:27,329 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:27,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 15:58:27,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 15:58:27,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:27,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:27,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:58:27,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:27,394 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:27,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:27,555 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:27,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915218259] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:27,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:27,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-02-05 15:58:27,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147972681] [2025-02-05 15:58:27,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:27,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:58:27,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:27,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:58:27,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:58:27,557 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:27,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:27,652 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2025-02-05 15:58:27,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:58:27,652 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:27,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:27,653 INFO L225 Difference]: With dead ends: 40 [2025-02-05 15:58:27,653 INFO L226 Difference]: Without dead ends: 36 [2025-02-05 15:58:27,653 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:27,653 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:27,654 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:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-05 15:58:27,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-02-05 15:58:27,658 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:27,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-02-05 15:58:27,658 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 24 [2025-02-05 15:58:27,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:27,659 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-02-05 15:58:27,659 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:27,659 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-02-05 15:58:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 15:58:27,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:27,660 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:27,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:27,860 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:27,860 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:27,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:27,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1200844378, now seen corresponding path program 1 times [2025-02-05 15:58:27,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:27,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326908916] [2025-02-05 15:58:27,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:27,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:27,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 15:58:27,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 15:58:27,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:27,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:27,942 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:27,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:27,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326908916] [2025-02-05 15:58:27,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326908916] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:27,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677246474] [2025-02-05 15:58:27,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:27,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:27,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:27,944 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:27,945 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:27,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 15:58:27,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 15:58:27,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:27,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:27,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:58:27,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:28,046 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:28,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:28,323 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:28,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677246474] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:28,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:28,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2025-02-05 15:58:28,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417463847] [2025-02-05 15:58:28,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:28,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:58:28,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:28,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:58:28,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:58:28,327 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:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:28,458 INFO L93 Difference]: Finished difference Result 69 states and 100 transitions. [2025-02-05 15:58:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:58:28,459 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:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:28,460 INFO L225 Difference]: With dead ends: 69 [2025-02-05 15:58:28,461 INFO L226 Difference]: Without dead ends: 38 [2025-02-05 15:58:28,462 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:28,462 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:28,462 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:28,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-05 15:58:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-02-05 15:58:28,468 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:28,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2025-02-05 15:58:28,470 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 36 [2025-02-05 15:58:28,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:28,470 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2025-02-05 15:58:28,471 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:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2025-02-05 15:58:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 15:58:28,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:28,472 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:28,477 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:28,676 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:28,676 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:28,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash -255039370, now seen corresponding path program 1 times [2025-02-05 15:58:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516334865] [2025-02-05 15:58:28,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:28,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:28,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 15:58:28,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 15:58:28,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:28,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:28,783 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:28,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:28,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516334865] [2025-02-05 15:58:28,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516334865] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:28,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580438572] [2025-02-05 15:58:28,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:28,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:28,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:28,785 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:28,787 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:28,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 15:58:28,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 15:58:28,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:28,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:28,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:58:28,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:28,886 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:28,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:29,139 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:29,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580438572] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:29,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:29,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2025-02-05 15:58:29,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811691542] [2025-02-05 15:58:29,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:29,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 15:58:29,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:29,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 15:58:29,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-02-05 15:58:29,141 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:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:29,466 INFO L93 Difference]: Finished difference Result 101 states and 161 transitions. [2025-02-05 15:58:29,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 15:58:29,466 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:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:29,468 INFO L225 Difference]: With dead ends: 101 [2025-02-05 15:58:29,471 INFO L226 Difference]: Without dead ends: 68 [2025-02-05 15:58:29,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2025-02-05 15:58:29,473 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.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:29,473 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.2s Time] [2025-02-05 15:58:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-05 15:58:29,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2025-02-05 15:58:29,480 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:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2025-02-05 15:58:29,481 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 37 [2025-02-05 15:58:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:29,481 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2025-02-05 15:58:29,481 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:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2025-02-05 15:58:29,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 15:58:29,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:29,484 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:29,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:29,684 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:29,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:29,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:29,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1862824006, now seen corresponding path program 1 times [2025-02-05 15:58:29,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:29,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425855405] [2025-02-05 15:58:29,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:29,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:29,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 15:58:29,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 15:58:29,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:29,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:29,809 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:29,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:29,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425855405] [2025-02-05 15:58:29,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425855405] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:29,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311156397] [2025-02-05 15:58:29,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:29,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:29,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:29,813 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:29,815 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:29,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 15:58:29,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 15:58:29,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:29,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:29,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:58:29,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:29,935 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:29,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:30,323 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:30,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311156397] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:30,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:30,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2025-02-05 15:58:30,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202996631] [2025-02-05 15:58:30,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:30,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 15:58:30,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:30,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 15:58:30,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:58:30,325 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:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:30,493 INFO L93 Difference]: Finished difference Result 102 states and 193 transitions. [2025-02-05 15:58:30,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 15:58:30,493 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:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:30,495 INFO L225 Difference]: With dead ends: 102 [2025-02-05 15:58:30,495 INFO L226 Difference]: Without dead ends: 98 [2025-02-05 15:58:30,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:58:30,496 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:30,499 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:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-05 15:58:30,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 64. [2025-02-05 15:58:30,513 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:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2025-02-05 15:58:30,514 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 51 [2025-02-05 15:58:30,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:30,514 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2025-02-05 15:58:30,515 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:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2025-02-05 15:58:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 15:58:30,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:30,522 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:30,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:30,722 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:30,722 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:30,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:30,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1518497941, now seen corresponding path program 1 times [2025-02-05 15:58:30,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:30,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40340461] [2025-02-05 15:58:30,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:30,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:30,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 15:58:30,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 15:58:30,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:30,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:30,849 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:30,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:30,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40340461] [2025-02-05 15:58:30,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40340461] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:30,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535615404] [2025-02-05 15:58:30,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:30,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:30,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:30,851 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:30,860 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:30,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 15:58:30,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 15:58:30,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:30,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:30,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 15:58:30,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:31,000 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:31,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:31,607 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:31,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535615404] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:31,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:31,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2025-02-05 15:58:31,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189094032] [2025-02-05 15:58:31,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:31,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 15:58:31,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:31,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 15:58:31,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:58:31,610 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand has 23 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 23 states have internal predecessors, (73), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) [2025-02-05 15:58:32,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:32,092 INFO L93 Difference]: Finished difference Result 177 states and 369 transitions. [2025-02-05 15:58:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 15:58:32,093 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 23 states have internal predecessors, (73), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) Word has length 80 [2025-02-05 15:58:32,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:32,094 INFO L225 Difference]: With dead ends: 177 [2025-02-05 15:58:32,095 INFO L226 Difference]: Without dead ends: 104 [2025-02-05 15:58:32,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 148 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2025-02-05 15:58:32,096 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 78 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:32,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 395 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:58:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-05 15:58:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2025-02-05 15:58:32,107 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:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2025-02-05 15:58:32,108 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 80 [2025-02-05 15:58:32,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:32,108 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2025-02-05 15:58:32,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 23 states have internal predecessors, (73), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) [2025-02-05 15:58:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2025-02-05 15:58:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 15:58:32,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:32,110 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 8, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:32,117 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:32,310 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:32,311 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:32,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:32,311 INFO L85 PathProgramCache]: Analyzing trace with hash -966893141, now seen corresponding path program 1 times [2025-02-05 15:58:32,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:32,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052041799] [2025-02-05 15:58:32,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:32,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:32,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 15:58:32,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 15:58:32,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:32,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:32,535 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 47 proven. 183 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2025-02-05 15:58:32,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:32,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052041799] [2025-02-05 15:58:32,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052041799] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:32,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343601314] [2025-02-05 15:58:32,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:32,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:32,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:32,538 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:32,541 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:32,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 15:58:32,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 15:58:32,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:32,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:32,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 15:58:32,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 34 proven. 239 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-02-05 15:58:32,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 34 proven. 255 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-02-05 15:58:33,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343601314] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:33,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:33,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 23 [2025-02-05 15:58:33,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485050456] [2025-02-05 15:58:33,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:33,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 15:58:33,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:33,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 15:58:33,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:58:33,694 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 23 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 23 states have internal predecessors, (77), 18 states have call successors, (22), 1 states have call predecessors, (22), 12 states have return successors, (30), 12 states have call predecessors, (30), 18 states have call successors, (30) [2025-02-05 15:58:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:33,917 INFO L93 Difference]: Finished difference Result 132 states and 227 transitions. [2025-02-05 15:58:33,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 15:58:33,917 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 23 states have internal predecessors, (77), 18 states have call successors, (22), 1 states have call predecessors, (22), 12 states have return successors, (30), 12 states have call predecessors, (30), 18 states have call successors, (30) Word has length 160 [2025-02-05 15:58:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:33,919 INFO L225 Difference]: With dead ends: 132 [2025-02-05 15:58:33,919 INFO L226 Difference]: Without dead ends: 128 [2025-02-05 15:58:33,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 304 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2025-02-05 15:58:33,920 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:33,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 188 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:33,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-05 15:58:33,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 118. [2025-02-05 15:58:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 79 states have internal predecessors, (88), 21 states have call successors, (21), 8 states have call predecessors, (21), 19 states have return successors, (85), 30 states have call predecessors, (85), 21 states have call successors, (85) [2025-02-05 15:58:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 194 transitions. [2025-02-05 15:58:33,945 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 194 transitions. Word has length 160 [2025-02-05 15:58:33,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:33,945 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 194 transitions. [2025-02-05 15:58:33,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 23 states have internal predecessors, (77), 18 states have call successors, (22), 1 states have call predecessors, (22), 12 states have return successors, (30), 12 states have call predecessors, (30), 18 states have call successors, (30) [2025-02-05 15:58:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 194 transitions. [2025-02-05 15:58:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-02-05 15:58:33,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:33,948 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 21, 20, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 8, 8, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:33,954 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:34,152 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:34,152 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:34,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:34,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1486660373, now seen corresponding path program 2 times [2025-02-05 15:58:34,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:34,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722592877] [2025-02-05 15:58:34,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:58:34,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:34,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 351 statements into 2 equivalence classes. [2025-02-05 15:58:34,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 351 of 351 statements. [2025-02-05 15:58:34,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:58:34,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3476 backedges. 105 proven. 737 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2025-02-05 15:58:34,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:34,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722592877] [2025-02-05 15:58:34,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722592877] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:34,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948268786] [2025-02-05 15:58:34,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:58:34,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:34,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:34,592 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:34,593 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:34,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 351 statements into 2 equivalence classes. [2025-02-05 15:58:34,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 351 of 351 statements. [2025-02-05 15:58:34,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:58:34,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:34,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 15:58:34,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3476 backedges. 105 proven. 737 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2025-02-05 15:58:34,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:36,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3476 backedges. 105 proven. 761 refuted. 0 times theorem prover too weak. 2610 trivial. 0 not checked. [2025-02-05 15:58:36,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948268786] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:36,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:36,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 19 [2025-02-05 15:58:36,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070520275] [2025-02-05 15:58:36,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:36,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 15:58:36,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:36,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 15:58:36,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-02-05 15:58:36,234 INFO L87 Difference]: Start difference. First operand 118 states and 194 transitions. Second operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) [2025-02-05 15:58:36,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:36,426 INFO L93 Difference]: Finished difference Result 148 states and 283 transitions. [2025-02-05 15:58:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 15:58:36,426 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) Word has length 351 [2025-02-05 15:58:36,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:36,429 INFO L225 Difference]: With dead ends: 148 [2025-02-05 15:58:36,430 INFO L226 Difference]: Without dead ends: 144 [2025-02-05 15:58:36,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 692 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2025-02-05 15:58:36,431 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:36,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 196 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-05 15:58:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 113. [2025-02-05 15:58:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 74 states have (on average 1.1486486486486487) internal successors, (85), 76 states have internal predecessors, (85), 20 states have call successors, (20), 8 states have call predecessors, (20), 18 states have return successors, (75), 28 states have call predecessors, (75), 20 states have call successors, (75) [2025-02-05 15:58:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 180 transitions. [2025-02-05 15:58:36,454 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 180 transitions. Word has length 351 [2025-02-05 15:58:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:36,456 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 180 transitions. [2025-02-05 15:58:36,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) [2025-02-05 15:58:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 180 transitions. [2025-02-05 15:58:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-02-05 15:58:36,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:36,461 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 29, 29, 25, 22, 16, 16, 16, 16, 16, 16, 16, 14, 14, 14, 14, 14, 14, 14, 11, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:36,469 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:36,662 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:36,662 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:36,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:36,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2058209874, now seen corresponding path program 3 times [2025-02-05 15:58:36,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:36,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110161668] [2025-02-05 15:58:36,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:58:36,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:36,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 417 statements into 24 equivalence classes. [2025-02-05 15:58:36,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 50 of 417 statements. [2025-02-05 15:58:36,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 15:58:36,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4983 backedges. 566 proven. 4 refuted. 0 times theorem prover too weak. 4413 trivial. 0 not checked. [2025-02-05 15:58:36,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:36,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110161668] [2025-02-05 15:58:36,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110161668] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:36,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700124109] [2025-02-05 15:58:36,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:58:36,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:36,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:36,743 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:36,744 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:36,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 417 statements into 24 equivalence classes. [2025-02-05 15:58:36,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 50 of 417 statements. [2025-02-05 15:58:36,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 15:58:36,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:36,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:58:36,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4983 backedges. 813 proven. 6 refuted. 0 times theorem prover too weak. 4164 trivial. 0 not checked. [2025-02-05 15:58:36,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:37,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4983 backedges. 671 proven. 12 refuted. 0 times theorem prover too weak. 4300 trivial. 0 not checked. [2025-02-05 15:58:37,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700124109] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:37,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:37,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-02-05 15:58:37,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805204402] [2025-02-05 15:58:37,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:37,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 15:58:37,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:37,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 15:58:37,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:58:37,818 INFO L87 Difference]: Start difference. First operand 113 states and 180 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 7 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) [2025-02-05 15:58:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:37,916 INFO L93 Difference]: Finished difference Result 220 states and 380 transitions. [2025-02-05 15:58:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:58:37,916 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 7 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) Word has length 417 [2025-02-05 15:58:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:37,917 INFO L225 Difference]: With dead ends: 220 [2025-02-05 15:58:37,917 INFO L226 Difference]: Without dead ends: 115 [2025-02-05 15:58:37,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 845 GetRequests, 823 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-02-05 15:58:37,918 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:37,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 166 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:37,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-05 15:58:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2025-02-05 15:58:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 74 states have (on average 1.1486486486486487) internal successors, (85), 73 states have internal predecessors, (85), 19 states have call successors, (19), 10 states have call predecessors, (19), 16 states have return successors, (65), 26 states have call predecessors, (65), 19 states have call successors, (65) [2025-02-05 15:58:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 169 transitions. [2025-02-05 15:58:37,932 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 169 transitions. Word has length 417 [2025-02-05 15:58:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:37,932 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 169 transitions. [2025-02-05 15:58:37,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 7 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) [2025-02-05 15:58:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 169 transitions. [2025-02-05 15:58:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-02-05 15:58:37,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:37,938 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 36, 36, 31, 31, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 13, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:37,944 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:38,139 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:38,139 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:38,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:38,139 INFO L85 PathProgramCache]: Analyzing trace with hash 460996168, now seen corresponding path program 4 times [2025-02-05 15:58:38,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:38,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104453525] [2025-02-05 15:58:38,139 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:58:38,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:38,151 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 516 statements into 2 equivalence classes. [2025-02-05 15:58:38,178 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 439 of 516 statements. [2025-02-05 15:58:38,178 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 15:58:38,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7710 backedges. 220 proven. 909 refuted. 0 times theorem prover too weak. 6581 trivial. 0 not checked. [2025-02-05 15:58:38,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:38,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104453525] [2025-02-05 15:58:38,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104453525] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:38,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615294233] [2025-02-05 15:58:38,487 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:58:38,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:38,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:38,488 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:38,490 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:38,566 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 516 statements into 2 equivalence classes. [2025-02-05 15:58:38,630 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 439 of 516 statements. [2025-02-05 15:58:38,630 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 15:58:38,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:38,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 15:58:38,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7710 backedges. 220 proven. 909 refuted. 0 times theorem prover too weak. 6581 trivial. 0 not checked. [2025-02-05 15:58:38,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7710 backedges. 220 proven. 925 refuted. 0 times theorem prover too weak. 6565 trivial. 0 not checked. [2025-02-05 15:58:40,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615294233] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:40,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:40,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 17 [2025-02-05 15:58:40,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2174654] [2025-02-05 15:58:40,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:40,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 15:58:40,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:40,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 15:58:40,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:58:40,128 INFO L87 Difference]: Start difference. First operand 110 states and 169 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 13 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 9 states have call predecessors, (21), 13 states have call successors, (21) [2025-02-05 15:58:40,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:40,263 INFO L93 Difference]: Finished difference Result 147 states and 275 transitions. [2025-02-05 15:58:40,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:58:40,264 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 13 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 9 states have call predecessors, (21), 13 states have call successors, (21) Word has length 516 [2025-02-05 15:58:40,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:40,266 INFO L225 Difference]: With dead ends: 147 [2025-02-05 15:58:40,266 INFO L226 Difference]: Without dead ends: 143 [2025-02-05 15:58:40,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1050 GetRequests, 1023 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:58:40,267 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:40,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 131 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:40,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-05 15:58:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 115. [2025-02-05 15:58:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 76 states have internal predecessors, (88), 20 states have call successors, (20), 10 states have call predecessors, (20), 17 states have return successors, (76), 28 states have call predecessors, (76), 20 states have call successors, (76) [2025-02-05 15:58:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 184 transitions. [2025-02-05 15:58:40,277 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 184 transitions. Word has length 516 [2025-02-05 15:58:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:40,277 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 184 transitions. [2025-02-05 15:58:40,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 13 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 9 states have call predecessors, (21), 13 states have call successors, (21) [2025-02-05 15:58:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 184 transitions. [2025-02-05 15:58:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-02-05 15:58:40,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:40,279 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 29, 29, 25, 22, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 10, 8, 8, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:40,286 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:40,479 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:40,480 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:40,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:40,480 INFO L85 PathProgramCache]: Analyzing trace with hash -643791063, now seen corresponding path program 5 times [2025-02-05 15:58:40,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:40,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998629339] [2025-02-05 15:58:40,480 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:58:40,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:40,489 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 405 statements into 27 equivalence classes. [2025-02-05 15:58:40,515 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 176 of 405 statements. [2025-02-05 15:58:40,515 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-05 15:58:40,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4679 backedges. 238 proven. 684 refuted. 0 times theorem prover too weak. 3757 trivial. 0 not checked. [2025-02-05 15:58:40,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:40,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998629339] [2025-02-05 15:58:40,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998629339] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:40,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445630520] [2025-02-05 15:58:40,682 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:58:40,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:40,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:40,684 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:40,685 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:40,773 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 405 statements into 27 equivalence classes. [2025-02-05 15:58:40,805 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 176 of 405 statements. [2025-02-05 15:58:40,805 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-05 15:58:40,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:40,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 15:58:40,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4679 backedges. 1850 proven. 34 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2025-02-05 15:58:40,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4679 backedges. 246 proven. 772 refuted. 0 times theorem prover too weak. 3661 trivial. 0 not checked. [2025-02-05 15:58:41,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445630520] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:41,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:41,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 20 [2025-02-05 15:58:41,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364450879] [2025-02-05 15:58:41,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:41,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 15:58:41,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:41,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 15:58:41,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-02-05 15:58:41,922 INFO L87 Difference]: Start difference. First operand 115 states and 184 transitions. Second operand has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 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:42,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:42,131 INFO L93 Difference]: Finished difference Result 234 states and 421 transitions. [2025-02-05 15:58:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 15:58:42,132 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 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 405 [2025-02-05 15:58:42,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:42,135 INFO L225 Difference]: With dead ends: 234 [2025-02-05 15:58:42,135 INFO L226 Difference]: Without dead ends: 129 [2025-02-05 15:58:42,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 797 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2025-02-05 15:58:42,136 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:42,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 220 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-05 15:58:42,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2025-02-05 15:58:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 79 states have internal predecessors, (93), 21 states have call successors, (21), 12 states have call predecessors, (21), 17 states have return successors, (79), 29 states have call predecessors, (79), 21 states have call successors, (79) [2025-02-05 15:58:42,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 193 transitions. [2025-02-05 15:58:42,144 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 193 transitions. Word has length 405 [2025-02-05 15:58:42,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:42,145 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 193 transitions. [2025-02-05 15:58:42,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 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:42,145 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 193 transitions. [2025-02-05 15:58:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-02-05 15:58:42,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:42,148 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 37, 37, 36, 35, 23, 23, 23, 23, 23, 23, 23, 18, 18, 18, 18, 18, 18, 18, 18, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:42,154 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:42,348 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:42,348 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:42,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash -120474589, now seen corresponding path program 6 times [2025-02-05 15:58:42,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:42,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965944584] [2025-02-05 15:58:42,349 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:58:42,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:42,361 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 573 statements into 36 equivalence classes. [2025-02-05 15:58:42,370 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 92 of 573 statements. [2025-02-05 15:58:42,372 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-05 15:58:42,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9653 backedges. 863 proven. 7 refuted. 0 times theorem prover too weak. 8783 trivial. 0 not checked. [2025-02-05 15:58:42,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:42,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965944584] [2025-02-05 15:58:42,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965944584] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:42,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053106894] [2025-02-05 15:58:42,441 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:58:42,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:42,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:42,443 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:42,444 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:42,536 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 573 statements into 36 equivalence classes. [2025-02-05 15:58:42,555 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 92 of 573 statements. [2025-02-05 15:58:42,555 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-05 15:58:42,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:42,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:58:42,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9653 backedges. 863 proven. 7 refuted. 0 times theorem prover too weak. 8783 trivial. 0 not checked. [2025-02-05 15:58:42,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9653 backedges. 863 proven. 7 refuted. 0 times theorem prover too weak. 8783 trivial. 0 not checked. [2025-02-05 15:58:43,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053106894] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:43,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:43,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 14 [2025-02-05 15:58:43,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48117369] [2025-02-05 15:58:43,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:43,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:58:43,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:43,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:58:43,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:58:43,664 INFO L87 Difference]: Start difference. First operand 121 states and 193 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-05 15:58:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:43,761 INFO L93 Difference]: Finished difference Result 225 states and 374 transitions. [2025-02-05 15:58:43,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:58:43,762 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 573 [2025-02-05 15:58:43,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:43,763 INFO L225 Difference]: With dead ends: 225 [2025-02-05 15:58:43,763 INFO L226 Difference]: Without dead ends: 109 [2025-02-05 15:58:43,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1157 GetRequests, 1138 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:58:43,764 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:43,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 169 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-05 15:58:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2025-02-05 15:58:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 72 states have (on average 1.125) internal successors, (81), 72 states have internal predecessors, (81), 18 states have call successors, (18), 10 states have call predecessors, (18), 16 states have return successors, (52), 24 states have call predecessors, (52), 18 states have call successors, (52) [2025-02-05 15:58:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 151 transitions. [2025-02-05 15:58:43,771 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 151 transitions. Word has length 573 [2025-02-05 15:58:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:43,771 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 151 transitions. [2025-02-05 15:58:43,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-05 15:58:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 151 transitions. [2025-02-05 15:58:43,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-02-05 15:58:43,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:43,773 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 26, 26, 24, 20, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 11, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:43,779 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:43,973 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:43,974 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:43,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:43,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1217862797, now seen corresponding path program 7 times [2025-02-05 15:58:43,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:43,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735521497] [2025-02-05 15:58:43,974 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 15:58:43,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:43,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-02-05 15:58:44,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-02-05 15:58:44,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:44,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:44,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4066 backedges. 297 proven. 498 refuted. 0 times theorem prover too weak. 3271 trivial. 0 not checked. [2025-02-05 15:58:44,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:44,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735521497] [2025-02-05 15:58:44,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735521497] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:44,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511791547] [2025-02-05 15:58:44,226 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 15:58:44,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:44,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:44,228 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:44,229 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:44,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-02-05 15:58:44,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-02-05 15:58:44,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:44,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:44,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 15:58:44,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4066 backedges. 302 proven. 736 refuted. 0 times theorem prover too weak. 3028 trivial. 0 not checked. [2025-02-05 15:58:44,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4066 backedges. 304 proven. 764 refuted. 0 times theorem prover too weak. 2998 trivial. 0 not checked. [2025-02-05 15:58:46,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511791547] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:46,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:46,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 19] total 30 [2025-02-05 15:58:46,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267669401] [2025-02-05 15:58:46,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:46,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 15:58:46,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:46,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 15:58:46,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2025-02-05 15:58:46,394 INFO L87 Difference]: Start difference. First operand 107 states and 151 transitions. Second operand has 30 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 30 states have internal predecessors, (99), 24 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (38), 17 states have call predecessors, (38), 24 states have call successors, (38) [2025-02-05 15:58:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:47,110 INFO L93 Difference]: Finished difference Result 338 states and 720 transitions. [2025-02-05 15:58:47,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-05 15:58:47,111 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 30 states have internal predecessors, (99), 24 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (38), 17 states have call predecessors, (38), 24 states have call successors, (38) Word has length 378 [2025-02-05 15:58:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:47,113 INFO L225 Difference]: With dead ends: 338 [2025-02-05 15:58:47,113 INFO L226 Difference]: Without dead ends: 185 [2025-02-05 15:58:47,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 802 GetRequests, 732 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=531, Invalid=3375, Unknown=0, NotChecked=0, Total=3906 [2025-02-05 15:58:47,116 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 131 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:47,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 616 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:58:47,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-05 15:58:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 142. [2025-02-05 15:58:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 100 states have (on average 1.09) internal successors, (109), 96 states have internal predecessors, (109), 24 states have call successors, (24), 18 states have call predecessors, (24), 17 states have return successors, (68), 27 states have call predecessors, (68), 24 states have call successors, (68) [2025-02-05 15:58:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 201 transitions. [2025-02-05 15:58:47,129 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 201 transitions. Word has length 378 [2025-02-05 15:58:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:47,130 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 201 transitions. [2025-02-05 15:58:47,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 30 states have internal predecessors, (99), 24 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (38), 17 states have call predecessors, (38), 24 states have call successors, (38) [2025-02-05 15:58:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 201 transitions. [2025-02-05 15:58:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-02-05 15:58:47,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:47,133 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 46, 46, 42, 40, 27, 27, 27, 27, 27, 27, 27, 23, 23, 23, 23, 23, 23, 23, 19, 13, 13, 6, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:47,140 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:47,333 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:47,334 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:47,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1152440813, now seen corresponding path program 8 times [2025-02-05 15:58:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:47,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339137445] [2025-02-05 15:58:47,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:58:47,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:47,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 692 statements into 2 equivalence classes. [2025-02-05 15:58:47,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 692 of 692 statements. [2025-02-05 15:58:47,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:58:47,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 14137 backedges. 840 proven. 175 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2025-02-05 15:58:47,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:47,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339137445] [2025-02-05 15:58:47,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339137445] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:47,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471632566] [2025-02-05 15:58:47,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:58:47,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:47,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:47,671 INFO L229 MonitoredProcess]: Starting monitored process 15 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:47,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 15:58:47,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 692 statements into 2 equivalence classes. [2025-02-05 15:58:47,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 692 of 692 statements. [2025-02-05 15:58:47,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:58:47,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:47,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 1556 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 15:58:47,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 14137 backedges. 519 proven. 1539 refuted. 0 times theorem prover too weak. 12079 trivial. 0 not checked. [2025-02-05 15:58:48,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 14137 backedges. 521 proven. 1567 refuted. 0 times theorem prover too weak. 12049 trivial. 0 not checked. [2025-02-05 15:58:50,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471632566] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:50,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:50,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 19] total 28 [2025-02-05 15:58:50,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153259720] [2025-02-05 15:58:50,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:50,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 15:58:50,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:50,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 15:58:50,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-02-05 15:58:50,481 INFO L87 Difference]: Start difference. First operand 142 states and 201 transitions. Second operand has 28 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 28 states have internal predecessors, (92), 20 states have call successors, (27), 1 states have call predecessors, (27), 13 states have return successors, (33), 16 states have call predecessors, (33), 20 states have call successors, (33) [2025-02-05 15:58:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:51,001 INFO L93 Difference]: Finished difference Result 367 states and 634 transitions. [2025-02-05 15:58:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-05 15:58:51,002 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 28 states have internal predecessors, (92), 20 states have call successors, (27), 1 states have call predecessors, (27), 13 states have return successors, (33), 16 states have call predecessors, (33), 20 states have call successors, (33) Word has length 692 [2025-02-05 15:58:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:51,005 INFO L225 Difference]: With dead ends: 367 [2025-02-05 15:58:51,005 INFO L226 Difference]: Without dead ends: 194 [2025-02-05 15:58:51,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1419 GetRequests, 1358 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=415, Invalid=2447, Unknown=0, NotChecked=0, Total=2862 [2025-02-05 15:58:51,007 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 95 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:51,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 590 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:58:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-05 15:58:51,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 170. [2025-02-05 15:58:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 120 states have (on average 1.0916666666666666) internal successors, (131), 117 states have internal predecessors, (131), 32 states have call successors, (32), 25 states have call predecessors, (32), 17 states have return successors, (83), 27 states have call predecessors, (83), 32 states have call successors, (83) [2025-02-05 15:58:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 246 transitions. [2025-02-05 15:58:51,018 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 246 transitions. Word has length 692 [2025-02-05 15:58:51,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:51,018 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 246 transitions. [2025-02-05 15:58:51,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 28 states have internal predecessors, (92), 20 states have call successors, (27), 1 states have call predecessors, (27), 13 states have return successors, (33), 16 states have call predecessors, (33), 20 states have call successors, (33) [2025-02-05 15:58:51,018 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 246 transitions. [2025-02-05 15:58:51,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-02-05 15:58:51,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:51,021 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 47, 42, 42, 37, 26, 26, 26, 26, 26, 26, 26, 26, 21, 21, 21, 21, 21, 21, 21, 11, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:51,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-05 15:58:51,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 15:58:51,222 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:51,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:51,222 INFO L85 PathProgramCache]: Analyzing trace with hash -450343072, now seen corresponding path program 9 times [2025-02-05 15:58:51,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:51,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675146585] [2025-02-05 15:58:51,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:58:51,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:51,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 658 statements into 40 equivalence classes. [2025-02-05 15:58:51,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 658 statements. [2025-02-05 15:58:51,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 15:58:51,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12843 backedges. 890 proven. 2 refuted. 0 times theorem prover too weak. 11951 trivial. 0 not checked. [2025-02-05 15:58:51,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:51,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675146585] [2025-02-05 15:58:51,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675146585] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:51,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790692240] [2025-02-05 15:58:51,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:58:51,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:51,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:51,290 INFO L229 MonitoredProcess]: Starting monitored process 16 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:51,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-05 15:58:51,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 658 statements into 40 equivalence classes. [2025-02-05 15:58:51,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 658 statements. [2025-02-05 15:58:51,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 15:58:51,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:51,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:58:51,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12843 backedges. 888 proven. 4 refuted. 0 times theorem prover too weak. 11951 trivial. 0 not checked. [2025-02-05 15:58:51,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 12843 backedges. 888 proven. 4 refuted. 0 times theorem prover too weak. 11951 trivial. 0 not checked. [2025-02-05 15:58:52,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790692240] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:52,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:52,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-05 15:58:52,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092578901] [2025-02-05 15:58:52,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:52,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:58:52,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:52,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:58:52,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:58:52,686 INFO L87 Difference]: Start difference. First operand 170 states and 246 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:58:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:52,769 INFO L93 Difference]: Finished difference Result 318 states and 491 transitions. [2025-02-05 15:58:52,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:58:52,769 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 658 [2025-02-05 15:58:52,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:52,771 INFO L225 Difference]: With dead ends: 318 [2025-02-05 15:58:52,771 INFO L226 Difference]: Without dead ends: 166 [2025-02-05 15:58:52,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1325 GetRequests, 1309 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:58:52,772 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:52,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 140 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:52,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-05 15:58:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-02-05 15:58:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 114 states have internal predecessors, (127), 32 states have call successors, (32), 25 states have call predecessors, (32), 16 states have return successors, (78), 26 states have call predecessors, (78), 32 states have call successors, (78) [2025-02-05 15:58:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 237 transitions. [2025-02-05 15:58:52,783 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 237 transitions. Word has length 658 [2025-02-05 15:58:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:52,783 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 237 transitions. [2025-02-05 15:58:52,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:58:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 237 transitions. [2025-02-05 15:58:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 15:58:52,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:52,787 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 42, 42, 39, 37, 26, 26, 26, 26, 26, 26, 26, 21, 21, 21, 21, 21, 21, 21, 18, 14, 11, 5, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:52,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:52,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 15:58:52,987 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:52,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash 392902804, now seen corresponding path program 10 times [2025-02-05 15:58:52,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:52,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638728197] [2025-02-05 15:58:52,988 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:58:52,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:53,012 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 650 statements into 2 equivalence classes. [2025-02-05 15:58:53,043 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 553 of 650 statements. [2025-02-05 15:58:53,043 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 15:58:53,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12503 backedges. 661 proven. 878 refuted. 0 times theorem prover too weak. 10964 trivial. 0 not checked. [2025-02-05 15:58:53,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:53,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638728197] [2025-02-05 15:58:53,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638728197] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:53,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261343578] [2025-02-05 15:58:53,379 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:58:53,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:53,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:53,381 INFO L229 MonitoredProcess]: Starting monitored process 17 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:53,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-05 15:58:53,510 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 650 statements into 2 equivalence classes. [2025-02-05 15:58:53,585 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 553 of 650 statements. [2025-02-05 15:58:53,585 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 15:58:53,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:53,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 15:58:53,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12503 backedges. 797 proven. 1209 refuted. 0 times theorem prover too weak. 10497 trivial. 0 not checked. [2025-02-05 15:58:53,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 12503 backedges. 797 proven. 1239 refuted. 0 times theorem prover too weak. 10467 trivial. 0 not checked. [2025-02-05 15:58:55,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261343578] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:55,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:55,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 25 [2025-02-05 15:58:55,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766611926] [2025-02-05 15:58:55,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:55,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 15:58:55,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:55,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 15:58:55,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-02-05 15:58:55,910 INFO L87 Difference]: Start difference. First operand 166 states and 237 transitions. Second operand has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 19 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (33), 15 states have call predecessors, (33), 19 states have call successors, (33) [2025-02-05 15:58:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:56,084 INFO L93 Difference]: Finished difference Result 184 states and 266 transitions. [2025-02-05 15:58:56,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:58:56,085 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 19 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (33), 15 states have call predecessors, (33), 19 states have call successors, (33) Word has length 650 [2025-02-05 15:58:56,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:56,087 INFO L225 Difference]: With dead ends: 184 [2025-02-05 15:58:56,087 INFO L226 Difference]: Without dead ends: 164 [2025-02-05 15:58:56,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1323 GetRequests, 1283 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 15:58:56,088 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 16 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:56,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 424 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:56,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-05 15:58:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 159. [2025-02-05 15:58:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.0803571428571428) internal successors, (121), 109 states have internal predecessors, (121), 29 states have call successors, (29), 23 states have call predecessors, (29), 17 states have return successors, (68), 26 states have call predecessors, (68), 29 states have call successors, (68) [2025-02-05 15:58:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 218 transitions. [2025-02-05 15:58:56,115 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 218 transitions. Word has length 650 [2025-02-05 15:58:56,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:56,116 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 218 transitions. [2025-02-05 15:58:56,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 19 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (33), 15 states have call predecessors, (33), 19 states have call successors, (33) [2025-02-05 15:58:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 218 transitions. [2025-02-05 15:58:56,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-02-05 15:58:56,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:56,119 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 30, 30, 25, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 10, 9, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:56,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:56,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 15:58:56,320 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:56,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:56,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1533724828, now seen corresponding path program 11 times [2025-02-05 15:58:56,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:56,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101170865] [2025-02-05 15:58:56,321 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:58:56,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:56,334 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 432 statements into 24 equivalence classes. [2025-02-05 15:58:56,363 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 251 of 432 statements. [2025-02-05 15:58:56,364 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-02-05 15:58:56,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5352 backedges. 579 proven. 433 refuted. 0 times theorem prover too weak. 4340 trivial. 0 not checked. [2025-02-05 15:58:56,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:56,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101170865] [2025-02-05 15:58:56,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101170865] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:56,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195950690] [2025-02-05 15:58:56,620 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:58:56,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:56,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:56,622 INFO L229 MonitoredProcess]: Starting monitored process 18 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:56,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-05 15:58:56,760 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 432 statements into 24 equivalence classes. [2025-02-05 15:58:56,805 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 251 of 432 statements. [2025-02-05 15:58:56,805 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-02-05 15:58:56,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:56,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 15:58:56,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5352 backedges. 3078 proven. 65 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2025-02-05 15:58:56,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5352 backedges. 631 proven. 490 refuted. 0 times theorem prover too weak. 4231 trivial. 0 not checked. [2025-02-05 15:58:58,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195950690] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:58,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:58,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 15] total 24 [2025-02-05 15:58:58,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009705401] [2025-02-05 15:58:58,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:58,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 15:58:58,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:58,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 15:58:58,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-02-05 15:58:58,089 INFO L87 Difference]: Start difference. First operand 159 states and 218 transitions. Second operand has 24 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 24 states have internal predecessors, (90), 15 states have call successors, (26), 2 states have call predecessors, (26), 9 states have return successors, (30), 11 states have call predecessors, (30), 15 states have call successors, (30) [2025-02-05 15:58:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:58,404 INFO L93 Difference]: Finished difference Result 317 states and 468 transitions. [2025-02-05 15:58:58,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 15:58:58,404 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 24 states have internal predecessors, (90), 15 states have call successors, (26), 2 states have call predecessors, (26), 9 states have return successors, (30), 11 states have call predecessors, (30), 15 states have call successors, (30) Word has length 432 [2025-02-05 15:58:58,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:58,406 INFO L225 Difference]: With dead ends: 317 [2025-02-05 15:58:58,406 INFO L226 Difference]: Without dead ends: 177 [2025-02-05 15:58:58,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 849 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=982, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 15:58:58,409 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 37 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:58,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 403 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:58:58,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-05 15:58:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 166. [2025-02-05 15:58:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 116 states have (on average 1.0775862068965518) internal successors, (125), 114 states have internal predecessors, (125), 32 states have call successors, (32), 24 states have call predecessors, (32), 17 states have return successors, (69), 27 states have call predecessors, (69), 32 states have call successors, (69) [2025-02-05 15:58:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2025-02-05 15:58:58,420 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 432 [2025-02-05 15:58:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:58,420 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2025-02-05 15:58:58,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 24 states have internal predecessors, (90), 15 states have call successors, (26), 2 states have call predecessors, (26), 9 states have return successors, (30), 11 states have call predecessors, (30), 15 states have call successors, (30) [2025-02-05 15:58:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2025-02-05 15:58:58,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2025-02-05 15:58:58,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:58,423 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 38, 37, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 15, 14, 10, 8, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:58,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-05 15:58:58,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:58,624 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:58,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:58,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1583587315, now seen corresponding path program 12 times [2025-02-05 15:58:58,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:58,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758750171] [2025-02-05 15:58:58,624 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:58:58,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:58,635 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 637 statements into 44 equivalence classes. [2025-02-05 15:58:58,737 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) and asserted 511 of 637 statements. [2025-02-05 15:58:58,737 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2025-02-05 15:58:58,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 11857 backedges. 1509 proven. 143 refuted. 0 times theorem prover too weak. 10205 trivial. 0 not checked. [2025-02-05 15:58:59,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:59,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758750171] [2025-02-05 15:58:59,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758750171] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:59,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685664499] [2025-02-05 15:58:59,089 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:58:59,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:59,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:59,091 INFO L229 MonitoredProcess]: Starting monitored process 19 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:59,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-05 15:58:59,243 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 637 statements into 44 equivalence classes. [2025-02-05 15:58:59,347 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) and asserted 511 of 637 statements. [2025-02-05 15:58:59,347 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2025-02-05 15:58:59,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:59,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 15:58:59,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 11857 backedges. 1677 proven. 163 refuted. 0 times theorem prover too weak. 10017 trivial. 0 not checked. [2025-02-05 15:58:59,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:59:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 11857 backedges. 1677 proven. 170 refuted. 0 times theorem prover too weak. 10010 trivial. 0 not checked. [2025-02-05 15:59:01,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685664499] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:59:01,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:59:01,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 17] total 26 [2025-02-05 15:59:01,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034407216] [2025-02-05 15:59:01,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:59:01,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 15:59:01,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:59:01,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 15:59:01,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2025-02-05 15:59:01,099 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 14 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (30), 16 states have call predecessors, (30), 14 states have call successors, (30) [2025-02-05 15:59:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:59:01,373 INFO L93 Difference]: Finished difference Result 312 states and 443 transitions. [2025-02-05 15:59:01,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 15:59:01,374 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 14 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (30), 16 states have call predecessors, (30), 14 states have call successors, (30) Word has length 637 [2025-02-05 15:59:01,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:59:01,376 INFO L225 Difference]: With dead ends: 312 [2025-02-05 15:59:01,376 INFO L226 Difference]: Without dead ends: 165 [2025-02-05 15:59:01,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1301 GetRequests, 1257 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=1174, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 15:59:01,377 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 57 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:59:01,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 348 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:59:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-05 15:59:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2025-02-05 15:59:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 110 states have (on average 1.0727272727272728) internal successors, (118), 108 states have internal predecessors, (118), 30 states have call successors, (30), 22 states have call predecessors, (30), 17 states have return successors, (61), 27 states have call predecessors, (61), 30 states have call successors, (61) [2025-02-05 15:59:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 209 transitions. [2025-02-05 15:59:01,387 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 209 transitions. Word has length 637 [2025-02-05 15:59:01,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:59:01,388 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 209 transitions. [2025-02-05 15:59:01,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 14 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (30), 16 states have call predecessors, (30), 14 states have call successors, (30) [2025-02-05 15:59:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 209 transitions. [2025-02-05 15:59:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2025-02-05 15:59:01,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:59:01,390 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 45, 45, 37, 37, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 15, 14, 9, 8, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:59:01,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-05 15:59:01,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:59:01,592 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:59:01,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:59:01,592 INFO L85 PathProgramCache]: Analyzing trace with hash 161392042, now seen corresponding path program 13 times [2025-02-05 15:59:01,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:59:01,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767082029] [2025-02-05 15:59:01,592 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 15:59:01,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:59:01,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 624 statements into 1 equivalence classes. [2025-02-05 15:59:01,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 624 of 624 statements. [2025-02-05 15:59:01,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:59:01,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 11368 backedges. 961 proven. 510 refuted. 0 times theorem prover too weak. 9897 trivial. 0 not checked. [2025-02-05 15:59:02,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:59:02,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767082029] [2025-02-05 15:59:02,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767082029] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:59:02,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037871582] [2025-02-05 15:59:02,081 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 15:59:02,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:59:02,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:59:02,083 INFO L229 MonitoredProcess]: Starting monitored process 20 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:59:02,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-05 15:59:02,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 624 statements into 1 equivalence classes. [2025-02-05 15:59:02,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 624 of 624 statements. [2025-02-05 15:59:02,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:59:02,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:02,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 15:59:02,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:59:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 11368 backedges. 1188 proven. 730 refuted. 0 times theorem prover too weak. 9450 trivial. 0 not checked. [2025-02-05 15:59:02,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:59:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 11368 backedges. 1188 proven. 760 refuted. 0 times theorem prover too weak. 9420 trivial. 0 not checked. [2025-02-05 15:59:04,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037871582] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:59:04,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:59:04,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 25 [2025-02-05 15:59:04,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830361226] [2025-02-05 15:59:04,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:59:04,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 15:59:04,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:59:04,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 15:59:04,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-02-05 15:59:04,665 INFO L87 Difference]: Start difference. First operand 158 states and 209 transitions. Second operand has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 25 states have internal predecessors, (83), 19 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 14 states have call predecessors, (32), 19 states have call successors, (32) [2025-02-05 15:59:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:59:04,860 INFO L93 Difference]: Finished difference Result 175 states and 230 transitions. [2025-02-05 15:59:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:59:04,861 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 25 states have internal predecessors, (83), 19 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 14 states have call predecessors, (32), 19 states have call successors, (32) Word has length 624 [2025-02-05 15:59:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:59:04,863 INFO L225 Difference]: With dead ends: 175 [2025-02-05 15:59:04,863 INFO L226 Difference]: Without dead ends: 161 [2025-02-05 15:59:04,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1271 GetRequests, 1231 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 15:59:04,863 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:59:04,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 431 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:59:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-05 15:59:04,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2025-02-05 15:59:04,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 109 states have (on average 1.073394495412844) internal successors, (117), 107 states have internal predecessors, (117), 29 states have call successors, (29), 22 states have call predecessors, (29), 17 states have return successors, (53), 26 states have call predecessors, (53), 29 states have call successors, (53) [2025-02-05 15:59:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 199 transitions. [2025-02-05 15:59:04,874 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 199 transitions. Word has length 624 [2025-02-05 15:59:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:59:04,874 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 199 transitions. [2025-02-05 15:59:04,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 25 states have internal predecessors, (83), 19 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 14 states have call predecessors, (32), 19 states have call successors, (32) [2025-02-05 15:59:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 199 transitions. [2025-02-05 15:59:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-02-05 15:59:04,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:59:04,876 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 29, 29, 26, 24, 16, 16, 16, 16, 16, 16, 16, 14, 14, 14, 14, 14, 14, 14, 10, 10, 8, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:59:04,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-02-05 15:59:05,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:59:05,077 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:59:05,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:59:05,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1952262287, now seen corresponding path program 14 times [2025-02-05 15:59:05,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:59:05,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991899257] [2025-02-05 15:59:05,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:59:05,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:59:05,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 420 statements into 2 equivalence classes. [2025-02-05 15:59:05,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 420 of 420 statements. [2025-02-05 15:59:05,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:59:05,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5053 backedges. 345 proven. 402 refuted. 0 times theorem prover too weak. 4306 trivial. 0 not checked. [2025-02-05 15:59:05,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:59:05,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991899257] [2025-02-05 15:59:05,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991899257] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:59:05,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031973201] [2025-02-05 15:59:05,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:59:05,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:59:05,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:59:05,301 INFO L229 MonitoredProcess]: Starting monitored process 21 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:59:05,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-05 15:59:05,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 420 statements into 2 equivalence classes. [2025-02-05 15:59:05,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 420 of 420 statements. [2025-02-05 15:59:05,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:59:05,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:05,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 15:59:05,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:59:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5053 backedges. 401 proven. 502 refuted. 0 times theorem prover too weak. 4150 trivial. 0 not checked. [2025-02-05 15:59:05,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:59:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5053 backedges. 403 proven. 516 refuted. 0 times theorem prover too weak. 4134 trivial. 0 not checked. [2025-02-05 15:59:06,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031973201] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:59:06,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:59:06,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 18 [2025-02-05 15:59:06,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008889408] [2025-02-05 15:59:06,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:59:06,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 15:59:06,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:59:06,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 15:59:06,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-02-05 15:59:06,710 INFO L87 Difference]: Start difference. First operand 156 states and 199 transitions. Second operand has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 13 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (22), 9 states have call predecessors, (22), 13 states have call successors, (22) [2025-02-05 15:59:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:59:06,814 INFO L93 Difference]: Finished difference Result 178 states and 230 transitions. [2025-02-05 15:59:06,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:59:06,814 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 13 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (22), 9 states have call predecessors, (22), 13 states have call successors, (22) Word has length 420 [2025-02-05 15:59:06,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:59:06,816 INFO L225 Difference]: With dead ends: 178 [2025-02-05 15:59:06,816 INFO L226 Difference]: Without dead ends: 166 [2025-02-05 15:59:06,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 828 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:59:06,817 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:59:06,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 159 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:59:06,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-05 15:59:06,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 156. [2025-02-05 15:59:06,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 109 states have (on average 1.073394495412844) internal successors, (117), 107 states have internal predecessors, (117), 29 states have call successors, (29), 22 states have call predecessors, (29), 17 states have return successors, (53), 26 states have call predecessors, (53), 29 states have call successors, (53) [2025-02-05 15:59:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 199 transitions. [2025-02-05 15:59:06,847 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 199 transitions. Word has length 420 [2025-02-05 15:59:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:59:06,848 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 199 transitions. [2025-02-05 15:59:06,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 13 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (22), 9 states have call predecessors, (22), 13 states have call successors, (22) [2025-02-05 15:59:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 199 transitions. [2025-02-05 15:59:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-02-05 15:59:06,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:59:06,850 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 30, 30, 25, 24, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:59:06,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-05 15:59:07,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:59:07,050 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:59:07,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:59:07,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1942069331, now seen corresponding path program 15 times [2025-02-05 15:59:07,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:59:07,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087110576] [2025-02-05 15:59:07,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:59:07,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:59:07,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 419 statements into 24 equivalence classes. [2025-02-05 15:59:07,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 154 of 419 statements. [2025-02-05 15:59:07,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-05 15:59:07,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 822 proven. 94 refuted. 0 times theorem prover too weak. 4100 trivial. 0 not checked. [2025-02-05 15:59:07,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:59:07,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087110576] [2025-02-05 15:59:07,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087110576] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:59:07,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326981911] [2025-02-05 15:59:07,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:59:07,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:59:07,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:59:07,198 INFO L229 MonitoredProcess]: Starting monitored process 22 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:59:07,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-05 15:59:07,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 419 statements into 24 equivalence classes. [2025-02-05 15:59:07,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 154 of 419 statements. [2025-02-05 15:59:07,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-05 15:59:07,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:07,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 15:59:07,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:59:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 919 proven. 96 refuted. 0 times theorem prover too weak. 4001 trivial. 0 not checked. [2025-02-05 15:59:07,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:59:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 919 proven. 99 refuted. 0 times theorem prover too weak. 3998 trivial. 0 not checked. [2025-02-05 15:59:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326981911] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:59:08,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:59:08,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 22 [2025-02-05 15:59:08,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307167369] [2025-02-05 15:59:08,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:59:08,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 15:59:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:59:08,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 15:59:08,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:59:08,461 INFO L87 Difference]: Start difference. First operand 156 states and 199 transitions. Second operand has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 13 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) [2025-02-05 15:59:08,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:59:08,728 INFO L93 Difference]: Finished difference Result 235 states and 295 transitions. [2025-02-05 15:59:08,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 15:59:08,729 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 13 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) Word has length 419 [2025-02-05 15:59:08,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:59:08,731 INFO L225 Difference]: With dead ends: 235 [2025-02-05 15:59:08,731 INFO L226 Difference]: Without dead ends: 175 [2025-02-05 15:59:08,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 824 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=1151, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 15:59:08,732 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 61 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:59:08,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 241 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:59:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-02-05 15:59:08,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 165. [2025-02-05 15:59:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 115 states have (on average 1.0695652173913044) internal successors, (123), 113 states have internal predecessors, (123), 31 states have call successors, (31), 23 states have call predecessors, (31), 18 states have return successors, (58), 28 states have call predecessors, (58), 31 states have call successors, (58) [2025-02-05 15:59:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2025-02-05 15:59:08,742 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 419 [2025-02-05 15:59:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:59:08,742 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2025-02-05 15:59:08,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 13 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) [2025-02-05 15:59:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2025-02-05 15:59:08,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-05 15:59:08,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:59:08,745 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 31, 31, 27, 26, 17, 17, 17, 17, 17, 17, 17, 15, 15, 15, 15, 15, 15, 15, 11, 10, 8, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:59:08,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-02-05 15:59:08,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-05 15:59:08,945 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:59:08,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:59:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash -325656179, now seen corresponding path program 16 times [2025-02-05 15:59:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:59:08,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109222018] [2025-02-05 15:59:08,946 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:59:08,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:59:08,955 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 447 statements into 2 equivalence classes. [2025-02-05 15:59:08,965 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 380 of 447 statements. [2025-02-05 15:59:08,965 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 15:59:08,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5744 backedges. 264 proven. 906 refuted. 0 times theorem prover too weak. 4574 trivial. 0 not checked. [2025-02-05 15:59:09,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:59:09,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109222018] [2025-02-05 15:59:09,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109222018] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:59:09,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715656182] [2025-02-05 15:59:09,216 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:59:09,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:59:09,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:59:09,218 INFO L229 MonitoredProcess]: Starting monitored process 23 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:59:09,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-05 15:59:09,393 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 447 statements into 2 equivalence classes. [2025-02-05 15:59:09,438 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 380 of 447 statements. [2025-02-05 15:59:09,439 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 15:59:09,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:09,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 15:59:09,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:59:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5744 backedges. 274 proven. 996 refuted. 0 times theorem prover too weak. 4474 trivial. 0 not checked. [2025-02-05 15:59:09,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:59:11,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5744 backedges. 278 proven. 1022 refuted. 0 times theorem prover too weak. 4444 trivial. 0 not checked. [2025-02-05 15:59:11,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715656182] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:59:11,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:59:11,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 19] total 24 [2025-02-05 15:59:11,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586119815] [2025-02-05 15:59:11,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:59:11,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 15:59:11,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:59:11,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 15:59:11,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-02-05 15:59:11,346 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 24 states have internal predecessors, (79), 18 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (29), 12 states have call predecessors, (29), 18 states have call successors, (29) [2025-02-05 15:59:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:59:11,549 INFO L93 Difference]: Finished difference Result 203 states and 260 transitions. [2025-02-05 15:59:11,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:59:11,550 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 24 states have internal predecessors, (79), 18 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (29), 12 states have call predecessors, (29), 18 states have call successors, (29) Word has length 447 [2025-02-05 15:59:11,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:59:11,551 INFO L225 Difference]: With dead ends: 203 [2025-02-05 15:59:11,551 INFO L226 Difference]: Without dead ends: 160 [2025-02-05 15:59:11,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 880 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2025-02-05 15:59:11,552 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 25 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:59:11,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 424 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:59:11,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-05 15:59:11,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-05 15:59:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 112 states have (on average 1.0714285714285714) internal successors, (120), 110 states have internal predecessors, (120), 30 states have call successors, (30), 23 states have call predecessors, (30), 17 states have return successors, (44), 26 states have call predecessors, (44), 30 states have call successors, (44) [2025-02-05 15:59:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 194 transitions. [2025-02-05 15:59:11,569 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 194 transitions. Word has length 447 [2025-02-05 15:59:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:59:11,569 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 194 transitions. [2025-02-05 15:59:11,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 24 states have internal predecessors, (79), 18 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (29), 12 states have call predecessors, (29), 18 states have call successors, (29) [2025-02-05 15:59:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 194 transitions. [2025-02-05 15:59:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-05 15:59:11,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:59:11,571 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 31, 31, 27, 26, 17, 17, 17, 17, 17, 17, 17, 15, 15, 15, 15, 15, 15, 15, 11, 10, 8, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:59:11,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-02-05 15:59:11,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-05 15:59:11,772 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:59:11,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:59:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash 611742285, now seen corresponding path program 17 times [2025-02-05 15:59:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:59:11,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533918941] [2025-02-05 15:59:11,773 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:59:11,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:59:11,782 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 447 statements into 27 equivalence classes. [2025-02-05 15:59:11,797 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 336 of 447 statements. [2025-02-05 15:59:11,797 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-02-05 15:59:11,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5744 backedges. 850 proven. 228 refuted. 0 times theorem prover too weak. 4666 trivial. 0 not checked. [2025-02-05 15:59:12,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:59:12,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533918941] [2025-02-05 15:59:12,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533918941] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:59:12,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649390971] [2025-02-05 15:59:12,022 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:59:12,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:59:12,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:59:12,024 INFO L229 MonitoredProcess]: Starting monitored process 24 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:59:12,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-05 15:59:12,217 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 447 statements into 27 equivalence classes. [2025-02-05 15:59:12,290 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 336 of 447 statements. [2025-02-05 15:59:12,291 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-02-05 15:59:12,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:12,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 15:59:12,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:59:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5744 backedges. 2524 proven. 61 refuted. 0 times theorem prover too weak. 3159 trivial. 0 not checked. [2025-02-05 15:59:12,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:59:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5744 backedges. 933 proven. 255 refuted. 0 times theorem prover too weak. 4556 trivial. 0 not checked. [2025-02-05 15:59:13,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649390971] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:59:13,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:59:13,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 15] total 23 [2025-02-05 15:59:13,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571804658] [2025-02-05 15:59:13,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:59:13,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 15:59:13,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:59:13,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 15:59:13,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:59:13,479 INFO L87 Difference]: Start difference. First operand 160 states and 194 transitions. Second operand has 23 states, 22 states have (on average 4.045454545454546) internal successors, (89), 23 states have internal predecessors, (89), 16 states have call successors, (24), 2 states have call predecessors, (24), 8 states have return successors, (27), 7 states have call predecessors, (27), 16 states have call successors, (27) [2025-02-05 15:59:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:59:13,718 INFO L93 Difference]: Finished difference Result 258 states and 310 transitions. [2025-02-05 15:59:13,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 15:59:13,719 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.045454545454546) internal successors, (89), 23 states have internal predecessors, (89), 16 states have call successors, (24), 2 states have call predecessors, (24), 8 states have return successors, (27), 7 states have call predecessors, (27), 16 states have call successors, (27) Word has length 447 [2025-02-05 15:59:13,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:59:13,720 INFO L225 Difference]: With dead ends: 258 [2025-02-05 15:59:13,720 INFO L226 Difference]: Without dead ends: 161 [2025-02-05 15:59:13,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 879 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=1151, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 15:59:13,721 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 66 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:59:13,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 238 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:59:13,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-05 15:59:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2025-02-05 15:59:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 113 states have (on average 1.0707964601769913) internal successors, (121), 110 states have internal predecessors, (121), 30 states have call successors, (30), 24 states have call predecessors, (30), 16 states have return successors, (38), 25 states have call predecessors, (38), 30 states have call successors, (38) [2025-02-05 15:59:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 189 transitions. [2025-02-05 15:59:13,730 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 189 transitions. Word has length 447 [2025-02-05 15:59:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:59:13,730 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 189 transitions. [2025-02-05 15:59:13,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.045454545454546) internal successors, (89), 23 states have internal predecessors, (89), 16 states have call successors, (24), 2 states have call predecessors, (24), 8 states have return successors, (27), 7 states have call predecessors, (27), 16 states have call successors, (27) [2025-02-05 15:59:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2025-02-05 15:59:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-02-05 15:59:13,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:59:13,736 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:59:13,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-02-05 15:59:13,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-05 15:59:13,937 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:59:13,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:59:13,937 INFO L85 PathProgramCache]: Analyzing trace with hash 692310468, now seen corresponding path program 18 times [2025-02-05 15:59:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:59:13,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857124242] [2025-02-05 15:59:13,937 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:59:13,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:59:13,947 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 460 statements into 32 equivalence classes. [2025-02-05 15:59:13,974 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 15:59:13,974 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2025-02-05 15:59:13,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:59:13,974 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:59:13,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-05 15:59:14,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 15:59:14,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:59:14,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:59:14,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:59:14,081 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:59:14,081 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:59:14,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 15:59:14,086 INFO L422 BasicCegarLoop]: Path program histogram: [18, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:59:14,142 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:59:14,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:59:14 BoogieIcfgContainer [2025-02-05 15:59:14,144 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:59:14,144 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:59:14,144 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:59:14,144 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:59:14,145 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:26" (3/4) ... [2025-02-05 15:59:14,145 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:59:14,221 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 257. [2025-02-05 15:59:14,317 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:59:14,317 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:59:14,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:59:14,318 INFO L158 Benchmark]: Toolchain (without parser) took 48690.94ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 105.9MB in the beginning and 688.9MB in the end (delta: -583.0MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2025-02-05 15:59:14,318 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:59:14,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.88ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 94.5MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:59:14,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.00ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 94.0MB in the end (delta: 488.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:59:14,318 INFO L158 Benchmark]: Boogie Preprocessor took 24.12ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:59:14,319 INFO L158 Benchmark]: IcfgBuilder took 187.63ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 82.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:59:14,319 INFO L158 Benchmark]: TraceAbstraction took 48138.77ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 81.1MB in the beginning and 705.6MB in the end (delta: -624.5MB). Peak memory consumption was 365.9MB. Max. memory is 16.1GB. [2025-02-05 15:59:14,320 INFO L158 Benchmark]: Witness Printer took 173.18ms. Allocated memory is still 788.5MB. Free memory was 705.6MB in the beginning and 688.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:59:14,325 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.15ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.88ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 94.5MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.00ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 94.0MB in the end (delta: 488.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.12ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 187.63ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 82.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 48138.77ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 81.1MB in the beginning and 705.6MB in the end (delta: -624.5MB). Peak memory consumption was 365.9MB. Max. memory is 16.1GB. * Witness Printer took 173.18ms. Allocated memory is still 788.5MB. Free memory was 705.6MB in the beginning and 688.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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 = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) 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); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-2) 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-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [x=8] [L41] reach_error() VAL [x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.0s, OverallIterations: 26, TraceHistogramMax: 55, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1085 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 987 mSDsluCounter, 6575 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5824 mSDsCounter, 999 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7834 IncrementalHoareTripleChecker+Invalid, 8833 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 999 mSolverCounterUnsat, 751 mSDtfsCounter, 7834 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17445 GetRequests, 16666 SyntacticMatches, 139 SemanticMatches, 640 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=16, InterpolantAutomatonStates: 403, 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, 25 MinimizatonAttempts, 265 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 33.1s InterpolantComputationTime, 17435 NumberOfCodeBlocks, 12205 NumberOfCodeBlocksAsserted, 272 NumberOfCheckSat, 25381 ConstructedInterpolants, 0 QuantifiedInterpolants, 32140 SizeOfPredicates, 102 NumberOfNonLiveVariables, 13187 ConjunctsInSsa, 290 ConjunctsInUnsatCore, 71 InterpolantComputations, 2 PerfectInterpolantSequences, 350447/375213 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:59:14,347 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