./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-48c9605-m [2025-02-07 21:07:46,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:07:47,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:07:47,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:07:47,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:07:47,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:07:47,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:07:47,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:07:47,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:07:47,029 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:07:47,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:07:47,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:07:47,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:07:47,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:07:47,029 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:07:47,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:07:47,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:07:47,030 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:07:47,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:07:47,030 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:07:47,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:07:47,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:07:47,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:07:47,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:07:47,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:07:47,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:07:47,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:07:47,031 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-07 21:07:47,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:07:47,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:07:47,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:07:47,254 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:07:47,254 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:07:47,255 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-07 21:07:48,423 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/651a23fe8/cb5c6f93f69d475695deaccdc7faf050/FLAG3362906a9 [2025-02-07 21:07:48,634 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:07:48,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c [2025-02-07 21:07:48,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/651a23fe8/cb5c6f93f69d475695deaccdc7faf050/FLAG3362906a9 [2025-02-07 21:07:48,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/651a23fe8/cb5c6f93f69d475695deaccdc7faf050 [2025-02-07 21:07:48,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:07:48,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:07:48,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:07:48,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:07:48,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:07:48,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:07:48" (1/1) ... [2025-02-07 21:07:48,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340f9b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:48, skipping insertion in model container [2025-02-07 21:07:48,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:07:48" (1/1) ... [2025-02-07 21:07:49,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:07:49,107 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-07 21:07:49,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:07:49,119 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:07:49,127 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-07 21:07:49,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:07:49,138 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:07:49,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:49 WrapperNode [2025-02-07 21:07:49,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:07:49,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:07:49,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:07:49,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:07:49,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:49" (1/1) ... [2025-02-07 21:07:49,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:49" (1/1) ... [2025-02-07 21:07:49,160 INFO L138 Inliner]: procedures = 12, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2025-02-07 21:07:49,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:07:49,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:07:49,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:07:49,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:07:49,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:49" (1/1) ... [2025-02-07 21:07:49,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:49" (1/1) ... [2025-02-07 21:07:49,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:49" (1/1) ... [2025-02-07 21:07:49,177 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-07 21:07:49,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:49" (1/1) ... [2025-02-07 21:07:49,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:49" (1/1) ... [2025-02-07 21:07:49,182 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:49" (1/1) ... [2025-02-07 21:07:49,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:49" (1/1) ... [2025-02-07 21:07:49,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:49" (1/1) ... [2025-02-07 21:07:49,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:49" (1/1) ... [2025-02-07 21:07:49,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:07:49,189 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:07:49,189 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:07:49,189 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:07:49,190 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:49" (1/1) ... [2025-02-07 21:07:49,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:07:49,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:07:49,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:07:49,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:07:49,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:07:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:07:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:07:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_19_to_19_0 [2025-02-07 21:07:49,240 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_19_to_19_0 [2025-02-07 21:07:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:07:49,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:07:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:07:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:07:49,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:07:49,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:07:49,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:07:49,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:07:49,292 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:07:49,294 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:07:49,370 INFO L1324 $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-07 21:07:49,376 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-02-07 21:07:49,377 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:07:49,384 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:07:49,385 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:07:49,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:07:49 BoogieIcfgContainer [2025-02-07 21:07:49,386 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:07:49,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:07:49,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:07:49,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:07:49,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:07:48" (1/3) ... [2025-02-07 21:07:49,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c27425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:07:49, skipping insertion in model container [2025-02-07 21:07:49,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:49" (2/3) ... [2025-02-07 21:07:49,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c27425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:07:49, skipping insertion in model container [2025-02-07 21:07:49,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:07:49" (3/3) ... [2025-02-07 21:07:49,396 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_1b.c [2025-02-07 21:07:49,409 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:07:49,412 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_1b.c that has 2 procedures, 15 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-07 21:07:49,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:07:49,461 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;@3f5b4584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:07:49,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:07:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 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-07 21:07:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 21:07:49,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:07:49,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:07:49,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:07:49,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:07:49,474 INFO L85 PathProgramCache]: Analyzing trace with hash -60796584, now seen corresponding path program 1 times [2025-02-07 21:07:49,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:07:49,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790175915] [2025-02-07 21:07:49,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:07:49,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:07:49,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 21:07:49,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 21:07:49,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:07:49,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:07:49,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:07:49,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790175915] [2025-02-07 21:07:49,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790175915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:07:49,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:07:49,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:07:49,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93439835] [2025-02-07 21:07:49,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:07:49,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:07:49,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:07:49,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:07:49,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:07:49,800 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 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.4) internal successors, (7), 4 states have internal predecessors, (7), 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-07 21:07:49,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:07:49,859 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-02-07 21:07:49,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:07:49,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2025-02-07 21:07:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:07:49,866 INFO L225 Difference]: With dead ends: 25 [2025-02-07 21:07:49,866 INFO L226 Difference]: Without dead ends: 13 [2025-02-07 21:07:49,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-07 21:07:49,870 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:07:49,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:07:49,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-07 21:07:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-07 21:07:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 9 states have internal predecessors, (9), 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-07 21:07:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-02-07 21:07:49,893 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2025-02-07 21:07:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:07:49,894 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-02-07 21:07:49,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-07 21:07:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-02-07 21:07:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 21:07:49,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:07:49,895 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:07:49,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:07:49,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:07:49,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:07:49,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1383116127, now seen corresponding path program 1 times [2025-02-07 21:07:49,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:07:49,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121919366] [2025-02-07 21:07:49,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:07:49,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:07:49,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 21:07:49,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 21:07:49,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:07:49,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:50,251 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-07 21:07:50,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:07:50,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121919366] [2025-02-07 21:07:50,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121919366] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:07:50,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159523986] [2025-02-07 21:07:50,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:07:50,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:07:50,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:07:50,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:07:50,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 21:07:50,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 21:07:50,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 21:07:50,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:07:50,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:50,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-07 21:07:50,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:07:50,335 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-07 21:07:50,469 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-02-07 21:07:50,469 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-07 21:07:50,514 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-07 21:07:50,533 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-07 21:07:50,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:07:54,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159523986] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:07:54,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 21:07:54,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2025-02-07 21:07:54,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636629841] [2025-02-07 21:07:54,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 21:07:54,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:07:54,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:07:54,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:07:54,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=194, Unknown=1, NotChecked=0, Total=240 [2025-02-07 21:07:54,675 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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-07 21:07:54,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:07:54,840 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2025-02-07 21:07:54,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 21:07:54,840 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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 14 [2025-02-07 21:07:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:07:54,841 INFO L225 Difference]: With dead ends: 19 [2025-02-07 21:07:54,841 INFO L226 Difference]: Without dead ends: 15 [2025-02-07 21:07:54,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=75, Invalid=304, Unknown=1, NotChecked=0, Total=380 [2025-02-07 21:07:54,842 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:07:54,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 42 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 2 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:07:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-07 21:07:54,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-07 21:07:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 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), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 21:07:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-02-07 21:07:54,848 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2025-02-07 21:07:54,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:07:54,849 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-02-07 21:07:54,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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-07 21:07:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-02-07 21:07:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 21:07:54,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:07:54,851 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:07:54,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 21:07:55,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:07:55,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:07:55,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:07:55,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1506481188, now seen corresponding path program 2 times [2025-02-07 21:07:55,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:07:55,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352825728] [2025-02-07 21:07:55,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:07:55,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:07:55,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-07 21:07:55,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 21:07:55,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:07:55,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:55,407 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-07 21:07:55,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:07:55,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352825728] [2025-02-07 21:07:55,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352825728] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:07:55,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741635466] [2025-02-07 21:07:55,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:07:55,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:07:55,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:07:55,409 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:07:55,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 21:07:55,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-07 21:07:55,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 21:07:55,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:07:55,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:55,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-07 21:07:55,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:07:55,451 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-07 21:07:55,604 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-07 21:07:55,624 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-07 21:07:55,638 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-07 21:07:55,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:07:55,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741635466] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:07:55,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 21:07:55,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2025-02-07 21:07:55,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524057042] [2025-02-07 21:07:55,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 21:07:55,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 21:07:55,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:07:55,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 21:07:55,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-02-07 21:07:55,969 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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-07 21:07:56,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:07:56,051 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-02-07 21:07:56,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 21:07:56,053 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 19 [2025-02-07 21:07:56,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:07:56,053 INFO L225 Difference]: With dead ends: 25 [2025-02-07 21:07:56,054 INFO L226 Difference]: Without dead ends: 19 [2025-02-07 21:07:56,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-02-07 21:07:56,056 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:07:56,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 33 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:07:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-07 21:07:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-07 21:07:56,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 21:07:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-02-07 21:07:56,062 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 19 [2025-02-07 21:07:56,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:07:56,063 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-02-07 21:07:56,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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-07 21:07:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-02-07 21:07:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 21:07:56,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:07:56,063 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:07:56,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 21:07:56,264 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-07 21:07:56,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:07:56,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:07:56,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1691442272, now seen corresponding path program 3 times [2025-02-07 21:07:56,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:07:56,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058388043] [2025-02-07 21:07:56,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:07:56,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:07:56,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-02-07 21:07:56,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 21:07:56,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-07 21:07:56,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:56,752 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-07 21:07:56,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:07:56,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058388043] [2025-02-07 21:07:56,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058388043] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:07:56,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053613094] [2025-02-07 21:07:56,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:07:56,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:07:56,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:07:56,757 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:07:56,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 21:07:56,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-02-07 21:07:56,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 21:07:56,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-07 21:07:56,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:56,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-07 21:07:56,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:07:56,839 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-07 21:07:57,157 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-07 21:07:57,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:07:58,774 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-07 21:07:58,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053613094] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:07:58,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:07:58,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 21] total 39 [2025-02-07 21:07:58,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434882559] [2025-02-07 21:07:58,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:07:58,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-07 21:07:58,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:07:58,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-07 21:07:58,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1263, Unknown=0, NotChecked=0, Total=1560 [2025-02-07 21:07:58,777 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 40 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 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-07 21:07:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:07:59,230 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2025-02-07 21:07:59,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-07 21:07:59,233 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 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 29 [2025-02-07 21:07:59,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:07:59,233 INFO L225 Difference]: With dead ends: 34 [2025-02-07 21:07:59,233 INFO L226 Difference]: Without dead ends: 28 [2025-02-07 21:07:59,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=548, Invalid=2208, Unknown=0, NotChecked=0, Total=2756 [2025-02-07 21:07:59,235 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:07:59,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 69 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:07:59,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-07 21:07:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-02-07 21:07:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 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-07 21:07:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-02-07 21:07:59,243 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 29 [2025-02-07 21:07:59,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:07:59,243 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-02-07 21:07:59,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 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-07 21:07:59,244 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-02-07 21:07:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 21:07:59,244 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:07:59,245 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:07:59,250 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-07 21:07:59,446 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-07 21:07:59,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:07:59,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:07:59,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1825874660, now seen corresponding path program 4 times [2025-02-07 21:07:59,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:07:59,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592534848] [2025-02-07 21:07:59,447 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:07:59,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:07:59,453 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-02-07 21:07:59,468 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 21:07:59,468 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 21:07:59,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:07:59,468 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 21:07:59,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 21:07:59,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 21:07:59,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:07:59,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:07:59,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 21:07:59,488 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 21:07:59,489 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 21:07:59,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:07:59,492 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-02-07 21:07:59,507 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:07:59,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:07:59 BoogieIcfgContainer [2025-02-07 21:07:59,510 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:07:59,510 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:07:59,510 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:07:59,510 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:07:59,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:07:49" (3/4) ... [2025-02-07 21:07:59,511 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 21:07:59,551 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 23. [2025-02-07 21:07:59,594 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:07:59,595 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:07:59,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:07:59,595 INFO L158 Benchmark]: Toolchain (without parser) took 10602.99ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 56.7MB in the end (delta: 76.0MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2025-02-07 21:07:59,596 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:07:59,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 146.55ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 121.9MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:07:59,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.54ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 121.0MB in the end (delta: 947.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:07:59,596 INFO L158 Benchmark]: Boogie Preprocessor took 27.00ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 119.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:07:59,596 INFO L158 Benchmark]: IcfgBuilder took 197.02ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 108.8MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:07:59,596 INFO L158 Benchmark]: TraceAbstraction took 10122.25ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 63.5MB in the end (delta: 44.5MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2025-02-07 21:07:59,597 INFO L158 Benchmark]: Witness Printer took 84.54ms. Allocated memory is still 167.8MB. Free memory was 63.5MB in the beginning and 56.7MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:07:59,598 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.92ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 146.55ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 121.9MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.54ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 121.0MB in the end (delta: 947.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.00ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 119.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 197.02ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 108.8MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10122.25ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 63.5MB in the end (delta: 44.5MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * Witness Printer took 84.54ms. Allocated memory is still 167.8MB. Free memory was 63.5MB in the beginning and 56.7MB in the end (delta: 6.7MB). 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, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 5, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 186 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 253 IncrementalHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 34 mSDtfsCounter, 253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred 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, 8.2s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 154 ConstructedInterpolants, 3 QuantifiedInterpolants, 1781 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-07 21:07:59,618 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