./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/sum01_bug02.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/sum01_bug02.i -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 29d100da65e2ae9d5c43d48b49216d155078158e341858baee0b08b697e15c8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:53:32,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:53:32,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:53:32,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:53:32,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:53:32,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:53:32,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:53:32,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:53:32,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:53:32,776 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:53:32,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:53:32,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:53:32,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:53:32,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:53:32,776 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:53:32,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:53:32,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:53:32,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:53:32,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:53:32,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:53:32,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:53:32,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:53:32,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:53:32,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:53:32,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:53:32,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:53:32,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:53:32,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:53:32,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:53:32,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:53:32,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:53:32,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:53:32,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:53:32,778 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 -> 29d100da65e2ae9d5c43d48b49216d155078158e341858baee0b08b697e15c8e [2025-01-09 02:53:33,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:53:33,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:53:33,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:53:33,040 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:53:33,041 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:53:33,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/sum01_bug02.i [2025-01-09 02:53:34,243 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96db16c9a/fbc464034dfa42baa901d0e4fbc99bf3/FLAG5fa46b67e [2025-01-09 02:53:34,474 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:53:34,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/sum01_bug02.i [2025-01-09 02:53:34,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96db16c9a/fbc464034dfa42baa901d0e4fbc99bf3/FLAG5fa46b67e [2025-01-09 02:53:34,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96db16c9a/fbc464034dfa42baa901d0e4fbc99bf3 [2025-01-09 02:53:34,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:53:34,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:53:34,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:53:34,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:53:34,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:53:34,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:53:34" (1/1) ... [2025-01-09 02:53:34,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b9ba58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34, skipping insertion in model container [2025-01-09 02:53:34,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:53:34" (1/1) ... [2025-01-09 02:53:34,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:53:34,944 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/loops/sum01_bug02.i[812,825] [2025-01-09 02:53:34,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:53:34,960 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:53:34,967 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/loops/sum01_bug02.i[812,825] [2025-01-09 02:53:34,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:53:34,980 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:53:34,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34 WrapperNode [2025-01-09 02:53:34,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:53:34,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:53:34,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:53:34,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:53:34,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34" (1/1) ... [2025-01-09 02:53:34,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34" (1/1) ... [2025-01-09 02:53:35,001 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2025-01-09 02:53:35,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:53:35,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:53:35,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:53:35,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:53:35,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34" (1/1) ... [2025-01-09 02:53:35,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34" (1/1) ... [2025-01-09 02:53:35,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34" (1/1) ... [2025-01-09 02:53:35,018 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 02:53:35,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34" (1/1) ... [2025-01-09 02:53:35,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34" (1/1) ... [2025-01-09 02:53:35,020 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34" (1/1) ... [2025-01-09 02:53:35,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34" (1/1) ... [2025-01-09 02:53:35,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34" (1/1) ... [2025-01-09 02:53:35,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34" (1/1) ... [2025-01-09 02:53:35,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34" (1/1) ... [2025-01-09 02:53:35,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:53:35,028 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:53:35,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:53:35,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:53:35,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34" (1/1) ... [2025-01-09 02:53:35,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:53:35,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:35,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:53:35,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:53:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:53:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:53:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:53:35,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:53:35,112 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:53:35,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:53:35,204 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 02:53:35,206 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:53:35,211 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:53:35,212 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:53:35,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:53:35 BoogieIcfgContainer [2025-01-09 02:53:35,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:53:35,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:53:35,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:53:35,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:53:35,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:53:34" (1/3) ... [2025-01-09 02:53:35,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5449e485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:53:35, skipping insertion in model container [2025-01-09 02:53:35,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:34" (2/3) ... [2025-01-09 02:53:35,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5449e485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:53:35, skipping insertion in model container [2025-01-09 02:53:35,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:53:35" (3/3) ... [2025-01-09 02:53:35,223 INFO L128 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i [2025-01-09 02:53:35,234 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:53:35,235 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sum01_bug02.i that has 1 procedures, 13 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 02:53:35,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:53:35,283 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;@54367dba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:53:35,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:53:35,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:35,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 02:53:35,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:35,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 02:53:35,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:35,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:35,296 INFO L85 PathProgramCache]: Analyzing trace with hash 889579218, now seen corresponding path program 1 times [2025-01-09 02:53:35,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:35,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107799709] [2025-01-09 02:53:35,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:53:35,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:35,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 02:53:35,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 02:53:35,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:35,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:35,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:35,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107799709] [2025-01-09 02:53:35,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107799709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:53:35,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:53:35,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:53:35,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131704934] [2025-01-09 02:53:35,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:53:35,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:53:35,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:35,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:53:35,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:53:35,544 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:35,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:35,585 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2025-01-09 02:53:35,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:53:35,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 02:53:35,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:35,591 INFO L225 Difference]: With dead ends: 23 [2025-01-09 02:53:35,591 INFO L226 Difference]: Without dead ends: 12 [2025-01-09 02:53:35,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:53:35,597 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:35,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:53:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-01-09 02:53:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-01-09 02:53:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-01-09 02:53:35,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2025-01-09 02:53:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:35,624 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-01-09 02:53:35,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-01-09 02:53:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 02:53:35,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:35,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:35,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:53:35,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:35,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:35,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1240104491, now seen corresponding path program 1 times [2025-01-09 02:53:35,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:35,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709902660] [2025-01-09 02:53:35,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:53:35,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:35,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 02:53:35,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 02:53:35,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:35,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:35,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:35,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:35,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709902660] [2025-01-09 02:53:35,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709902660] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:53:35,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947502738] [2025-01-09 02:53:35,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:53:35,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:35,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:35,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:53:35,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:53:35,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 02:53:35,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 02:53:35,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:35,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:35,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 02:53:35,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:53:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:35,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:53:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:36,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947502738] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:53:36,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:53:36,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-01-09 02:53:36,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054048453] [2025-01-09 02:53:36,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:53:36,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 02:53:36,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:36,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 02:53:36,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-01-09 02:53:36,092 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:36,251 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-01-09 02:53:36,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 02:53:36,251 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 02:53:36,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:36,251 INFO L225 Difference]: With dead ends: 25 [2025-01-09 02:53:36,252 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 02:53:36,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-01-09 02:53:36,252 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:36,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:53:36,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 02:53:36,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2025-01-09 02:53:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-01-09 02:53:36,258 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2025-01-09 02:53:36,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:36,259 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-01-09 02:53:36,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:36,259 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-01-09 02:53:36,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 02:53:36,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:36,260 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:36,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 02:53:36,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:36,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:36,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:36,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1863669232, now seen corresponding path program 1 times [2025-01-09 02:53:36,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:36,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683177116] [2025-01-09 02:53:36,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:53:36,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:36,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 02:53:36,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 02:53:36,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:36,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:36,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 02:53:36,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:36,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683177116] [2025-01-09 02:53:36,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683177116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:53:36,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:53:36,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:53:36,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905824361] [2025-01-09 02:53:36,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:53:36,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:53:36,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:36,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:53:36,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:53:36,517 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:36,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:36,526 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-01-09 02:53:36,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:53:36,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 02:53:36,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:36,527 INFO L225 Difference]: With dead ends: 25 [2025-01-09 02:53:36,527 INFO L226 Difference]: Without dead ends: 16 [2025-01-09 02:53:36,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:53:36,527 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:36,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:53:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-01-09 02:53:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-09 02:53:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-01-09 02:53:36,530 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2025-01-09 02:53:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:36,531 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-01-09 02:53:36,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-01-09 02:53:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 02:53:36,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:36,531 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:36,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:53:36,532 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:36,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:36,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1620104396, now seen corresponding path program 2 times [2025-01-09 02:53:36,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:36,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272643336] [2025-01-09 02:53:36,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:53:36,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:36,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-09 02:53:36,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 02:53:36,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:53:36,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:36,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:36,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272643336] [2025-01-09 02:53:36,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272643336] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:53:36,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007901578] [2025-01-09 02:53:36,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:53:36,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:36,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:36,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:53:36,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:53:36,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-09 02:53:36,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 02:53:36,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:53:36,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:36,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:53:36,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:53:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:36,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:53:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:36,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007901578] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:53:36,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:53:36,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 02:53:36,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53163898] [2025-01-09 02:53:36,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:53:36,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 02:53:36,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:36,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 02:53:36,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:53:36,671 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:36,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:36,701 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2025-01-09 02:53:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 02:53:36,702 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 02:53:36,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:36,702 INFO L225 Difference]: With dead ends: 27 [2025-01-09 02:53:36,702 INFO L226 Difference]: Without dead ends: 21 [2025-01-09 02:53:36,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:53:36,703 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:36,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:53:36,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-09 02:53:36,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-01-09 02:53:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-01-09 02:53:36,706 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2025-01-09 02:53:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:36,706 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-01-09 02:53:36,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-01-09 02:53:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 02:53:36,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:36,706 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:36,713 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-01-09 02:53:36,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:36,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:36,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:36,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1439372085, now seen corresponding path program 2 times [2025-01-09 02:53:36,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:36,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518132631] [2025-01-09 02:53:36,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:53:36,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:36,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-09 02:53:36,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 02:53:36,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:53:36,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:53:37,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:37,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518132631] [2025-01-09 02:53:37,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518132631] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:53:37,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462926628] [2025-01-09 02:53:37,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:53:37,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:37,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:37,081 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:53:37,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:53:37,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-09 02:53:37,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 02:53:37,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:53:37,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:37,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 02:53:37,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:53:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:37,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:53:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:37,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462926628] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:53:37,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:53:37,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 27 [2025-01-09 02:53:37,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731688104] [2025-01-09 02:53:37,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:53:37,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 02:53:37,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:37,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 02:53:37,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2025-01-09 02:53:37,464 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:37,676 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2025-01-09 02:53:37,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 02:53:37,676 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 02:53:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:37,676 INFO L225 Difference]: With dead ends: 28 [2025-01-09 02:53:37,676 INFO L226 Difference]: Without dead ends: 25 [2025-01-09 02:53:37,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=1169, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 02:53:37,677 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:37,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 39 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:53:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-09 02:53:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-01-09 02:53:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-01-09 02:53:37,680 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2025-01-09 02:53:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:37,681 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-01-09 02:53:37,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-01-09 02:53:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 02:53:37,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:37,681 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:37,687 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-01-09 02:53:37,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:37,885 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:37,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:37,886 INFO L85 PathProgramCache]: Analyzing trace with hash 678826605, now seen corresponding path program 3 times [2025-01-09 02:53:37,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:37,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929743360] [2025-01-09 02:53:37,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:53:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:37,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-01-09 02:53:37,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 02:53:37,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 02:53:37,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:37,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:37,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929743360] [2025-01-09 02:53:37,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929743360] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:53:37,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148766492] [2025-01-09 02:53:37,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:53:37,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:37,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:37,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:53:37,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 02:53:37,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-01-09 02:53:38,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 02:53:38,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 02:53:38,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:38,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 02:53:38,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:53:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:38,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:53:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:38,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148766492] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:53:38,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:53:38,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-01-09 02:53:38,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972946874] [2025-01-09 02:53:38,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:53:38,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 02:53:38,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:38,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 02:53:38,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2025-01-09 02:53:38,119 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:38,145 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-01-09 02:53:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 02:53:38,146 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-09 02:53:38,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:38,146 INFO L225 Difference]: With dead ends: 34 [2025-01-09 02:53:38,146 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 02:53:38,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2025-01-09 02:53:38,147 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:38,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:53:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 02:53:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-01-09 02:53:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-01-09 02:53:38,150 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2025-01-09 02:53:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:38,150 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-01-09 02:53:38,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-01-09 02:53:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 02:53:38,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:38,151 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:38,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 02:53:38,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 02:53:38,351 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:38,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:38,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1532576268, now seen corresponding path program 4 times [2025-01-09 02:53:38,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:38,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916825466] [2025-01-09 02:53:38,352 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 02:53:38,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:38,356 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-01-09 02:53:38,363 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:53:38,364 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 02:53:38,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 02:53:38,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 02:53:38,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:53:38,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:53:38,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:38,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 02:53:38,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 02:53:38,397 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 02:53:38,398 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 02:53:38,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 02:53:38,402 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1] [2025-01-09 02:53:38,425 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 02:53:38,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:53:38 BoogieIcfgContainer [2025-01-09 02:53:38,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 02:53:38,428 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 02:53:38,429 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 02:53:38,430 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 02:53:38,431 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:53:35" (3/4) ... [2025-01-09 02:53:38,431 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 02:53:38,483 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 17. [2025-01-09 02:53:38,546 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 02:53:38,546 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 02:53:38,546 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 02:53:38,551 INFO L158 Benchmark]: Toolchain (without parser) took 3724.88ms. Allocated memory is still 167.8MB. Free memory was 125.1MB in the beginning and 131.1MB in the end (delta: -6.1MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2025-01-09 02:53:38,551 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:53:38,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.46ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 113.7MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:53:38,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.63ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 113.0MB in the end (delta: 713.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:53:38,551 INFO L158 Benchmark]: Boogie Preprocessor took 25.87ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 111.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:53:38,551 INFO L158 Benchmark]: RCFGBuilder took 184.34ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 101.2MB in the end (delta: 10.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:53:38,551 INFO L158 Benchmark]: TraceAbstraction took 3211.97ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 44.8MB in the end (delta: 55.7MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2025-01-09 02:53:38,551 INFO L158 Benchmark]: Witness Printer took 117.86ms. Allocated memory is still 167.8MB. Free memory was 44.8MB in the beginning and 131.1MB in the end (delta: -86.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:53:38,552 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.46ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 113.7MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.63ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 113.0MB in the end (delta: 713.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.87ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 111.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 184.34ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 101.2MB in the end (delta: 10.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3211.97ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 44.8MB in the end (delta: 55.7MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * Witness Printer took 117.86ms. Allocated memory is still 167.8MB. Free memory was 44.8MB in the beginning and 131.1MB in the end (delta: -86.3MB). 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: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; VAL [j=10, n=6, sn=0] [L24] COND FALSE !(n==2147483647) [L27] i=1 VAL [i=1, j=10, n=6, sn=0] [L27] COND TRUE i<=n VAL [i=1, j=10, n=6, sn=0] [L28] COND TRUE i