./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/max.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/max.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 97795e7b99ddd869ecccb7f865206a167342b52333873684a94abd35acf6650e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:31:26,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:31:26,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 13:31:26,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:31:26,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:31:26,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:31:26,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:31:26,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:31:26,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:31:26,138 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:31:26,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:31:26,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:31:26,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:31:26,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:31:26,139 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:31:26,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:31:26,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:31:26,140 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:31:26,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:31:26,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:31:26,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:31:26,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:31:26,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:31:26,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:31:26,140 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:31:26,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:31:26,140 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:31:26,141 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:31:26,141 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:31:26,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:31:26,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:31:26,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:31:26,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:31:26,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:31:26,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:31:26,142 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:31:26,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:31:26,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:31:26,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:31:26,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:31:26,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:31:26,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:31:26,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:31:26,142 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 -> 97795e7b99ddd869ecccb7f865206a167342b52333873684a94abd35acf6650e [2025-03-16 13:31:26,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:31:26,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:31:26,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:31:26,353 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:31:26,354 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:31:26,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max.i [2025-03-16 13:31:27,466 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e141670/2d506377411e40dc86758f791caf3162/FLAG3a30405a6 [2025-03-16 13:31:27,708 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:31:27,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i [2025-03-16 13:31:27,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e141670/2d506377411e40dc86758f791caf3162/FLAG3a30405a6 [2025-03-16 13:31:28,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e141670/2d506377411e40dc86758f791caf3162 [2025-03-16 13:31:28,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:31:28,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:31:28,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:31:28,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:31:28,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:31:28,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:31:28" (1/1) ... [2025-03-16 13:31:28,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3773ebaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:28, skipping insertion in model container [2025-03-16 13:31:28,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:31:28" (1/1) ... [2025-03-16 13:31:28,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:31:28,185 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/max.i[1295,1308] [2025-03-16 13:31:28,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:31:28,198 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:31:28,214 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/max.i[1295,1308] [2025-03-16 13:31:28,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:31:28,225 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:31:28,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:28 WrapperNode [2025-03-16 13:31:28,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:31:28,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:31:28,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:31:28,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:31:28,233 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:31:28" (1/1) ... [2025-03-16 13:31:28,239 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:31:28" (1/1) ... [2025-03-16 13:31:28,252 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2025-03-16 13:31:28,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:31:28,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:31:28,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:31:28,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:31:28,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:28" (1/1) ... [2025-03-16 13:31:28,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:28" (1/1) ... [2025-03-16 13:31:28,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:28" (1/1) ... [2025-03-16 13:31:28,277 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 6, 10]. 56 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 4 writes are split as follows [0, 0, 4]. [2025-03-16 13:31:28,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:28" (1/1) ... [2025-03-16 13:31:28,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:28" (1/1) ... [2025-03-16 13:31:28,283 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:28" (1/1) ... [2025-03-16 13:31:28,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:28" (1/1) ... [2025-03-16 13:31:28,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:28" (1/1) ... [2025-03-16 13:31:28,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:28" (1/1) ... [2025-03-16 13:31:28,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:31:28,293 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:31:28,293 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:31:28,293 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:31:28,294 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:28" (1/1) ... [2025-03-16 13:31:28,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:31:28,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:28,320 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:31:28,327 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:31:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:31:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure max [2025-03-16 13:31:28,343 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2025-03-16 13:31:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:31:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:31:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 13:31:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 13:31:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:31:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:31:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 13:31:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:31:28,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:31:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:31:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:31:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 13:31:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 13:31:28,407 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:31:28,409 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:31:28,541 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-16 13:31:28,541 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:31:28,553 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:31:28,555 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:31:28,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:31:28 BoogieIcfgContainer [2025-03-16 13:31:28,555 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:31:28,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:31:28,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:31:28,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:31:28,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:31:28" (1/3) ... [2025-03-16 13:31:28,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8c5ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:31:28, skipping insertion in model container [2025-03-16 13:31:28,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:28" (2/3) ... [2025-03-16 13:31:28,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8c5ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:31:28, skipping insertion in model container [2025-03-16 13:31:28,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:31:28" (3/3) ... [2025-03-16 13:31:28,565 INFO L128 eAbstractionObserver]: Analyzing ICFG max.i [2025-03-16 13:31:28,576 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:31:28,577 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG max.i that has 2 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 13:31:28,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:31:28,630 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;@12da2d4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:31:28,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:31:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.375) 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:31:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 13:31:28,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:28,640 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:28,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:28,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash -512156692, now seen corresponding path program 1 times [2025-03-16 13:31:28,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:28,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757587726] [2025-03-16 13:31:28,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:28,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:28,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 13:31:28,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 13:31:28,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:28,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 13:31:28,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:28,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757587726] [2025-03-16 13:31:28,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757587726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:28,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468597350] [2025-03-16 13:31:28,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:28,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:28,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:28,875 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:31:28,876 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:31:28,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 13:31:28,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 13:31:28,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:28,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:28,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 13:31:28,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 13:31:29,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:31:29,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468597350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:31:29,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 13:31:29,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-03-16 13:31:29,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168785404] [2025-03-16 13:31:29,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:31:29,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:31:29,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:29,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:31:29,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 13:31:29,030 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.375) 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) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:31:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:29,090 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2025-03-16 13:31:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:31:29,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 23 [2025-03-16 13:31:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:29,095 INFO L225 Difference]: With dead ends: 47 [2025-03-16 13:31:29,095 INFO L226 Difference]: Without dead ends: 21 [2025-03-16 13:31:29,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 13:31:29,103 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:29,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 38 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-16 13:31:29,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-16 13:31:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:31:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-16 13:31:29,128 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 23 [2025-03-16 13:31:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:29,129 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-16 13:31:29,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:31:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-16 13:31:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 13:31:29,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:29,131 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:29,137 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:31:29,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 13:31:29,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:29,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:29,336 INFO L85 PathProgramCache]: Analyzing trace with hash -888210243, now seen corresponding path program 1 times [2025-03-16 13:31:29,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:29,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604418404] [2025-03-16 13:31:29,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:29,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:29,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 13:31:29,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 13:31:29,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:29,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 13:31:29,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:29,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604418404] [2025-03-16 13:31:29,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604418404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:31:29,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:31:29,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 13:31:29,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839537183] [2025-03-16 13:31:29,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:31:29,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:31:29,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:29,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:31:29,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:31:29,497 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:31:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:29,535 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-16 13:31:29,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:31:29,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-03-16 13:31:29,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:29,537 INFO L225 Difference]: With dead ends: 32 [2025-03-16 13:31:29,537 INFO L226 Difference]: Without dead ends: 20 [2025-03-16 13:31:29,538 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:31:29,538 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:29,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-16 13:31:29,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-16 13:31:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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:31:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-16 13:31:29,544 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 32 [2025-03-16 13:31:29,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:29,545 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-16 13:31:29,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:31:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-16 13:31:29,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 13:31:29,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:29,548 INFO L218 NwaCegarLoop]: trace histogram [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:31:29,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 13:31:29,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:29,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:29,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2004229965, now seen corresponding path program 1 times [2025-03-16 13:31:29,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:29,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307140383] [2025-03-16 13:31:29,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:29,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:29,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 13:31:29,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 13:31:29,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:29,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 13:31:29,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:29,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307140383] [2025-03-16 13:31:29,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307140383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:29,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817634343] [2025-03-16 13:31:29,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:29,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:29,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:29,656 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:31:29,658 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:31:29,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 13:31:29,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 13:31:29,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:29,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:29,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 13:31:29,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 13:31:29,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 13:31:29,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817634343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:29,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:29,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-03-16 13:31:29,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266112003] [2025-03-16 13:31:29,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:29,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 13:31:29,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:29,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 13:31:29,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-16 13:31:29,870 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 13:31:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:29,929 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2025-03-16 13:31:29,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:31:29,929 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 33 [2025-03-16 13:31:29,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:29,930 INFO L225 Difference]: With dead ends: 42 [2025-03-16 13:31:29,930 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 13:31:29,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-16 13:31:29,931 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:29,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 33 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 13:31:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-03-16 13:31:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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:31:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-03-16 13:31:29,934 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 33 [2025-03-16 13:31:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:29,934 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-16 13:31:29,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 13:31:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-03-16 13:31:29,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 13:31:29,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:29,935 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:29,942 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:31:30,135 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:31:30,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:30,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:30,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1644924074, now seen corresponding path program 2 times [2025-03-16 13:31:30,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:30,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312601676] [2025-03-16 13:31:30,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:31:30,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:30,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-16 13:31:30,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 13:31:30,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:31:30,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 13:31:31,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312601676] [2025-03-16 13:31:31,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312601676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:31,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95438930] [2025-03-16 13:31:31,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:31:31,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:31,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:31,056 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:31:31,058 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:31:31,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-16 13:31:31,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 13:31:31,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:31:31,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:31,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-16 13:31:31,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:31,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2025-03-16 13:31:31,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:31:31,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2025-03-16 13:31:31,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:31:31,502 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-16 13:31:31,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 35 [2025-03-16 13:31:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 45 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 13:31:32,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:32,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95438930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:32,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 13:31:32,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21] total 30 [2025-03-16 13:31:32,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775305024] [2025-03-16 13:31:32,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:32,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 13:31:32,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:32,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 13:31:32,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2025-03-16 13:31:32,404 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 30 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 13:31:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:33,209 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2025-03-16 13:31:33,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-16 13:31:33,209 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2025-03-16 13:31:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:33,211 INFO L225 Difference]: With dead ends: 101 [2025-03-16 13:31:33,211 INFO L226 Difference]: Without dead ends: 67 [2025-03-16 13:31:33,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=264, Invalid=1992, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 13:31:33,213 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 57 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:33,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 161 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 13:31:33,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-16 13:31:33,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2025-03-16 13:31:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-16 13:31:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2025-03-16 13:31:33,228 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 42 [2025-03-16 13:31:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:33,228 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2025-03-16 13:31:33,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 13:31:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2025-03-16 13:31:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 13:31:33,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:33,229 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:33,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 13:31:33,429 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:31:33,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:33,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:33,430 INFO L85 PathProgramCache]: Analyzing trace with hash -393132215, now seen corresponding path program 1 times [2025-03-16 13:31:33,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:33,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314644272] [2025-03-16 13:31:33,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:33,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:33,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 13:31:33,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 13:31:33,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:33,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 13:31:35,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:35,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314644272] [2025-03-16 13:31:35,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314644272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:35,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6235304] [2025-03-16 13:31:35,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:35,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:35,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:35,962 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:31:35,963 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:31:35,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 13:31:36,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 13:31:36,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:36,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:36,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-03-16 13:31:36,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:36,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 33 [2025-03-16 13:31:37,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:31:37,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 83 [2025-03-16 13:31:37,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 13:31:37,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 70 [2025-03-16 13:31:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 3 proven. 70 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:31:37,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:38,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2025-03-16 13:31:38,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2025-03-16 13:31:38,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2025-03-16 13:31:38,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2025-03-16 13:31:38,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 61 [2025-03-16 13:31:39,232 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-03-16 13:31:39,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2025-03-16 13:31:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 13:31:39,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6235304] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:39,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:39,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 24] total 73 [2025-03-16 13:31:39,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055520151] [2025-03-16 13:31:39,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:39,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-16 13:31:39,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:39,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-16 13:31:39,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=4977, Unknown=0, NotChecked=0, Total=5256 [2025-03-16 13:31:39,383 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 73 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 63 states have internal predecessors, (98), 8 states have call successors, (9), 3 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-16 13:31:46,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:46,684 INFO L93 Difference]: Finished difference Result 170 states and 242 transitions. [2025-03-16 13:31:46,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-16 13:31:46,685 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 63 states have internal predecessors, (98), 8 states have call successors, (9), 3 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 42 [2025-03-16 13:31:46,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:46,686 INFO L225 Difference]: With dead ends: 170 [2025-03-16 13:31:46,686 INFO L226 Difference]: Without dead ends: 166 [2025-03-16 13:31:46,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4415 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=907, Invalid=13372, Unknown=1, NotChecked=0, Total=14280 [2025-03-16 13:31:46,690 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 114 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:46,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 350 Invalid, 2175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 13:31:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-16 13:31:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 109. [2025-03-16 13:31:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 94 states have internal predecessors, (121), 10 states have call successors, (10), 3 states have call predecessors, (10), 9 states have return successors, (32), 11 states have call predecessors, (32), 10 states have call successors, (32) [2025-03-16 13:31:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 163 transitions. [2025-03-16 13:31:46,716 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 163 transitions. Word has length 42 [2025-03-16 13:31:46,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:46,717 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 163 transitions. [2025-03-16 13:31:46,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 63 states have internal predecessors, (98), 8 states have call successors, (9), 3 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-16 13:31:46,717 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 163 transitions. [2025-03-16 13:31:46,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 13:31:46,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:46,721 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:46,732 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:31:46,921 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:31:46,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:46,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:46,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1349678120, now seen corresponding path program 2 times [2025-03-16 13:31:46,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:46,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78752389] [2025-03-16 13:31:46,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:31:46,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:46,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-16 13:31:46,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 13:31:46,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:31:46,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 11 proven. 59 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 13:31:47,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:47,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78752389] [2025-03-16 13:31:47,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78752389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:47,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314893509] [2025-03-16 13:31:47,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:31:47,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:47,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:47,886 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:31:47,888 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:31:47,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-16 13:31:47,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 13:31:47,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:31:47,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:47,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-16 13:31:47,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:48,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:31:48,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 20 [2025-03-16 13:31:48,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:31:48,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2025-03-16 13:31:48,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:31:48,407 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-16 13:31:48,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 35 [2025-03-16 13:31:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 13:31:48,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:49,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314893509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:49,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 13:31:49,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2025-03-16 13:31:49,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484865589] [2025-03-16 13:31:49,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:49,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-16 13:31:49,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:49,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-16 13:31:49,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2611, Unknown=0, NotChecked=0, Total=2862 [2025-03-16 13:31:49,386 INFO L87 Difference]: Start difference. First operand 109 states and 163 transitions. Second operand has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 13:31:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:52,724 INFO L93 Difference]: Finished difference Result 429 states and 587 transitions. [2025-03-16 13:31:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-03-16 13:31:52,724 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2025-03-16 13:31:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:52,727 INFO L225 Difference]: With dead ends: 429 [2025-03-16 13:31:52,727 INFO L226 Difference]: Without dead ends: 337 [2025-03-16 13:31:52,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4466 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1308, Invalid=12498, Unknown=0, NotChecked=0, Total=13806 [2025-03-16 13:31:52,734 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 214 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:52,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 346 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 13:31:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-16 13:31:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 201. [2025-03-16 13:31:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 168 states have (on average 1.3452380952380953) internal successors, (226), 178 states have internal predecessors, (226), 15 states have call successors, (15), 7 states have call predecessors, (15), 17 states have return successors, (45), 15 states have call predecessors, (45), 15 states have call successors, (45) [2025-03-16 13:31:52,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 286 transitions. [2025-03-16 13:31:52,788 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 286 transitions. Word has length 42 [2025-03-16 13:31:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:52,789 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 286 transitions. [2025-03-16 13:31:52,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 13:31:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 286 transitions. [2025-03-16 13:31:52,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 13:31:52,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:52,795 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:52,802 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:31:52,995 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:31:52,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:52,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:52,996 INFO L85 PathProgramCache]: Analyzing trace with hash -447273239, now seen corresponding path program 3 times [2025-03-16 13:31:52,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:52,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129394270] [2025-03-16 13:31:52,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:31:52,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:53,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 6 equivalence classes. [2025-03-16 13:31:53,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 13:31:53,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-16 13:31:53,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 47 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 13:31:53,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:53,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129394270] [2025-03-16 13:31:53,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129394270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:53,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192862177] [2025-03-16 13:31:53,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:31:53,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:53,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:53,457 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:31:53,458 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:31:53,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 6 equivalence classes. [2025-03-16 13:31:53,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 13:31:53,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-16 13:31:53,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:53,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-16 13:31:53,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:53,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-16 13:31:53,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 13:31:53,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2025-03-16 13:32:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 40 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 13:32:09,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:10,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192862177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:10,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 13:32:10,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2025-03-16 13:32:10,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007904643] [2025-03-16 13:32:10,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:10,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 13:32:10,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:10,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 13:32:10,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=884, Unknown=4, NotChecked=0, Total=992 [2025-03-16 13:32:10,036 INFO L87 Difference]: Start difference. First operand 201 states and 286 transitions. Second operand has 31 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 13:32:14,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:32:18,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:32:26,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:32:34,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:32:42,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:32:46,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:32:50,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:32:55,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:32:59,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:33:03,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]