./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 9c0fb6a0d32b99c9a776859d2bc15d9177dc584955a2c1baa8ac133e976f40f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:54:04,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:54:04,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:54:04,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:54:04,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:54:04,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:54:04,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:54:04,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:54:04,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:54:04,130 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:54:04,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:54:04,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:54:04,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:54:04,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:54:04,130 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:54:04,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:54:04,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:54:04,131 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:54:04,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:54:04,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:54:04,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:54:04,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:54:04,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:54:04,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:54:04,135 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:54:04,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:54:04,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:54:04,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:54:04,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:54:04,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:54:04,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:54:04,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:54:04,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:54:04,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:54:04,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:54:04,135 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:54:04,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:54:04,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:54:04,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:54:04,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:54:04,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:54:04,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:54:04,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:54:04,136 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/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 -> 9c0fb6a0d32b99c9a776859d2bc15d9177dc584955a2c1baa8ac133e976f40f7 [2025-03-16 18:54:04,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:54:04,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:54:04,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:54:04,370 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:54:04,371 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:54:04,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2025-03-16 18:54:05,450 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998c10a3e/d315ab0932d04c22a76ede9da5df4a0d/FLAG387728e57 [2025-03-16 18:54:05,644 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:54:05,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2025-03-16 18:54:05,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998c10a3e/d315ab0932d04c22a76ede9da5df4a0d/FLAG387728e57 [2025-03-16 18:54:05,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998c10a3e/d315ab0932d04c22a76ede9da5df4a0d [2025-03-16 18:54:05,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:54:05,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:54:05,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:54:05,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:54:05,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:54:05,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:54:05" (1/1) ... [2025-03-16 18:54:05,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606969c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:54:05, skipping insertion in model container [2025-03-16 18:54:05,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:54:05" (1/1) ... [2025-03-16 18:54:05,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:54:05,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c[548,561] [2025-03-16 18:54:05,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:54:05,820 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:54:05,828 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c[548,561] [2025-03-16 18:54:05,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:54:05,840 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:54:05,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:54:05 WrapperNode [2025-03-16 18:54:05,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:54:05,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:54:05,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:54:05,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:54:05,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:54:05" (1/1) ... [2025-03-16 18:54:05,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:54:05" (1/1) ... [2025-03-16 18:54:05,863 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-03-16 18:54:05,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:54:05,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:54:05,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:54:05,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:54:05,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:54:05" (1/1) ... [2025-03-16 18:54:05,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:54:05" (1/1) ... [2025-03-16 18:54:05,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:54:05" (1/1) ... [2025-03-16 18:54:05,881 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-03-16 18:54:05,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:54:05" (1/1) ... [2025-03-16 18:54:05,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:54:05" (1/1) ... [2025-03-16 18:54:05,886 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:54:05" (1/1) ... [2025-03-16 18:54:05,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:54:05" (1/1) ... [2025-03-16 18:54:05,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:54:05" (1/1) ... [2025-03-16 18:54:05,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:54:05" (1/1) ... [2025-03-16 18:54:05,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:54:05,891 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:54:05,891 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:54:05,891 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:54:05,892 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:54:05" (1/1) ... [2025-03-16 18:54:05,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:54:05,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:54:05,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 18:54:05,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 18:54:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:54:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:54:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2025-03-16 18:54:05,944 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2025-03-16 18:54:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:54:05,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:54:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure id [2025-03-16 18:54:05,944 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2025-03-16 18:54:05,985 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:54:05,987 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:54:06,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: havoc #t~ret5; [2025-03-16 18:54:06,078 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11: havoc #t~ret4; [2025-03-16 18:54:06,087 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 18:54:06,088 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:54:06,096 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:54:06,096 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:54:06,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:54:06 BoogieIcfgContainer [2025-03-16 18:54:06,097 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:54:06,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:54:06,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:54:06,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:54:06,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:54:05" (1/3) ... [2025-03-16 18:54:06,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cfa8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:54:06, skipping insertion in model container [2025-03-16 18:54:06,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:54:05" (2/3) ... [2025-03-16 18:54:06,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cfa8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:54:06, skipping insertion in model container [2025-03-16 18:54:06,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:54:06" (3/3) ... [2025-03-16 18:54:06,105 INFO L128 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2025-03-16 18:54:06,118 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:54:06,120 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id2_i5_o5-2.c that has 3 procedures, 21 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 18:54:06,155 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:54:06,164 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;@75f7aeb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:54:06,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:54:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 18:54:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 18:54:06,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:54:06,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:54:06,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:54:06,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:54:06,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1382688227, now seen corresponding path program 1 times [2025-03-16 18:54:06,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:54:06,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781596579] [2025-03-16 18:54:06,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:54:06,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:54:06,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 18:54:06,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 18:54:06,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:54:06,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:54:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:54:06,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:54:06,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781596579] [2025-03-16 18:54:06,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781596579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:54:06,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:54:06,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:54:06,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907308076] [2025-03-16 18:54:06,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:54:06,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:54:06,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:54:06,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:54:06,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:54:06,375 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 18:54:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:54:06,432 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-03-16 18:54:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:54:06,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2025-03-16 18:54:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:54:06,438 INFO L225 Difference]: With dead ends: 30 [2025-03-16 18:54:06,438 INFO L226 Difference]: Without dead ends: 20 [2025-03-16 18:54:06,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:54:06,446 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:54:06,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 63 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:54:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-16 18:54:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-16 18:54:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-16 18:54:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-03-16 18:54:06,475 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 9 [2025-03-16 18:54:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:54:06,475 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-03-16 18:54:06,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 18:54:06,475 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-03-16 18:54:06,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 18:54:06,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:54:06,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:54:06,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:54:06,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:54:06,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:54:06,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1846534438, now seen corresponding path program 1 times [2025-03-16 18:54:06,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:54:06,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844110800] [2025-03-16 18:54:06,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:54:06,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:54:06,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 18:54:06,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 18:54:06,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:54:06,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:54:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:54:06,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:54:06,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844110800] [2025-03-16 18:54:06,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844110800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:54:06,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:54:06,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:54:06,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539995777] [2025-03-16 18:54:06,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:54:06,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:54:06,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:54:06,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:54:06,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:54:06,598 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 18:54:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:54:06,672 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-03-16 18:54:06,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:54:06,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-03-16 18:54:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:54:06,673 INFO L225 Difference]: With dead ends: 29 [2025-03-16 18:54:06,673 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 18:54:06,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:54:06,674 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:54:06,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 70 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:54:06,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 18:54:06,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-03-16 18:54:06,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 18:54:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-03-16 18:54:06,679 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2025-03-16 18:54:06,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:54:06,679 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-03-16 18:54:06,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 18:54:06,679 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-03-16 18:54:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 18:54:06,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:54:06,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:54:06,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:54:06,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:54:06,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:54:06,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1822847237, now seen corresponding path program 1 times [2025-03-16 18:54:06,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:54:06,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507733095] [2025-03-16 18:54:06,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:54:06,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:54:06,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 18:54:06,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 18:54:06,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:54:06,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:54:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 18:54:06,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:54:06,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507733095] [2025-03-16 18:54:06,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507733095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:54:06,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401311003] [2025-03-16 18:54:06,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:54:06,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:54:06,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:54:06,812 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:54:06,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 18:54:06,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 18:54:06,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 18:54:06,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:54:06,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:54:06,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 18:54:06,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:54:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 18:54:06,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:54:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 18:54:07,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401311003] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:54:07,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:54:07,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 12 [2025-03-16 18:54:07,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839259472] [2025-03-16 18:54:07,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:54:07,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 18:54:07,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:54:07,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 18:54:07,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:54:07,210 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 18:54:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:54:07,284 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2025-03-16 18:54:07,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 18:54:07,284 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 21 [2025-03-16 18:54:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:54:07,285 INFO L225 Difference]: With dead ends: 35 [2025-03-16 18:54:07,285 INFO L226 Difference]: Without dead ends: 31 [2025-03-16 18:54:07,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-16 18:54:07,286 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:54:07,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 120 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:54:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-16 18:54:07,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2025-03-16 18:54:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 18:54:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-03-16 18:54:07,289 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2025-03-16 18:54:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:54:07,290 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-16 18:54:07,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 18:54:07,290 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-03-16 18:54:07,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 18:54:07,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:54:07,291 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:54:07,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 18:54:07,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:54:07,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:54:07,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:54:07,492 INFO L85 PathProgramCache]: Analyzing trace with hash -219815678, now seen corresponding path program 1 times [2025-03-16 18:54:07,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:54:07,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517122620] [2025-03-16 18:54:07,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:54:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:54:07,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 18:54:07,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 18:54:07,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:54:07,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:54:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 18:54:07,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:54:07,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517122620] [2025-03-16 18:54:07,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517122620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:54:07,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788121059] [2025-03-16 18:54:07,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:54:07,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:54:07,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:54:07,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:54:07,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 18:54:07,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 18:54:07,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 18:54:07,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:54:07,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:54:07,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 18:54:07,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:54:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 18:54:07,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:54:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 18:54:08,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788121059] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:54:08,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:54:08,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 14 [2025-03-16 18:54:08,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418610545] [2025-03-16 18:54:08,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:54:08,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 18:54:08,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:54:08,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 18:54:08,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-16 18:54:08,142 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-16 18:54:08,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:54:08,216 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2025-03-16 18:54:08,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:54:08,217 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) Word has length 27 [2025-03-16 18:54:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:54:08,217 INFO L225 Difference]: With dead ends: 41 [2025-03-16 18:54:08,217 INFO L226 Difference]: Without dead ends: 37 [2025-03-16 18:54:08,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-16 18:54:08,218 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:54:08,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 114 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:54:08,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-16 18:54:08,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2025-03-16 18:54:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 18:54:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2025-03-16 18:54:08,222 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2025-03-16 18:54:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:54:08,222 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2025-03-16 18:54:08,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-16 18:54:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2025-03-16 18:54:08,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 18:54:08,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:54:08,223 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:54:08,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 18:54:08,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-16 18:54:08,423 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:54:08,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:54:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1289006099, now seen corresponding path program 2 times [2025-03-16 18:54:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:54:08,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629982090] [2025-03-16 18:54:08,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:54:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:54:08,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-16 18:54:08,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 18:54:08,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:54:08,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:54:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 18:54:08,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:54:08,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629982090] [2025-03-16 18:54:08,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629982090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:54:08,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401125882] [2025-03-16 18:54:08,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:54:08,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:54:08,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:54:08,573 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:54:08,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 18:54:08,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-16 18:54:08,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 18:54:08,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:54:08,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:54:08,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 18:54:08,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:54:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 18:54:08,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:54:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:54:09,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401125882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:54:09,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:54:09,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 17 [2025-03-16 18:54:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040751968] [2025-03-16 18:54:09,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:54:09,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 18:54:09,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:54:09,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 18:54:09,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-16 18:54:09,212 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-16 18:54:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:54:09,316 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2025-03-16 18:54:09,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 18:54:09,317 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 33 [2025-03-16 18:54:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:54:09,317 INFO L225 Difference]: With dead ends: 47 [2025-03-16 18:54:09,317 INFO L226 Difference]: Without dead ends: 43 [2025-03-16 18:54:09,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-03-16 18:54:09,318 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:54:09,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 134 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:54:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-16 18:54:09,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2025-03-16 18:54:09,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:54:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-03-16 18:54:09,325 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 33 [2025-03-16 18:54:09,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:54:09,325 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-03-16 18:54:09,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-16 18:54:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2025-03-16 18:54:09,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 18:54:09,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:54:09,326 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:54:09,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 18:54:09,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:54:09,526 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:54:09,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:54:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1244201174, now seen corresponding path program 2 times [2025-03-16 18:54:09,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:54:09,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668423355] [2025-03-16 18:54:09,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:54:09,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:54:09,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-16 18:54:09,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 18:54:09,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:54:09,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:54:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 18:54:09,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:54:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668423355] [2025-03-16 18:54:09,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668423355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:54:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300927099] [2025-03-16 18:54:09,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:54:09,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:54:09,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:54:09,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:54:09,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 18:54:09,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-16 18:54:09,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 18:54:09,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:54:09,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:54:09,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 18:54:09,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:54:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 18:54:09,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:54:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 18:54:09,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300927099] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:54:09,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:54:09,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2025-03-16 18:54:09,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082012902] [2025-03-16 18:54:09,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:54:09,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 18:54:09,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:54:09,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 18:54:09,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-16 18:54:09,885 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 6 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 18:54:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:54:09,950 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2025-03-16 18:54:09,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 18:54:09,951 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 6 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2025-03-16 18:54:09,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:54:09,951 INFO L225 Difference]: With dead ends: 53 [2025-03-16 18:54:09,952 INFO L226 Difference]: Without dead ends: 49 [2025-03-16 18:54:09,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-16 18:54:09,953 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:54:09,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 384 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:54:09,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-16 18:54:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2025-03-16 18:54:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 18:54:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2025-03-16 18:54:09,966 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 39 [2025-03-16 18:54:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:54:09,966 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2025-03-16 18:54:09,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 6 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 18:54:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2025-03-16 18:54:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 18:54:09,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:54:09,967 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:54:09,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 18:54:10,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:54:10,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:54:10,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:54:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1474593493, now seen corresponding path program 3 times [2025-03-16 18:54:10,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:54:10,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179314242] [2025-03-16 18:54:10,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:54:10,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:54:10,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 4 equivalence classes. [2025-03-16 18:54:10,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 18:54:10,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 18:54:10,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:54:10,306 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 18:54:10,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:54:10,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179314242] [2025-03-16 18:54:10,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179314242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:54:10,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655310392] [2025-03-16 18:54:10,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:54:10,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:54:10,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:54:10,308 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:54:10,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 18:54:10,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 4 equivalence classes. [2025-03-16 18:54:10,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 18:54:10,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 18:54:10,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:54:10,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 18:54:10,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:54:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 18:54:10,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:54:10,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655310392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:54:10,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:54:10,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 14 [2025-03-16 18:54:10,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210179425] [2025-03-16 18:54:10,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:54:10,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 18:54:10,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:54:10,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 18:54:10,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-16 18:54:10,397 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 18:54:10,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:54:10,494 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2025-03-16 18:54:10,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 18:54:10,495 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2025-03-16 18:54:10,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:54:10,495 INFO L225 Difference]: With dead ends: 59 [2025-03-16 18:54:10,496 INFO L226 Difference]: Without dead ends: 35 [2025-03-16 18:54:10,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-03-16 18:54:10,497 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:54:10,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 145 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:54:10,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-16 18:54:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-16 18:54:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 18:54:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-03-16 18:54:10,502 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 45 [2025-03-16 18:54:10,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:54:10,505 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-16 18:54:10,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 18:54:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-03-16 18:54:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 18:54:10,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:54:10,508 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:54:10,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 18:54:10,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:54:10,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:54:10,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:54:10,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1362590034, now seen corresponding path program 3 times [2025-03-16 18:54:10,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:54:10,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313633008] [2025-03-16 18:54:10,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:54:10,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:54:10,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 4 equivalence classes. [2025-03-16 18:54:10,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 18:54:10,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 18:54:10,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:54:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 18:54:10,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:54:10,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313633008] [2025-03-16 18:54:10,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313633008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:54:10,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:54:10,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 18:54:10,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033334433] [2025-03-16 18:54:10,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:54:10,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 18:54:10,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:54:10,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 18:54:10,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-16 18:54:10,902 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:54:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:54:10,983 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2025-03-16 18:54:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 18:54:10,984 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) Word has length 51 [2025-03-16 18:54:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:54:10,984 INFO L225 Difference]: With dead ends: 35 [2025-03-16 18:54:10,984 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 18:54:10,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-03-16 18:54:10,985 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:54:10,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 114 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:54:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 18:54:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 18:54:10,986 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-03-16 18:54:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 18:54:10,986 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2025-03-16 18:54:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:54:10,986 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 18:54:10,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:54:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 18:54:10,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 18:54:10,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 18:54:10,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 18:54:10,992 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1] [2025-03-16 18:54:10,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 18:54:11,294 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 18:54:11,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 06:54:11 BoogieIcfgContainer [2025-03-16 18:54:11,298 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 18:54:11,299 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 18:54:11,299 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 18:54:11,299 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 18:54:11,300 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:54:06" (3/4) ... [2025-03-16 18:54:11,302 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 18:54:11,306 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure id2 [2025-03-16 18:54:11,307 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure id [2025-03-16 18:54:11,309 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 18:54:11,310 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 18:54:11,310 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 18:54:11,310 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 18:54:11,373 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 18:54:11,373 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 18:54:11,373 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 18:54:11,374 INFO L158 Benchmark]: Toolchain (without parser) took 5701.82ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 112.4MB in the end (delta: 1.7MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2025-03-16 18:54:11,374 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:54:11,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.08ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 103.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:54:11,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.81ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 102.4MB in the end (delta: 998.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:54:11,375 INFO L158 Benchmark]: Boogie Preprocessor took 26.07ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:54:11,375 INFO L158 Benchmark]: IcfgBuilder took 205.88ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 90.6MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 18:54:11,376 INFO L158 Benchmark]: TraceAbstraction took 5200.23ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 42.9MB in the end (delta: 47.2MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2025-03-16 18:54:11,376 INFO L158 Benchmark]: Witness Printer took 74.45ms. Allocated memory is still 142.6MB. Free memory was 42.9MB in the beginning and 112.4MB in the end (delta: -69.5MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2025-03-16 18:54:11,377 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.08ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 103.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.81ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 102.4MB in the end (delta: 998.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.07ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 205.88ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 90.6MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5200.23ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 42.9MB in the end (delta: 47.2MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. * Witness Printer took 74.45ms. Allocated memory is still 142.6MB. Free memory was 42.9MB in the beginning and 112.4MB in the end (delta: -69.5MB). Peak memory consumption was 9.0MB. 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: 23]: 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 3 procedures, 21 locations, 27 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 1144 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 987 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 621 IncrementalHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 157 mSDtfsCounter, 621 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 277 SyntacticMatches, 13 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=6, InterpolantAutomatonStates: 83, 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, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 405 NumberOfCodeBlocks, 405 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 1296 SizeOfPredicates, 15 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 240/360 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 RESULT: Ultimate proved your program to be correct! [2025-03-16 18:54:11,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE