./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum05.i --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/reducercommutativity/rangesum05.i -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 aee69f990ab81a58f1fe8cd275c8a09f43ca6a442f73810f885d3d0c9a85d2b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:32:11,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:32:11,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 13:32:11,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:32:11,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:32:11,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:32:11,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:32:11,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:32:11,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:32:11,941 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:32:11,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:32:11,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:32:11,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:32:11,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:32:11,943 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:32:11,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:32:11,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:32:11,943 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:32:11,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:32:11,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:32:11,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:32:11,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:32:11,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:32:11,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:32:11,944 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:32:11,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:32:11,944 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:32:11,944 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:32:11,944 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:32:11,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:32:11,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:32:11,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:32:11,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:32:11,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:32:11,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:32:11,945 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:32:11,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:32:11,945 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:32:11,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:32:11,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:32:11,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:32:11,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:32:11,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:32:11,946 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 -> aee69f990ab81a58f1fe8cd275c8a09f43ca6a442f73810f885d3d0c9a85d2b3 [2025-03-16 13:32:12,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:32:12,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:32:12,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:32:12,153 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:32:12,154 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:32:12,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum05.i [2025-03-16 13:32:13,229 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21bd5c71/5c72b98205044868b9d6f13922a1629e/FLAG209ad652b [2025-03-16 13:32:13,440 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:32:13,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i [2025-03-16 13:32:13,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21bd5c71/5c72b98205044868b9d6f13922a1629e/FLAG209ad652b [2025-03-16 13:32:13,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21bd5c71/5c72b98205044868b9d6f13922a1629e [2025-03-16 13:32:13,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:32:13,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:32:13,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:32:13,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:32:13,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:32:13,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:32:13" (1/1) ... [2025-03-16 13:32:13,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bbf4115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:13, skipping insertion in model container [2025-03-16 13:32:13,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:32:13" (1/1) ... [2025-03-16 13:32:13,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:32:13,913 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/reducercommutativity/rangesum05.i[1457,1470] [2025-03-16 13:32:13,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:32:13,922 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:32:13,940 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/reducercommutativity/rangesum05.i[1457,1470] [2025-03-16 13:32:13,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:32:13,956 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:32:13,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:13 WrapperNode [2025-03-16 13:32:13,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:32:13,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:32:13,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:32:13,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:32:13,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:13" (1/1) ... [2025-03-16 13:32:13,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:13" (1/1) ... [2025-03-16 13:32:13,981 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2025-03-16 13:32:13,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:32:13,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:32:13,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:32:13,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:32:13,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:13" (1/1) ... [2025-03-16 13:32:13,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:13" (1/1) ... [2025-03-16 13:32:13,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:13" (1/1) ... [2025-03-16 13:32:14,008 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-16 13:32:14,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:13" (1/1) ... [2025-03-16 13:32:14,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:13" (1/1) ... [2025-03-16 13:32:14,013 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:13" (1/1) ... [2025-03-16 13:32:14,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:13" (1/1) ... [2025-03-16 13:32:14,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:13" (1/1) ... [2025-03-16 13:32:14,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:13" (1/1) ... [2025-03-16 13:32:14,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:32:14,018 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:32:14,018 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:32:14,018 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:32:14,019 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:13" (1/1) ... [2025-03-16 13:32:14,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:32:14,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:14,042 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 13:32:14,044 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 13:32:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:32:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:32:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:32:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 13:32:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:32:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:32:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:32:14,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:32:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:32:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:32:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2025-03-16 13:32:14,061 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2025-03-16 13:32:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 13:32:14,111 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:32:14,112 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:32:14,202 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-16 13:32:14,230 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-16 13:32:14,230 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:32:14,236 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:32:14,236 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:32:14,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:32:14 BoogieIcfgContainer [2025-03-16 13:32:14,237 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:32:14,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:32:14,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:32:14,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:32:14,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:32:13" (1/3) ... [2025-03-16 13:32:14,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17093f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:32:14, skipping insertion in model container [2025-03-16 13:32:14,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:13" (2/3) ... [2025-03-16 13:32:14,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17093f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:32:14, skipping insertion in model container [2025-03-16 13:32:14,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:32:14" (3/3) ... [2025-03-16 13:32:14,243 INFO L128 eAbstractionObserver]: Analyzing ICFG rangesum05.i [2025-03-16 13:32:14,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:32:14,253 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rangesum05.i that has 2 procedures, 23 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-16 13:32:14,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:32:14,303 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;@53e8f0ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:32:14,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:32:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 13:32:14,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:14,311 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:14,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:14,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash 590336288, now seen corresponding path program 1 times [2025-03-16 13:32:14,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:14,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448305190] [2025-03-16 13:32:14,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:14,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:14,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 13:32:14,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 13:32:14,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:14,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 13:32:14,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:14,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448305190] [2025-03-16 13:32:14,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448305190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:14,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:32:14,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 13:32:14,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217948818] [2025-03-16 13:32:14,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:14,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:32:14,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:14,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:32:14,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 13:32:14,568 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:32:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:14,584 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2025-03-16 13:32:14,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:32:14,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2025-03-16 13:32:14,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:14,590 INFO L225 Difference]: With dead ends: 45 [2025-03-16 13:32:14,590 INFO L226 Difference]: Without dead ends: 20 [2025-03-16 13:32:14,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 13:32:14,593 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:14,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-16 13:32:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-16 13:32:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2025-03-16 13:32:14,619 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 26 [2025-03-16 13:32:14,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:14,620 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-03-16 13:32:14,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:32:14,620 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2025-03-16 13:32:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 13:32:14,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:14,622 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:14,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 13:32:14,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:14,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:14,624 INFO L85 PathProgramCache]: Analyzing trace with hash -527850959, now seen corresponding path program 1 times [2025-03-16 13:32:14,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:14,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493051390] [2025-03-16 13:32:14,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:14,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:14,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 13:32:14,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 13:32:14,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:14,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 13:32:14,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:14,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493051390] [2025-03-16 13:32:14,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493051390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:14,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219547694] [2025-03-16 13:32:14,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:14,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:14,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:14,751 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 13:32:14,754 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 13:32:14,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 13:32:14,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 13:32:14,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:14,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:14,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 13:32:14,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 13:32:14,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:32:14,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219547694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:14,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 13:32:14,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 13:32:14,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77313506] [2025-03-16 13:32:14,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:14,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:32:14,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:14,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:32:14,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:14,883 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:14,902 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2025-03-16 13:32:14,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:32:14,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-03-16 13:32:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:14,904 INFO L225 Difference]: With dead ends: 39 [2025-03-16 13:32:14,904 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 13:32:14,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:14,905 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:14,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 13:32:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-03-16 13:32:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-16 13:32:14,914 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 27 [2025-03-16 13:32:14,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:14,914 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-16 13:32:14,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-03-16 13:32:14,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 13:32:14,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:14,916 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:14,924 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 13:32:15,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:15,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:15,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:15,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1092725448, now seen corresponding path program 1 times [2025-03-16 13:32:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:15,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385366981] [2025-03-16 13:32:15,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:15,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:15,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 13:32:15,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 13:32:15,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:15,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:15,218 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-16 13:32:15,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:15,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385366981] [2025-03-16 13:32:15,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385366981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:15,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301892972] [2025-03-16 13:32:15,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:15,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:15,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:15,221 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 13:32:15,222 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 13:32:15,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 13:32:15,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 13:32:15,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:15,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:15,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 13:32:15,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 13:32:15,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:32:15,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301892972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:15,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 13:32:15,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 13:32:15,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826173918] [2025-03-16 13:32:15,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:15,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:32:15,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:15,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:32:15,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:15,302 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:15,312 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2025-03-16 13:32:15,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:32:15,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-03-16 13:32:15,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:15,313 INFO L225 Difference]: With dead ends: 37 [2025-03-16 13:32:15,313 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 13:32:15,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:15,314 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:15,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:15,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 13:32:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-16 13:32:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2025-03-16 13:32:15,320 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 36 [2025-03-16 13:32:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:15,321 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-03-16 13:32:15,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2025-03-16 13:32:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 13:32:15,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:15,323 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:15,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 13:32:15,527 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,SelfDestructingSolverStorable2 [2025-03-16 13:32:15,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:15,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash -144785531, now seen corresponding path program 1 times [2025-03-16 13:32:15,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:15,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032574372] [2025-03-16 13:32:15,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:15,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:15,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 13:32:15,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:32:15,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:15,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:15,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:15,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032574372] [2025-03-16 13:32:15,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032574372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:15,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670028576] [2025-03-16 13:32:15,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:15,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:15,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:15,603 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 13:32:15,605 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 13:32:15,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 13:32:15,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:32:15,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:15,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:15,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 13:32:15,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 13:32:15,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:32:15,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670028576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:15,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 13:32:15,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 13:32:15,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865229844] [2025-03-16 13:32:15,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:15,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:32:15,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:15,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:32:15,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:15,688 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:15,700 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2025-03-16 13:32:15,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:32:15,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-16 13:32:15,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:15,701 INFO L225 Difference]: With dead ends: 46 [2025-03-16 13:32:15,701 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 13:32:15,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:15,702 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:15,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 13:32:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-16 13:32:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-16 13:32:15,704 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 37 [2025-03-16 13:32:15,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:15,705 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-16 13:32:15,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:15,705 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-03-16 13:32:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 13:32:15,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:15,705 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:15,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 13:32:15,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:15,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:15,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:15,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1367965278, now seen corresponding path program 1 times [2025-03-16 13:32:15,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:15,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107386209] [2025-03-16 13:32:15,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:15,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:15,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 13:32:15,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:32:15,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:15,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:15,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:15,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107386209] [2025-03-16 13:32:15,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107386209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:15,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177866852] [2025-03-16 13:32:15,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:15,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:15,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:15,950 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 13:32:15,952 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 13:32:15,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 13:32:16,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:32:16,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:16,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:16,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 13:32:16,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:16,040 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:16,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:16,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177866852] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:16,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:16,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-16 13:32:16,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641241575] [2025-03-16 13:32:16,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:16,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 13:32:16,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:16,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 13:32:16,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:32:16,079 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 13:32:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:16,094 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2025-03-16 13:32:16,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:32:16,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 37 [2025-03-16 13:32:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:16,096 INFO L225 Difference]: With dead ends: 54 [2025-03-16 13:32:16,096 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 13:32:16,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:32:16,098 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:16,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 13:32:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-16 13:32:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-03-16 13:32:16,102 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 37 [2025-03-16 13:32:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:16,102 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-03-16 13:32:16,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 13:32:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-03-16 13:32:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 13:32:16,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:16,106 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:16,112 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 13:32:16,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:16,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:16,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:16,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1245446639, now seen corresponding path program 2 times [2025-03-16 13:32:16,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:16,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771260210] [2025-03-16 13:32:16,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:16,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:16,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-16 13:32:16,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 13:32:16,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:16,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:16,371 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 13:32:16,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:16,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771260210] [2025-03-16 13:32:16,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771260210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:16,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663992530] [2025-03-16 13:32:16,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:16,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:16,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:16,374 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 13:32:16,376 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 13:32:16,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-16 13:32:16,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 13:32:16,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:16,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:16,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:32:16,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:16,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:16,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663992530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:16,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:16,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 7] total 9 [2025-03-16 13:32:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651726869] [2025-03-16 13:32:16,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:16,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 13:32:16,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:16,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 13:32:16,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-16 13:32:16,532 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:32:16,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:16,561 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2025-03-16 13:32:16,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 13:32:16,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 40 [2025-03-16 13:32:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:16,563 INFO L225 Difference]: With dead ends: 59 [2025-03-16 13:32:16,563 INFO L226 Difference]: Without dead ends: 35 [2025-03-16 13:32:16,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-16 13:32:16,564 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:16,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 133 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-16 13:32:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2025-03-16 13:32:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-03-16 13:32:16,570 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 40 [2025-03-16 13:32:16,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:16,572 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-03-16 13:32:16,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:32:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2025-03-16 13:32:16,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 13:32:16,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:16,572 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:16,578 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 13:32:16,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:16,773 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:16,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:16,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1845307073, now seen corresponding path program 3 times [2025-03-16 13:32:16,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:16,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3982118] [2025-03-16 13:32:16,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:32:16,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:16,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 6 equivalence classes. [2025-03-16 13:32:16,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 50 statements. [2025-03-16 13:32:16,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-16 13:32:16,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 13:32:16,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:16,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3982118] [2025-03-16 13:32:16,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3982118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:16,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:32:16,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 13:32:16,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545689165] [2025-03-16 13:32:16,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:16,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:32:16,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:16,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:32:16,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:32:16,807 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:32:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:16,822 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2025-03-16 13:32:16,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:32:16,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-03-16 13:32:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:16,826 INFO L225 Difference]: With dead ends: 63 [2025-03-16 13:32:16,826 INFO L226 Difference]: Without dead ends: 37 [2025-03-16 13:32:16,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:32:16,827 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:16,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 59 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-16 13:32:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-03-16 13:32:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-16 13:32:16,831 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 50 [2025-03-16 13:32:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:16,831 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-16 13:32:16,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:32:16,832 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-16 13:32:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 13:32:16,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:16,832 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 6, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:16,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 13:32:16,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:16,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash 189919394, now seen corresponding path program 1 times [2025-03-16 13:32:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:16,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089501608] [2025-03-16 13:32:16,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:16,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 13:32:16,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 13:32:16,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:16,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-03-16 13:32:16,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089501608] [2025-03-16 13:32:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089501608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925911589] [2025-03-16 13:32:16,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:16,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:16,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:16,919 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:16,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 13:32:16,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 13:32:16,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 13:32:16,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:16,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:17,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 13:32:17,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-16 13:32:17,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-16 13:32:17,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925911589] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:17,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:17,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 7 [2025-03-16 13:32:17,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088914770] [2025-03-16 13:32:17,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:17,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 13:32:17,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:17,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 13:32:17,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:32:17,058 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:32:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:17,099 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2025-03-16 13:32:17,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 13:32:17,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2025-03-16 13:32:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:17,101 INFO L225 Difference]: With dead ends: 60 [2025-03-16 13:32:17,101 INFO L226 Difference]: Without dead ends: 36 [2025-03-16 13:32:17,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:32:17,102 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:17,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-16 13:32:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-16 13:32:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-03-16 13:32:17,108 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 59 [2025-03-16 13:32:17,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:17,108 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-03-16 13:32:17,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:32:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-03-16 13:32:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 13:32:17,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:17,108 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:17,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:17,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:17,309 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:17,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:17,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1489167664, now seen corresponding path program 2 times [2025-03-16 13:32:17,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:17,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923256781] [2025-03-16 13:32:17,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:17,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:17,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-16 13:32:17,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 13:32:17,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:17,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-16 13:32:17,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:17,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923256781] [2025-03-16 13:32:17,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923256781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:17,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860986757] [2025-03-16 13:32:17,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:17,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:17,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:17,433 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:17,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 13:32:17,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-16 13:32:17,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 13:32:17,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:17,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:17,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:32:17,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 116 proven. 22 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-03-16 13:32:17,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-03-16 13:32:17,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860986757] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:17,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:17,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 10 [2025-03-16 13:32:17,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793421862] [2025-03-16 13:32:17,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:17,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 13:32:17,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:17,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 13:32:17,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 13:32:17,628 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:32:17,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:17,670 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2025-03-16 13:32:17,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 13:32:17,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2025-03-16 13:32:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:17,671 INFO L225 Difference]: With dead ends: 68 [2025-03-16 13:32:17,672 INFO L226 Difference]: Without dead ends: 40 [2025-03-16 13:32:17,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 13:32:17,673 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:17,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 89 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-16 13:32:17,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-16 13:32:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-03-16 13:32:17,681 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 69 [2025-03-16 13:32:17,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:17,681 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-03-16 13:32:17,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:32:17,681 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-03-16 13:32:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 13:32:17,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:17,681 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:17,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:17,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:17,882 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:17,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:17,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1491475899, now seen corresponding path program 3 times [2025-03-16 13:32:17,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:17,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871742837] [2025-03-16 13:32:17,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:32:17,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:17,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 12 equivalence classes. [2025-03-16 13:32:17,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 79 statements. [2025-03-16 13:32:17,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 13:32:17,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-16 13:32:18,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:18,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871742837] [2025-03-16 13:32:18,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871742837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:18,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005925167] [2025-03-16 13:32:18,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:32:18,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:18,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:18,004 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:18,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 13:32:18,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 12 equivalence classes. [2025-03-16 13:32:18,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 79 statements. [2025-03-16 13:32:18,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 13:32:18,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:18,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 13:32:18,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 180 proven. 6 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-16 13:32:18,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-16 13:32:18,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005925167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:18,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:18,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-03-16 13:32:18,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927230184] [2025-03-16 13:32:18,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:18,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 13:32:18,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:18,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 13:32:18,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:32:18,135 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:32:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:18,146 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-03-16 13:32:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:32:18,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 79 [2025-03-16 13:32:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:18,147 INFO L225 Difference]: With dead ends: 66 [2025-03-16 13:32:18,147 INFO L226 Difference]: Without dead ends: 41 [2025-03-16 13:32:18,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 153 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:32:18,148 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:18,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:18,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-16 13:32:18,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-16 13:32:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-03-16 13:32:18,152 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 79 [2025-03-16 13:32:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:18,152 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-03-16 13:32:18,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:32:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2025-03-16 13:32:18,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 13:32:18,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:18,153 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:18,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:18,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 13:32:18,359 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:18,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:18,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1797719528, now seen corresponding path program 4 times [2025-03-16 13:32:18,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:18,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486539743] [2025-03-16 13:32:18,360 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:32:18,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:18,369 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. [2025-03-16 13:32:18,464 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 13:32:18,466 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:32:18,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 13:32:18,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326938803] [2025-03-16 13:32:18,472 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:32:18,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:18,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:18,474 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:18,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 13:32:18,526 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. [2025-03-16 13:32:18,652 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 13:32:18,653 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:32:18,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 13:32:18,653 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 13:32:18,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 13:32:18,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 13:32:18,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:18,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 13:32:18,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 13:32:18,832 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 13:32:18,832 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 13:32:18,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:19,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:19,036 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2025-03-16 13:32:19,085 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 13:32:19,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 01:32:19 BoogieIcfgContainer [2025-03-16 13:32:19,091 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 13:32:19,091 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 13:32:19,091 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 13:32:19,091 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 13:32:19,092 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:32:14" (3/4) ... [2025-03-16 13:32:19,092 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 13:32:19,140 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 57. [2025-03-16 13:32:19,199 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 13:32:19,199 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 13:32:19,199 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 13:32:19,200 INFO L158 Benchmark]: Toolchain (without parser) took 5419.79ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 87.4MB in the end (delta: 16.8MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2025-03-16 13:32:19,200 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 13:32:19,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.97ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 93.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 13:32:19,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.41ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 13:32:19,200 INFO L158 Benchmark]: Boogie Preprocessor took 34.52ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 13:32:19,201 INFO L158 Benchmark]: IcfgBuilder took 218.60ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 76.6MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 13:32:19,201 INFO L158 Benchmark]: TraceAbstraction took 4852.50ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 96.9MB in the end (delta: -20.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 13:32:19,201 INFO L158 Benchmark]: Witness Printer took 108.29ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 87.4MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 13:32:19,202 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.97ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 93.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.41ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.52ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 218.60ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 76.6MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4852.50ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 96.9MB in the end (delta: -20.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 108.29ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 87.4MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[5]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={3:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}] [L17] COND FALSE !(i < 5) [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=3, ret=-3, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=4, ret=-3, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=1, i=4, ret=-3, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=4, ret=-6, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=5, ret=-6, x={3:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={3:0}, cnt=2, ret=-6, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-3, x={3:0}] [L49] RET, EXPR rangesum(x) VAL [x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp [L52] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=3, ret=-3, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=4, ret=-3, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=1, i=4, ret=-3, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=4, ret=-6, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=5, ret=-6, x={3:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={3:0}, cnt=2, ret=-6, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-3, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [ret=-3, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=-3, ret=-3, temp=-2, x={3:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-3, ret=-3, temp=-2, x={3:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-3, ret=-3, temp=-2, x={3:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-3, ret=-3, temp=-2, x={3:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-3, ret=-3, temp=-2, x={3:0}] [L54] COND FALSE !(i<5 -1) [L57] x[5 -1] = temp [L58] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=3, ret=-3, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=4, ret=-3, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=1, i=4, ret=-3, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=4, ret=-5, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=5, ret=-5, x={3:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={3:0}, cnt=2, ret=-5, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-2, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=-3, ret=-3, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={3:0}] [L61] reach_error() VAL [x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 33 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 678 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 450 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 150 IncrementalHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 228 mSDtfsCounter, 150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 697 GetRequests, 639 SyntacticMatches, 16 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=10, InterpolantAutomatonStates: 54, 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, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1004 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1105 ConstructedInterpolants, 0 QuantifiedInterpolants, 1295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1549 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 2684/3003 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-16 13:32:19,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE