./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/nested_3.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/loop-simple/nested_3.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 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:23:24,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:23:24,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:23:24,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:23:24,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:23:24,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:23:24,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:23:24,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:23:24,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:23:24,806 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:23:24,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:23:24,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:23:24,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:23:24,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:23:24,807 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:23:24,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:23:24,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:23:24,808 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:23:24,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:23:24,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:23:24,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:23:24,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:23:24,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:23:24,809 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:23:24,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:23:24,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:23:24,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:23:24,810 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 -> 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 [2025-02-07 20:23:25,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:23:25,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:23:25,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:23:25,022 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:23:25,022 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:23:25,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_3.c [2025-02-07 20:23:26,127 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf91f40e5/6b2e26c485204c429074785235f4b485/FLAG2df9466c9 [2025-02-07 20:23:26,349 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:23:26,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_3.c [2025-02-07 20:23:26,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf91f40e5/6b2e26c485204c429074785235f4b485/FLAG2df9466c9 [2025-02-07 20:23:26,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf91f40e5/6b2e26c485204c429074785235f4b485 [2025-02-07 20:23:26,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:23:26,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:23:26,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:23:26,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:23:26,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:23:26,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:23:26" (1/1) ... [2025-02-07 20:23:26,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7bcf3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:23:26, skipping insertion in model container [2025-02-07 20:23:26,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:23:26" (1/1) ... [2025-02-07 20:23:26,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:23:26,790 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/loop-simple/nested_3.c[784,797] [2025-02-07 20:23:26,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:23:26,796 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:23:26,803 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/loop-simple/nested_3.c[784,797] [2025-02-07 20:23:26,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:23:26,810 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:23:26,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:23:26 WrapperNode [2025-02-07 20:23:26,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:23:26,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:23:26,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:23:26,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:23:26,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:23:26" (1/1) ... [2025-02-07 20:23:26,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:23:26" (1/1) ... [2025-02-07 20:23:26,825 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2025-02-07 20:23:26,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:23:26,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:23:26,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:23:26,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:23:26,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:23:26" (1/1) ... [2025-02-07 20:23:26,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:23:26" (1/1) ... [2025-02-07 20:23:26,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:23:26" (1/1) ... [2025-02-07 20:23:26,835 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 20:23:26,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:23:26" (1/1) ... [2025-02-07 20:23:26,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:23:26" (1/1) ... [2025-02-07 20:23:26,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:23:26" (1/1) ... [2025-02-07 20:23:26,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:23:26" (1/1) ... [2025-02-07 20:23:26,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:23:26" (1/1) ... [2025-02-07 20:23:26,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:23:26" (1/1) ... [2025-02-07 20:23:26,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:23:26,839 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:23:26,839 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:23:26,839 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:23:26,839 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:23:26" (1/1) ... [2025-02-07 20:23:26,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:23:26,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:23:26,875 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 20:23:26,878 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 20:23:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:23:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:23:26,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:23:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:23:26,925 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:23:26,926 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:23:27,026 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-07 20:23:27,026 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:23:27,036 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:23:27,036 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:23:27,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:23:27 BoogieIcfgContainer [2025-02-07 20:23:27,037 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:23:27,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:23:27,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:23:27,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:23:27,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:23:26" (1/3) ... [2025-02-07 20:23:27,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352e543e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:23:27, skipping insertion in model container [2025-02-07 20:23:27,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:23:26" (2/3) ... [2025-02-07 20:23:27,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352e543e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:23:27, skipping insertion in model container [2025-02-07 20:23:27,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:23:27" (3/3) ... [2025-02-07 20:23:27,047 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_3.c [2025-02-07 20:23:27,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:23:27,060 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_3.c that has 1 procedures, 10 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-07 20:23:27,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:23:27,108 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;@2dd3a8e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:23:27,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:23:27,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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-02-07 20:23:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 20:23:27,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:23:27,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 20:23:27,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:23:27,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:23:27,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1260927, now seen corresponding path program 1 times [2025-02-07 20:23:27,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:23:27,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386854912] [2025-02-07 20:23:27,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:23:27,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:23:27,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 20:23:27,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 20:23:27,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:23:27,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:23:27,238 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 20:23:27,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:23:27,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386854912] [2025-02-07 20:23:27,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386854912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:23:27,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:23:27,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:23:27,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997888964] [2025-02-07 20:23:27,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:23:27,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:23:27,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:23:27,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:23:27,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:23:27,257 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-02-07 20:23:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:23:27,284 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2025-02-07 20:23:27,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:23:27,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-02-07 20:23:27,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:23:27,292 INFO L225 Difference]: With dead ends: 19 [2025-02-07 20:23:27,293 INFO L226 Difference]: Without dead ends: 10 [2025-02-07 20:23:27,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:23:27,297 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:23:27,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:23:27,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-07 20:23:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2025-02-07 20:23:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-02-07 20:23:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2025-02-07 20:23:27,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 4 [2025-02-07 20:23:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:23:27,323 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-02-07 20:23:27,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-02-07 20:23:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2025-02-07 20:23:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 20:23:27,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:23:27,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 20:23:27,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:23:27,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:23:27,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:23:27,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1210894691, now seen corresponding path program 1 times [2025-02-07 20:23:27,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:23:27,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660771832] [2025-02-07 20:23:27,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:23:27,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:23:27,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 20:23:27,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 20:23:27,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:23:27,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:23:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:23:27,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:23:27,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660771832] [2025-02-07 20:23:27,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660771832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:23:27,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:23:27,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:23:27,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432411338] [2025-02-07 20:23:27,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:23:27,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:23:27,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:23:27,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:23:27,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:23:27,368 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-02-07 20:23:27,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:23:27,380 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2025-02-07 20:23:27,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:23:27,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-02-07 20:23:27,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:23:27,381 INFO L225 Difference]: With dead ends: 16 [2025-02-07 20:23:27,381 INFO L226 Difference]: Without dead ends: 10 [2025-02-07 20:23:27,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:23:27,382 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 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-02-07 20:23:27,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:23:27,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-07 20:23:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-07 20:23:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-02-07 20:23:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2025-02-07 20:23:27,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2025-02-07 20:23:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:23:27,385 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-02-07 20:23:27,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-02-07 20:23:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2025-02-07 20:23:27,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 20:23:27,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:23:27,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:23:27,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:23:27,386 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:23:27,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:23:27,386 INFO L85 PathProgramCache]: Analyzing trace with hash -184078431, now seen corresponding path program 1 times [2025-02-07 20:23:27,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:23:27,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072907398] [2025-02-07 20:23:27,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:23:27,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:23:27,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 20:23:27,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:23:27,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:23:27,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:23:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:23:27,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:23:27,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072907398] [2025-02-07 20:23:27,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072907398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:23:27,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:23:27,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:23:27,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293348839] [2025-02-07 20:23:27,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:23:27,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:23:27,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:23:27,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:23:27,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:23:27,428 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-02-07 20:23:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:23:27,436 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-02-07 20:23:27,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:23:27,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-02-07 20:23:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:23:27,436 INFO L225 Difference]: With dead ends: 17 [2025-02-07 20:23:27,436 INFO L226 Difference]: Without dead ends: 10 [2025-02-07 20:23:27,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:23:27,437 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:23:27,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:23:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-07 20:23:27,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-02-07 20:23:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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-02-07 20:23:27,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2025-02-07 20:23:27,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2025-02-07 20:23:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:23:27,439 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-02-07 20:23:27,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-02-07 20:23:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2025-02-07 20:23:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:23:27,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:23:27,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:23:27,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:23:27,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:23:27,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:23:27,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1382053588, now seen corresponding path program 1 times [2025-02-07 20:23:27,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:23:27,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283895506] [2025-02-07 20:23:27,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:23:27,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:23:27,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:23:27,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:23:27,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:23:27,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:23:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:23:27,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:23:27,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283895506] [2025-02-07 20:23:27,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283895506] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:23:27,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014504185] [2025-02-07 20:23:27,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:23:27,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:23:27,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:23:27,517 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 20:23:27,522 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 20:23:27,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:23:27,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:23:27,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:23:27,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:23:27,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 20:23:27,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:23:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:23:27,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:23:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:23:27,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014504185] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:23:27,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:23:27,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-07 20:23:27,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840767138] [2025-02-07 20:23:27,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:23:27,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:23:27,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:23:27,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:23:27,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:23:27,614 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-02-07 20:23:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:23:27,636 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2025-02-07 20:23:27,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:23:27,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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) Word has length 9 [2025-02-07 20:23:27,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:23:27,637 INFO L225 Difference]: With dead ends: 21 [2025-02-07 20:23:27,637 INFO L226 Difference]: Without dead ends: 13 [2025-02-07 20:23:27,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:23:27,638 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:23:27,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:23:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-07 20:23:27,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-07 20:23:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-02-07 20:23:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-02-07 20:23:27,643 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 9 [2025-02-07 20:23:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:23:27,643 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-02-07 20:23:27,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-02-07 20:23:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-02-07 20:23:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:23:27,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:23:27,644 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:23:27,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 20:23:27,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:23:27,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:23:27,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:23:27,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2062108063, now seen corresponding path program 2 times [2025-02-07 20:23:27,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:23:27,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255189774] [2025-02-07 20:23:27,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:23:27,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:23:27,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-07 20:23:27,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:23:27,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:23:27,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:23:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-07 20:23:27,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:23:27,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255189774] [2025-02-07 20:23:27,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255189774] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:23:27,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108466805] [2025-02-07 20:23:27,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:23:27,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:23:27,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:23:27,895 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 20:23:27,897 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 20:23:27,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-07 20:23:27,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:23:27,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:23:27,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:23:27,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 20:23:27,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:23:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:23:27,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:23:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:23:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108466805] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:23:28,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:23:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 10 [2025-02-07 20:23:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587379985] [2025-02-07 20:23:28,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:23:28,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 20:23:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:23:28,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 20:23:28,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:23:28,044 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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-02-07 20:23:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:23:28,166 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2025-02-07 20:23:28,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-07 20:23:28,167 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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) Word has length 12 [2025-02-07 20:23:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:23:28,167 INFO L225 Difference]: With dead ends: 45 [2025-02-07 20:23:28,167 INFO L226 Difference]: Without dead ends: 34 [2025-02-07 20:23:28,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2025-02-07 20:23:28,168 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:23:28,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:23:28,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-07 20:23:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2025-02-07 20:23:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-02-07 20:23:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-02-07 20:23:28,172 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 12 [2025-02-07 20:23:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:23:28,173 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-02-07 20:23:28,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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-02-07 20:23:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-02-07 20:23:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 20:23:28,173 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:23:28,173 INFO L218 NwaCegarLoop]: trace histogram [12, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-07 20:23:28,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 20:23:28,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:23:28,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:23:28,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:23:28,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2106707843, now seen corresponding path program 3 times [2025-02-07 20:23:28,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:23:28,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968486042] [2025-02-07 20:23:28,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:23:28,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:23:28,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 11 equivalence classes. [2025-02-07 20:23:28,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:23:28,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-07 20:23:28,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:23:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-07 20:23:28,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:23:28,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968486042] [2025-02-07 20:23:28,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968486042] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:23:28,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650293814] [2025-02-07 20:23:28,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:23:28,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:23:28,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:23:28,462 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 20:23:28,463 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 20:23:28,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 11 equivalence classes. [2025-02-07 20:23:28,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:23:28,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-07 20:23:28,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:23:28,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 20:23:28,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:23:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-07 20:23:28,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:23:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-07 20:23:28,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650293814] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:23:28,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:23:28,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-07 20:23:28,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171159758] [2025-02-07 20:23:28,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:23:28,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 20:23:28,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:23:28,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 20:23:28,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:23:28,536 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-02-07 20:23:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:23:28,650 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2025-02-07 20:23:28,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-07 20:23:28,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 24 [2025-02-07 20:23:28,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:23:28,652 INFO L225 Difference]: With dead ends: 154 [2025-02-07 20:23:28,652 INFO L226 Difference]: Without dead ends: 140 [2025-02-07 20:23:28,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=270, Unknown=0, NotChecked=0, Total=420 [2025-02-07 20:23:28,652 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:23:28,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 15 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:23:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-07 20:23:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2025-02-07 20:23:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.150943396226415) internal successors, (122), 106 states have internal predecessors, (122), 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-02-07 20:23:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2025-02-07 20:23:28,666 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 24 [2025-02-07 20:23:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:23:28,666 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2025-02-07 20:23:28,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-02-07 20:23:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2025-02-07 20:23:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-07 20:23:28,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:23:28,668 INFO L218 NwaCegarLoop]: trace histogram [72, 12, 12, 3, 3, 1, 1, 1, 1] [2025-02-07 20:23:28,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 20:23:28,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:23:28,873 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:23:28,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:23:28,874 INFO L85 PathProgramCache]: Analyzing trace with hash -28402541, now seen corresponding path program 4 times [2025-02-07 20:23:28,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:23:28,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225667320] [2025-02-07 20:23:28,874 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:23:28,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:23:28,884 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 106 statements into 2 equivalence classes. [2025-02-07 20:23:28,902 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 105 of 106 statements. [2025-02-07 20:23:28,902 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 20:23:28,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:23:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3597 backedges. 1621 proven. 304 refuted. 0 times theorem prover too weak. 1672 trivial. 0 not checked. [2025-02-07 20:23:29,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:23:29,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225667320] [2025-02-07 20:23:29,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225667320] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:23:29,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650522808] [2025-02-07 20:23:29,056 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:23:29,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:23:29,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:23:29,058 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:23:29,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 20:23:29,107 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 106 statements into 2 equivalence classes. [2025-02-07 20:23:29,141 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 105 of 106 statements. [2025-02-07 20:23:29,142 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 20:23:29,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:23:29,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 20:23:29,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:23:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3597 backedges. 1621 proven. 304 refuted. 0 times theorem prover too weak. 1672 trivial. 0 not checked. [2025-02-07 20:23:29,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:23:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3597 backedges. 1621 proven. 304 refuted. 0 times theorem prover too weak. 1672 trivial. 0 not checked. [2025-02-07 20:23:29,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650522808] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:23:29,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:23:29,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-02-07 20:23:29,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115961991] [2025-02-07 20:23:29,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:23:29,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:23:29,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:23:29,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:23:29,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:23:29,305 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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-02-07 20:23:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:23:29,362 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2025-02-07 20:23:29,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:23:29,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Word has length 106 [2025-02-07 20:23:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:23:29,364 INFO L225 Difference]: With dead ends: 227 [2025-02-07 20:23:29,364 INFO L226 Difference]: Without dead ends: 155 [2025-02-07 20:23:29,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:23:29,365 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:23:29,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 16 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:23:29,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-07 20:23:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-02-07 20:23:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.1428571428571428) internal successors, (176), 154 states have internal predecessors, (176), 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-02-07 20:23:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 176 transitions. [2025-02-07 20:23:29,393 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 176 transitions. Word has length 106 [2025-02-07 20:23:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:23:29,394 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 176 transitions. [2025-02-07 20:23:29,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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-02-07 20:23:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2025-02-07 20:23:29,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-07 20:23:29,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:23:29,398 INFO L218 NwaCegarLoop]: trace histogram [108, 18, 18, 3, 3, 1, 1, 1, 1] [2025-02-07 20:23:29,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 20:23:29,603 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,SelfDestructingSolverStorable6 [2025-02-07 20:23:29,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:23:29,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:23:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1328145351, now seen corresponding path program 5 times [2025-02-07 20:23:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:23:29,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308910186] [2025-02-07 20:23:29,605 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 20:23:29,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:23:29,619 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 154 statements into 76 equivalence classes. [2025-02-07 20:23:29,701 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) and asserted 154 of 154 statements. [2025-02-07 20:23:29,702 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2025-02-07 20:23:29,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:23:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8091 backedges. 0 proven. 5445 refuted. 0 times theorem prover too weak. 2646 trivial. 0 not checked. [2025-02-07 20:23:29,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:23:29,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308910186] [2025-02-07 20:23:29,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308910186] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:23:29,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550728860] [2025-02-07 20:23:29,920 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 20:23:29,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:23:29,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:23:29,925 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:23:29,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 20:23:29,965 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 154 statements into 76 equivalence classes. [2025-02-07 20:23:30,049 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) and asserted 154 of 154 statements. [2025-02-07 20:23:30,050 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2025-02-07 20:23:30,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:23:30,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:23:30,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:23:30,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8091 backedges. 0 proven. 5445 refuted. 0 times theorem prover too weak. 2646 trivial. 0 not checked. [2025-02-07 20:23:30,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:23:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8091 backedges. 0 proven. 5445 refuted. 0 times theorem prover too weak. 2646 trivial. 0 not checked. [2025-02-07 20:23:30,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550728860] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:23:30,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:23:30,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-07 20:23:30,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974346545] [2025-02-07 20:23:30,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:23:30,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:23:30,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:23:30,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:23:30,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:23:30,497 INFO L87 Difference]: Start difference. First operand 155 states and 176 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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-02-07 20:23:30,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:23:30,534 INFO L93 Difference]: Finished difference Result 308 states and 352 transitions. [2025-02-07 20:23:30,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:23:30,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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 154 [2025-02-07 20:23:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:23:30,536 INFO L225 Difference]: With dead ends: 308 [2025-02-07 20:23:30,536 INFO L226 Difference]: Without dead ends: 305 [2025-02-07 20:23:30,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 303 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:23:30,537 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:23:30,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:23:30,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-07 20:23:30,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-02-07 20:23:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.1414473684210527) internal successors, (347), 304 states have internal predecessors, (347), 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-02-07 20:23:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 347 transitions. [2025-02-07 20:23:30,563 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 347 transitions. Word has length 154 [2025-02-07 20:23:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:23:30,563 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 347 transitions. [2025-02-07 20:23:30,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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-02-07 20:23:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 347 transitions. [2025-02-07 20:23:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-02-07 20:23:30,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:23:30,566 INFO L218 NwaCegarLoop]: trace histogram [216, 36, 36, 6, 6, 1, 1, 1, 1] [2025-02-07 20:23:30,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 20:23:30,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:23:30,767 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:23:30,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:23:30,768 INFO L85 PathProgramCache]: Analyzing trace with hash -892951537, now seen corresponding path program 6 times [2025-02-07 20:23:30,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:23:30,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585400581] [2025-02-07 20:23:30,768 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 20:23:30,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:23:30,795 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 304 statements into 151 equivalence classes. [2025-02-07 20:23:30,851 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 101 check-sat command(s) and asserted 204 of 304 statements. [2025-02-07 20:23:30,851 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 101 check-sat command(s) [2025-02-07 20:23:30,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:23:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 32508 backedges. 9328 proven. 0 refuted. 0 times theorem prover too weak. 23180 trivial. 0 not checked. [2025-02-07 20:23:31,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:23:31,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585400581] [2025-02-07 20:23:31,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585400581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:23:31,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:23:31,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 20:23:31,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289653175] [2025-02-07 20:23:31,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:23:31,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:23:31,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:23:31,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:23:31,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:23:31,212 INFO L87 Difference]: Start difference. First operand 305 states and 347 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-02-07 20:23:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:23:31,285 INFO L93 Difference]: Finished difference Result 305 states and 347 transitions. [2025-02-07 20:23:31,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:23:31,285 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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) Word has length 304 [2025-02-07 20:23:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:23:31,287 INFO L225 Difference]: With dead ends: 305 [2025-02-07 20:23:31,287 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 20:23:31,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:23:31,289 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:23:31,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:23:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 20:23:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 20:23:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-07 20:23:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 20:23:31,290 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 304 [2025-02-07 20:23:31,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:23:31,292 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 20:23:31,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-02-07 20:23:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 20:23:31,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 20:23:31,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:23:31,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 20:23:31,297 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2025-02-07 20:23:31,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 20:23:35,385 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:23:35,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:23:35 BoogieIcfgContainer [2025-02-07 20:23:35,409 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:23:35,410 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:23:35,410 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:23:35,411 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:23:35,411 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:23:27" (3/4) ... [2025-02-07 20:23:35,413 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 20:23:35,419 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-07 20:23:35,419 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 20:23:35,419 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 20:23:35,419 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 20:23:35,469 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:23:35,470 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:23:35,470 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:23:35,470 INFO L158 Benchmark]: Toolchain (without parser) took 8782.76ms. Allocated memory was 142.6MB in the beginning and 855.6MB in the end (delta: 713.0MB). Free memory was 106.4MB in the beginning and 622.8MB in the end (delta: -516.4MB). Peak memory consumption was 192.5MB. Max. memory is 16.1GB. [2025-02-07 20:23:35,471 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:23:35,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 122.84ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 95.9MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:23:35,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 14.10ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 94.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:23:35,472 INFO L158 Benchmark]: Boogie Preprocessor took 12.47ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 93.9MB in the end (delta: 170.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:23:35,472 INFO L158 Benchmark]: IcfgBuilder took 198.84ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 83.7MB in the end (delta: 10.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:23:35,473 INFO L158 Benchmark]: TraceAbstraction took 8368.50ms. Allocated memory was 142.6MB in the beginning and 855.6MB in the end (delta: 713.0MB). Free memory was 82.8MB in the beginning and 626.6MB in the end (delta: -543.9MB). Peak memory consumption was 482.1MB. Max. memory is 16.1GB. [2025-02-07 20:23:35,473 INFO L158 Benchmark]: Witness Printer took 59.47ms. Allocated memory is still 855.6MB. Free memory was 626.6MB in the beginning and 622.8MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:23:35,474 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.13ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 122.84ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 95.9MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 14.10ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 94.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.47ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 93.9MB in the end (delta: 170.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 198.84ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 83.7MB in the end (delta: 10.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8368.50ms. Allocated memory was 142.6MB in the beginning and 855.6MB in the end (delta: 713.0MB). Free memory was 82.8MB in the beginning and 626.6MB in the end (delta: -543.9MB). Peak memory consumption was 482.1MB. Max. memory is 16.1GB. * Witness Printer took 59.47ms. Allocated memory is still 855.6MB. Free memory was 626.6MB in the beginning and 622.8MB in the end (delta: 3.8MB). There was no memory consumed. 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 - PositiveResult [Line: 29]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 9, TraceHistogramMax: 216, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 59 mSDtfsCounter, 166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 668 GetRequests, 591 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=8, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 45 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 932 NumberOfCodeBlocks, 830 NumberOfCodeBlocksAsserted, 286 NumberOfCheckSat, 1218 ConstructedInterpolants, 0 QuantifiedInterpolants, 2610 SizeOfPredicates, 0 NumberOfNonLiveVariables, 980 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 50591/67920 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Location Invariant Derived location invariant: (((a <= 5) && (b <= 6)) && (6 == c)) - InvariantResult [Line: 21]: Location Invariant Derived location invariant: (((a <= 6) && (6 == b)) && (6 == c)) - InvariantResult [Line: 23]: Location Invariant Derived location invariant: (((a <= 5) && (b <= 5)) && (c <= 6)) RESULT: Ultimate proved your program to be correct! [2025-02-07 20:23:35,497 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 Result: TRUE