./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.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/recursified_loop-simple/recursified_nested_1b.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 4b2397f02ca31d86bec1660af6a105f36402aae0113477a6332673f13a213eff --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:01:29,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:01:30,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:01:30,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:01:30,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:01:30,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:01:30,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:01:30,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:01:30,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:01:30,035 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:01:30,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:01:30,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:01:30,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:01:30,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:01:30,036 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:01:30,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:01:30,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:01:30,036 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:01:30,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:01:30,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:01:30,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:01:30,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:01:30,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:01:30,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:01:30,037 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:01:30,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:01:30,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:01:30,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:01:30,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:01:30,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:01:30,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:01:30,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:01:30,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:01:30,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:01:30,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:01:30,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:01:30,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:01:30,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:01:30,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:01:30,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:01:30,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:01:30,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:01:30,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:01:30,038 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 -> 4b2397f02ca31d86bec1660af6a105f36402aae0113477a6332673f13a213eff [2025-02-05 16:01:30,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:01:30,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:01:30,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:01:30,235 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:01:30,235 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:01:30,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c [2025-02-05 16:01:31,331 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f89b248df/fc508eb63a6a4d9888019cb38cbce425/FLAG97e90ccc8 [2025-02-05 16:01:31,577 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:01:31,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c [2025-02-05 16:01:31,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f89b248df/fc508eb63a6a4d9888019cb38cbce425/FLAG97e90ccc8 [2025-02-05 16:01:31,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f89b248df/fc508eb63a6a4d9888019cb38cbce425 [2025-02-05 16:01:31,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:01:31,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:01:31,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:01:31,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:01:31,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:01:31,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:01:31" (1/1) ... [2025-02-05 16:01:31,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517539b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:31, skipping insertion in model container [2025-02-05 16:01:31,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:01:31" (1/1) ... [2025-02-05 16:01:31,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:01:32,031 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/recursified_loop-simple/recursified_nested_1b.c[1277,1290] [2025-02-05 16:01:32,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:01:32,040 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:01:32,049 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/recursified_loop-simple/recursified_nested_1b.c[1277,1290] [2025-02-05 16:01:32,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:01:32,059 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:01:32,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:32 WrapperNode [2025-02-05 16:01:32,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:01:32,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:01:32,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:01:32,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:01:32,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:32" (1/1) ... [2025-02-05 16:01:32,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:32" (1/1) ... [2025-02-05 16:01:32,077 INFO L138 Inliner]: procedures = 12, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2025-02-05 16:01:32,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:01:32,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:01:32,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:01:32,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:01:32,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:32" (1/1) ... [2025-02-05 16:01:32,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:32" (1/1) ... [2025-02-05 16:01:32,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:32" (1/1) ... [2025-02-05 16:01:32,094 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 2 writes are split as follows [0, 2]. [2025-02-05 16:01:32,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:32" (1/1) ... [2025-02-05 16:01:32,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:32" (1/1) ... [2025-02-05 16:01:32,097 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:32" (1/1) ... [2025-02-05 16:01:32,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:32" (1/1) ... [2025-02-05 16:01:32,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:32" (1/1) ... [2025-02-05 16:01:32,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:32" (1/1) ... [2025-02-05 16:01:32,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:01:32,102 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:01:32,102 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:01:32,102 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:01:32,103 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:32" (1/1) ... [2025-02-05 16:01:32,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:01:32,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:01:32,127 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 16:01:32,135 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 16:01:32,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:01:32,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:01:32,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:01:32,154 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_19_to_19_0 [2025-02-05 16:01:32,155 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_19_to_19_0 [2025-02-05 16:01:32,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:01:32,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:01:32,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:01:32,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:01:32,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:01:32,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:01:32,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 16:01:32,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 16:01:32,211 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:01:32,212 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:01:32,291 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L41: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-02-05 16:01:32,299 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-02-05 16:01:32,300 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:01:32,306 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:01:32,308 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:01:32,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:01:32 BoogieIcfgContainer [2025-02-05 16:01:32,309 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:01:32,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:01:32,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:01:32,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:01:32,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:01:31" (1/3) ... [2025-02-05 16:01:32,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69235dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:01:32, skipping insertion in model container [2025-02-05 16:01:32,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:32" (2/3) ... [2025-02-05 16:01:32,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69235dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:01:32, skipping insertion in model container [2025-02-05 16:01:32,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:01:32" (3/3) ... [2025-02-05 16:01:32,317 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_1b.c [2025-02-05 16:01:32,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:01:32,329 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_1b.c that has 2 procedures, 16 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:01:32,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:01:32,378 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;@3eaf056b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:01:32,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:01:32,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 16:01:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 16:01:32,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:01:32,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:01:32,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:01:32,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:01:32,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1232356904, now seen corresponding path program 1 times [2025-02-05 16:01:32,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:01:32,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916250856] [2025-02-05 16:01:32,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:01:32,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:01:32,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 16:01:32,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 16:01:32,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:01:32,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:32,766 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 16:01:32,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:01:32,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916250856] [2025-02-05 16:01:32,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916250856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:01:32,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:01:32,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:01:32,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463362962] [2025-02-05 16:01:32,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:01:32,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:01:32,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:01:32,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:01:32,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:01:32,782 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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 16:01:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:01:32,828 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2025-02-05 16:01:32,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:01:32,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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 16:01:32,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:01:32,834 INFO L225 Difference]: With dead ends: 26 [2025-02-05 16:01:32,834 INFO L226 Difference]: Without dead ends: 14 [2025-02-05 16:01:32,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:01:32,837 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:01:32,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 38 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:01:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-05 16:01:32,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-02-05 16:01:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 16:01:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-02-05 16:01:32,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2025-02-05 16:01:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:01:32,856 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-02-05 16:01:32,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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 16:01:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-02-05 16:01:32,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 16:01:32,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:01:32,859 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:01:32,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:01:32,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:01:32,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:01:32,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1216467219, now seen corresponding path program 1 times [2025-02-05 16:01:32,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:01:32,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854480191] [2025-02-05 16:01:32,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:01:32,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:01:32,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 16:01:32,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 16:01:32,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:01:32,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:33,286 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 16:01:33,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:01:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854480191] [2025-02-05 16:01:33,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854480191] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:01:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953479834] [2025-02-05 16:01:33,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:01:33,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:33,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:01:33,306 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 16:01:33,307 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 16:01:33,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 16:01:33,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 16:01:33,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:01:33,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:33,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:01:33,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:01:33,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 16:01:33,508 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-02-05 16:01:33,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 32 [2025-02-05 16:01:33,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 16:01:33,567 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 16:01:33,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:01:33,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953479834] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:01:33,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 16:01:33,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2025-02-05 16:01:33,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088069718] [2025-02-05 16:01:33,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 16:01:33,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:01:33,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:01:33,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:01:33,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:01:33,687 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 16:01:33,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:01:33,813 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2025-02-05 16:01:33,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:01:33,814 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2025-02-05 16:01:33,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:01:33,814 INFO L225 Difference]: With dead ends: 20 [2025-02-05 16:01:33,814 INFO L226 Difference]: Without dead ends: 16 [2025-02-05 16:01:33,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:01:33,815 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:01:33,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:01:33,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-05 16:01:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-05 16:01:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 16:01:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-02-05 16:01:33,818 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15 [2025-02-05 16:01:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:01:33,819 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-02-05 16:01:33,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 16:01:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2025-02-05 16:01:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 16:01:33,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:01:33,819 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:01:33,827 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 16:01:34,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:34,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:01:34,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:01:34,023 INFO L85 PathProgramCache]: Analyzing trace with hash -721494902, now seen corresponding path program 2 times [2025-02-05 16:01:34,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:01:34,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594932356] [2025-02-05 16:01:34,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:01:34,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:01:34,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-05 16:01:34,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 16:01:34,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 16:01:34,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 16:01:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:01:34,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594932356] [2025-02-05 16:01:34,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594932356] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:01:34,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605974630] [2025-02-05 16:01:34,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:01:34,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:34,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:01:34,315 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 16:01:34,316 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 16:01:34,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-05 16:01:34,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 16:01:34,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 16:01:34,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:34,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-05 16:01:34,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:01:34,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 16:01:34,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-05 16:01:34,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 16:01:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:01:34,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:01:34,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605974630] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:01:34,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 16:01:34,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2025-02-05 16:01:34,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159486964] [2025-02-05 16:01:34,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 16:01:34,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 16:01:34,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:01:34,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 16:01:34,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:01:34,816 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 16:01:34,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:01:34,859 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-02-05 16:01:34,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:01:34,859 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 20 [2025-02-05 16:01:34,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:01:34,860 INFO L225 Difference]: With dead ends: 26 [2025-02-05 16:01:34,860 INFO L226 Difference]: Without dead ends: 20 [2025-02-05 16:01:34,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:01:34,861 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:01:34,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 38 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:01:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-05 16:01:34,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-05 16:01:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 16:01:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-02-05 16:01:34,866 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 20 [2025-02-05 16:01:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:01:34,866 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-02-05 16:01:34,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 16:01:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2025-02-05 16:01:34,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 16:01:34,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:01:34,866 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:01:34,872 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 16:01:35,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:35,071 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:01:35,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:01:35,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1808985620, now seen corresponding path program 3 times [2025-02-05 16:01:35,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:01:35,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986832973] [2025-02-05 16:01:35,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 16:01:35,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:01:35,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 5 equivalence classes. [2025-02-05 16:01:35,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 16:01:35,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-05 16:01:35,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:01:35,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:01:35,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986832973] [2025-02-05 16:01:35,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986832973] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:01:35,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520112011] [2025-02-05 16:01:35,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 16:01:35,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:35,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:01:35,608 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 16:01:35,613 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 16:01:35,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 5 equivalence classes. [2025-02-05 16:01:35,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 16:01:35,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-05 16:01:35,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:35,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-05 16:01:35,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:01:35,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 16:01:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 16:01:35,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:01:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:01:37,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520112011] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:01:37,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:01:37,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 22] total 40 [2025-02-05 16:01:37,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434359626] [2025-02-05 16:01:37,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:01:37,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-05 16:01:37,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:01:37,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-05 16:01:37,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1263, Unknown=0, NotChecked=0, Total=1560 [2025-02-05 16:01:37,373 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 40 states, 30 states have (on average 1.3) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 6 states have call predecessors, (10), 12 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2025-02-05 16:01:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:01:37,756 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-02-05 16:01:37,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:01:37,756 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 30 states have (on average 1.3) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 6 states have call predecessors, (10), 12 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) Word has length 30 [2025-02-05 16:01:37,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:01:37,757 INFO L225 Difference]: With dead ends: 35 [2025-02-05 16:01:37,757 INFO L226 Difference]: Without dead ends: 29 [2025-02-05 16:01:37,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=548, Invalid=2208, Unknown=0, NotChecked=0, Total=2756 [2025-02-05 16:01:37,758 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:01:37,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 101 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:01:37,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-05 16:01:37,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-02-05 16:01:37,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:01:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-02-05 16:01:37,763 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 30 [2025-02-05 16:01:37,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:01:37,763 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-02-05 16:01:37,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 30 states have (on average 1.3) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 6 states have call predecessors, (10), 12 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2025-02-05 16:01:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-02-05 16:01:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 16:01:37,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:01:37,764 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:01:37,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 16:01:37,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:37,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:01:37,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:01:37,970 INFO L85 PathProgramCache]: Analyzing trace with hash -359700914, now seen corresponding path program 4 times [2025-02-05 16:01:37,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:01:37,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42633875] [2025-02-05 16:01:37,970 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 16:01:37,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:01:37,975 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-02-05 16:01:37,996 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 16:01:37,996 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 16:01:37,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 16:01:37,996 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 16:01:37,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 16:01:38,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 16:01:38,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:01:38,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 16:01:38,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 16:01:38,024 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 16:01:38,025 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 16:01:38,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:01:38,029 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-02-05 16:01:38,049 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 16:01:38,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 04:01:38 BoogieIcfgContainer [2025-02-05 16:01:38,054 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 16:01:38,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 16:01:38,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 16:01:38,055 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 16:01:38,055 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:01:32" (3/4) ... [2025-02-05 16:01:38,056 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 16:01:38,114 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 23. [2025-02-05 16:01:38,166 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 16:01:38,167 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 16:01:38,167 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 16:01:38,167 INFO L158 Benchmark]: Toolchain (without parser) took 6247.59ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 105.0MB in the beginning and 214.4MB in the end (delta: -109.4MB). Peak memory consumption was 176.6MB. Max. memory is 16.1GB. [2025-02-05 16:01:38,167 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 16:01:38,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.04ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 94.8MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 16:01:38,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.20ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 16:01:38,168 INFO L158 Benchmark]: Boogie Preprocessor took 22.36ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 93.2MB in the end (delta: 462.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 16:01:38,168 INFO L158 Benchmark]: IcfgBuilder took 206.57ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 82.6MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 16:01:38,168 INFO L158 Benchmark]: TraceAbstraction took 5743.22ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 82.6MB in the beginning and 222.8MB in the end (delta: -140.3MB). Peak memory consumption was 143.0MB. Max. memory is 16.1GB. [2025-02-05 16:01:38,172 INFO L158 Benchmark]: Witness Printer took 112.21ms. Allocated memory is still 427.8MB. Free memory was 222.8MB in the beginning and 214.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 16:01:38,173 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.04ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 94.8MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.20ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.36ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 93.2MB in the end (delta: 462.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 206.57ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 82.6MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5743.22ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 82.6MB in the beginning and 222.8MB in the end (delta: -140.3MB). Peak memory consumption was 143.0MB. Max. memory is 16.1GB. * Witness Printer took 112.21ms. Allocated memory is still 427.8MB. Free memory was 222.8MB in the beginning and 214.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 48]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] int a = 6; [L41] int a = 6; [L43] a = 0 [L44] CALL func_to_recursive_line_19_to_19_0(&a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND FALSE !((*a) < 6) [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L44] RET func_to_recursive_line_19_to_19_0(&a) VAL [a={7:0}] [L46] EXPR \read(a) [L46] COND TRUE a == 6 [L48] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 5, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 225 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 187 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 275 IncrementalHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 38 mSDtfsCounter, 275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 162 ConstructedInterpolants, 3 QuantifiedInterpolants, 1789 SizeOfPredicates, 20 NumberOfNonLiveVariables, 310 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 50/172 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 16:01:38,189 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