./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array19_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/array-patterns/array19_pattern.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 21ab39d122ec2c6e96fa6b8c9d53d6f966068253a8a3d3ba32389613dd7dc54a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:28:29,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:28:29,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:28:29,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:28:29,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:28:29,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:28:29,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:28:29,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:28:29,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:28:29,342 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:28:29,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:28:29,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:28:29,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:28:29,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:28:29,342 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:28:29,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:28:29,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:28:29,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:28:29,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:28:29,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:28:29,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:28:29,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:28:29,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:28:29,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:28:29,343 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:28:29,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:28:29,343 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:28:29,343 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:28:29,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:28:29,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:28:29,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:28:29,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:28:29,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:28:29,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:28:29,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:28:29,344 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:28:29,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:28:29,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:28:29,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:28:29,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:28:29,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:28:29,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:28:29,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:28:29,345 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 -> 21ab39d122ec2c6e96fa6b8c9d53d6f966068253a8a3d3ba32389613dd7dc54a [2025-03-03 09:28:29,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:28:29,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:28:29,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:28:29,560 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:28:29,560 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:28:29,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array19_pattern.c [2025-03-03 09:28:30,710 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2861e45ea/aa25c4b36a7b43cc958ac8cbf98582b0/FLAG59017dd34 [2025-03-03 09:28:30,893 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:28:30,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array19_pattern.c [2025-03-03 09:28:30,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2861e45ea/aa25c4b36a7b43cc958ac8cbf98582b0/FLAG59017dd34 [2025-03-03 09:28:30,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2861e45ea/aa25c4b36a7b43cc958ac8cbf98582b0 [2025-03-03 09:28:30,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:28:30,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:28:30,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:28:30,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:28:30,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:28:30,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:28:30" (1/1) ... [2025-03-03 09:28:30,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e396b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:28:30, skipping insertion in model container [2025-03-03 09:28:30,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:28:30" (1/1) ... [2025-03-03 09:28:30,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:28:31,045 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/array-patterns/array19_pattern.c[1442,1455] [2025-03-03 09:28:31,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:28:31,075 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:28:31,083 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/array-patterns/array19_pattern.c[1442,1455] [2025-03-03 09:28:31,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:28:31,106 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:28:31,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:28:31 WrapperNode [2025-03-03 09:28:31,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:28:31,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:28:31,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:28:31,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:28:31,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:28:31" (1/1) ... [2025-03-03 09:28:31,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:28:31" (1/1) ... [2025-03-03 09:28:31,139 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2025-03-03 09:28:31,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:28:31,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:28:31,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:28:31,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:28:31,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:28:31" (1/1) ... [2025-03-03 09:28:31,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:28:31" (1/1) ... [2025-03-03 09:28:31,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:28:31" (1/1) ... [2025-03-03 09:28:31,160 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-03 09:28:31,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:28:31" (1/1) ... [2025-03-03 09:28:31,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:28:31" (1/1) ... [2025-03-03 09:28:31,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:28:31" (1/1) ... [2025-03-03 09:28:31,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:28:31" (1/1) ... [2025-03-03 09:28:31,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:28:31" (1/1) ... [2025-03-03 09:28:31,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:28:31" (1/1) ... [2025-03-03 09:28:31,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:28:31,171 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:28:31,171 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:28:31,171 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:28:31,175 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:28:31" (1/1) ... [2025-03-03 09:28:31,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:28:31,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:31,209 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-03 09:28:31,211 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-03 09:28:31,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:28:31,228 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 09:28:31,228 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 09:28:31,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:28:31,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:28:31,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:28:31,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:28:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:28:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:28:31,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:28:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:28:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:28:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:28:31,282 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:28:31,283 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:28:31,408 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L46: call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-03-03 09:28:31,421 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 09:28:31,421 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:28:31,428 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:28:31,428 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:28:31,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:28:31 BoogieIcfgContainer [2025-03-03 09:28:31,428 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:28:31,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:28:31,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:28:31,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:28:31,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:28:30" (1/3) ... [2025-03-03 09:28:31,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57693d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:28:31, skipping insertion in model container [2025-03-03 09:28:31,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:28:31" (2/3) ... [2025-03-03 09:28:31,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57693d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:28:31, skipping insertion in model container [2025-03-03 09:28:31,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:28:31" (3/3) ... [2025-03-03 09:28:31,435 INFO L128 eAbstractionObserver]: Analyzing ICFG array19_pattern.c [2025-03-03 09:28:31,445 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:28:31,446 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array19_pattern.c that has 2 procedures, 28 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-03 09:28:31,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:28:31,487 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;@53e5a7f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:28:31,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:28:31,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 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-03 09:28:31,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 09:28:31,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:31,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:31,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:31,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:31,501 INFO L85 PathProgramCache]: Analyzing trace with hash 745305670, now seen corresponding path program 1 times [2025-03-03 09:28:31,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555855885] [2025-03-03 09:28:31,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:28:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:31,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 09:28:31,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 09:28:31,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:28:31,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:28:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:31,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555855885] [2025-03-03 09:28:31,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555855885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:28:31,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:28:31,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:28:31,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021596087] [2025-03-03 09:28:31,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:28:31,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:28:31,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:31,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:28:31,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:28:31,633 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 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 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 09:28:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:31,648 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2025-03-03 09:28:31,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:28:31,650 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-03 09:28:31,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:31,654 INFO L225 Difference]: With dead ends: 53 [2025-03-03 09:28:31,657 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 09:28:31,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:28:31,661 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:31,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:28:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 09:28:31,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-03 09:28:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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-03 09:28:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2025-03-03 09:28:31,688 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 14 [2025-03-03 09:28:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:31,689 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-03-03 09:28:31,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 09:28:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2025-03-03 09:28:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:28:31,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:31,691 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:31,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:28:31,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:31,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:31,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1081978171, now seen corresponding path program 1 times [2025-03-03 09:28:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:31,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65642149] [2025-03-03 09:28:31,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:28:31,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:31,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 09:28:31,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:28:31,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:28:31,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:28:31,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:31,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65642149] [2025-03-03 09:28:31,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65642149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:28:31,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:28:31,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:28:31,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245243769] [2025-03-03 09:28:31,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:28:31,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:28:31,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:31,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:28:31,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:28:31,959 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-03 09:28:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:31,974 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-03-03 09:28:31,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:28:31,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 29 [2025-03-03 09:28:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:31,975 INFO L225 Difference]: With dead ends: 29 [2025-03-03 09:28:31,975 INFO L226 Difference]: Without dead ends: 26 [2025-03-03 09:28:31,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:28:31,976 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:31,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:28:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-03 09:28:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-03 09:28:31,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:28:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-03-03 09:28:31,980 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 29 [2025-03-03 09:28:31,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:31,981 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-03-03 09:28:31,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-03 09:28:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-03-03 09:28:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 09:28:31,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:31,982 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:31,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:28:31,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:31,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:31,982 INFO L85 PathProgramCache]: Analyzing trace with hash 607572799, now seen corresponding path program 1 times [2025-03-03 09:28:31,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:31,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32215484] [2025-03-03 09:28:31,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:28:31,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:32,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 09:28:32,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:28:32,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:28:32,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:28:32,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:32,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32215484] [2025-03-03 09:28:32,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32215484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:28:32,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:28:32,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:28:32,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390198231] [2025-03-03 09:28:32,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:28:32,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:28:32,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:32,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:28:32,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:28:32,101 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-03 09:28:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:32,192 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2025-03-03 09:28:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:28:32,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-03 09:28:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:32,193 INFO L225 Difference]: With dead ends: 52 [2025-03-03 09:28:32,194 INFO L226 Difference]: Without dead ends: 31 [2025-03-03 09:28:32,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:28:32,197 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:32,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 46 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:28:32,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-03 09:28:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-03-03 09:28:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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-03 09:28:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2025-03-03 09:28:32,202 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 32 [2025-03-03 09:28:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:32,202 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-03-03 09:28:32,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-03 09:28:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2025-03-03 09:28:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 09:28:32,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:32,204 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:32,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:28:32,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:32,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:32,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1526663453, now seen corresponding path program 1 times [2025-03-03 09:28:32,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:32,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895437674] [2025-03-03 09:28:32,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:28:32,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:32,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 09:28:32,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 09:28:32,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:28:32,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:28:32,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:32,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895437674] [2025-03-03 09:28:32,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895437674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:28:32,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:28:32,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:28:32,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378180457] [2025-03-03 09:28:32,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:28:32,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:28:32,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:32,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:28:32,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:28:32,303 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-03 09:28:32,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:32,330 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2025-03-03 09:28:32,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:28:32,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 34 [2025-03-03 09:28:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:32,331 INFO L225 Difference]: With dead ends: 52 [2025-03-03 09:28:32,331 INFO L226 Difference]: Without dead ends: 30 [2025-03-03 09:28:32,331 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-03 09:28:32,331 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:32,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 47 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:28:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-03 09:28:32,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-03 09:28:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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-03 09:28:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-03-03 09:28:32,338 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 34 [2025-03-03 09:28:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:32,338 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-03-03 09:28:32,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-03 09:28:32,339 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2025-03-03 09:28:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 09:28:32,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:32,339 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:32,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:28:32,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:32,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:32,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2115544899, now seen corresponding path program 1 times [2025-03-03 09:28:32,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:32,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993009406] [2025-03-03 09:28:32,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:28:32,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:32,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 09:28:32,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:28:32,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:28:32,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:28:32,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796072029] [2025-03-03 09:28:32,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:28:32,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:32,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:32,382 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-03 09:28:32,384 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-03 09:28:32,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 09:28:32,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:28:32,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:28:32,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:32,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-03 09:28:32,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:28:32,620 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 11 treesize of output 7 [2025-03-03 09:28:33,016 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-03-03 09:28:33,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 18 [2025-03-03 09:28:33,107 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 11 treesize of output 7 [2025-03-03 09:28:33,229 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:28:33,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:28:46,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:46,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993009406] [2025-03-03 09:28:46,321 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:28:46,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796072029] [2025-03-03 09:28:46,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796072029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:28:46,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:28:46,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2025-03-03 09:28:46,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044256618] [2025-03-03 09:28:46,321 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 09:28:46,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:28:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:46,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:28:46,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:28:46,324 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:28:46,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:46,900 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2025-03-03 09:28:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 09:28:46,900 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2025-03-03 09:28:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:46,901 INFO L225 Difference]: With dead ends: 79 [2025-03-03 09:28:46,901 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 09:28:46,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=197, Invalid=1209, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 09:28:46,902 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 80 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:46,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 146 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:28:46,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 09:28:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2025-03-03 09:28:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:28:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2025-03-03 09:28:46,909 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 35 [2025-03-03 09:28:46,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:46,909 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2025-03-03 09:28:46,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:28:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2025-03-03 09:28:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 09:28:46,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:46,910 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:46,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:28:47,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:47,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:47,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:47,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1156427159, now seen corresponding path program 2 times [2025-03-03 09:28:47,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:47,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832525661] [2025-03-03 09:28:47,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:28:47,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:47,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-03 09:28:47,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 09:28:47,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:28:47,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:28:47,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:47,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832525661] [2025-03-03 09:28:47,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832525661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:28:47,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123260] [2025-03-03 09:28:47,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:28:47,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:47,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:47,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:28:47,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:28:47,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-03 09:28:47,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 09:28:47,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:28:47,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:47,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:28:47,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:28:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:28:47,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:28:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:28:47,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123260] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:28:47,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:28:47,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-03 09:28:47,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370119966] [2025-03-03 09:28:47,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:28:47,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:28:47,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:47,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:28:47,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:28:47,368 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:28:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:47,498 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2025-03-03 09:28:47,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:28:47,498 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-03-03 09:28:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:47,499 INFO L225 Difference]: With dead ends: 80 [2025-03-03 09:28:47,499 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 09:28:47,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:28:47,500 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:47,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 122 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:28:47,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 09:28:47,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-03-03 09:28:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:28:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2025-03-03 09:28:47,511 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 36 [2025-03-03 09:28:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:47,512 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2025-03-03 09:28:47,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:28:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2025-03-03 09:28:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 09:28:47,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:47,514 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:47,521 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-03 09:28:47,715 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,SelfDestructingSolverStorable5 [2025-03-03 09:28:47,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:47,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:47,715 INFO L85 PathProgramCache]: Analyzing trace with hash 241723975, now seen corresponding path program 3 times [2025-03-03 09:28:47,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:47,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665650149] [2025-03-03 09:28:47,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:28:47,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:47,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-03 09:28:47,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 38 statements. [2025-03-03 09:28:47,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:28:47,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:28:47,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:47,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665650149] [2025-03-03 09:28:47,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665650149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:28:47,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120110748] [2025-03-03 09:28:47,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:28:47,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:47,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:47,816 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-03 09:28:47,818 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-03 09:28:47,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-03 09:28:48,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 38 statements. [2025-03-03 09:28:48,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:28:48,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:48,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:28:48,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:28:48,054 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:28:48,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:28:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:28:48,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120110748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:28:48,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:28:48,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-03 09:28:48,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910826676] [2025-03-03 09:28:48,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:28:48,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:28:48,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:48,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:28:48,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:28:48,100 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:28:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:48,174 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2025-03-03 09:28:48,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:28:48,175 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2025-03-03 09:28:48,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:48,178 INFO L225 Difference]: With dead ends: 109 [2025-03-03 09:28:48,178 INFO L226 Difference]: Without dead ends: 64 [2025-03-03 09:28:48,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:28:48,179 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:48,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 90 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:28:48,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-03 09:28:48,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2025-03-03 09:28:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:28:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2025-03-03 09:28:48,186 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 38 [2025-03-03 09:28:48,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:48,186 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2025-03-03 09:28:48,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:28:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2025-03-03 09:28:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:28:48,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:48,187 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:48,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:28:48,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:48,388 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:48,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:48,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1095536097, now seen corresponding path program 4 times [2025-03-03 09:28:48,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:48,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191546093] [2025-03-03 09:28:48,389 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:28:48,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:48,394 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-03 09:28:48,397 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 39 statements. [2025-03-03 09:28:48,397 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:28:48,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:48,448 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:28:48,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:48,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191546093] [2025-03-03 09:28:48,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191546093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:28:48,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359296832] [2025-03-03 09:28:48,449 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:28:48,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:48,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:48,451 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-03 09:28:48,453 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-03 09:28:48,485 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-03 09:28:48,495 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 39 statements. [2025-03-03 09:28:48,495 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:28:48,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:48,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:28:48,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:28:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:28:48,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:28:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:28:48,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359296832] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:28:48,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:28:48,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 09:28:48,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832315773] [2025-03-03 09:28:48,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:28:48,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:28:48,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:48,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:28:48,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:28:48,591 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:28:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:48,733 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2025-03-03 09:28:48,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:28:48,733 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2025-03-03 09:28:48,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:48,734 INFO L225 Difference]: With dead ends: 94 [2025-03-03 09:28:48,734 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 09:28:48,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:28:48,735 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:48,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 110 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:28:48,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 09:28:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2025-03-03 09:28:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 09:28:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2025-03-03 09:28:48,744 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 39 [2025-03-03 09:28:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:48,745 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2025-03-03 09:28:48,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:28:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2025-03-03 09:28:48,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 09:28:48,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:48,746 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:48,752 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-03 09:28:48,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:48,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:48,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:48,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1624705019, now seen corresponding path program 5 times [2025-03-03 09:28:48,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:48,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310751974] [2025-03-03 09:28:48,947 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:28:48,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:48,954 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 7 equivalence classes. [2025-03-03 09:28:48,960 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 24 of 40 statements. [2025-03-03 09:28:48,961 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:28:48,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 09:28:49,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310751974] [2025-03-03 09:28:49,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310751974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:28:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682777078] [2025-03-03 09:28:49,030 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:28:49,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:49,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:49,032 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-03 09:28:49,034 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-03 09:28:49,065 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 7 equivalence classes. [2025-03-03 09:28:49,095 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 24 of 40 statements. [2025-03-03 09:28:49,095 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:28:49,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:49,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:28:49,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:28:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 09:28:49,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:28:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 09:28:49,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682777078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:28:49,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:28:49,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-03 09:28:49,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943285713] [2025-03-03 09:28:49,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:28:49,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:28:49,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:49,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:28:49,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:28:49,177 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:28:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:49,264 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2025-03-03 09:28:49,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:28:49,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2025-03-03 09:28:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:49,267 INFO L225 Difference]: With dead ends: 117 [2025-03-03 09:28:49,267 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 09:28:49,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:28:49,268 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:49,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:28:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 09:28:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2025-03-03 09:28:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 09:28:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2025-03-03 09:28:49,275 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 40 [2025-03-03 09:28:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:49,275 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2025-03-03 09:28:49,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:28:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2025-03-03 09:28:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 09:28:49,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:49,276 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:49,283 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-03 09:28:49,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:49,477 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:49,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash 964943181, now seen corresponding path program 6 times [2025-03-03 09:28:49,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:49,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141141269] [2025-03-03 09:28:49,477 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:28:49,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:49,483 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 7 equivalence classes. [2025-03-03 09:28:49,511 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 09:28:49,512 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:28:49,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:28:49,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [710451319] [2025-03-03 09:28:49,514 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:28:49,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:49,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:49,516 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-03 09:28:49,518 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-03 09:28:49,548 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 7 equivalence classes. [2025-03-03 09:28:49,827 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 09:28:49,827 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:28:49,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:49,829 WARN L254 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-03 09:28:49,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:28:49,897 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 11 treesize of output 7 [2025-03-03 09:28:49,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20 [2025-03-03 09:28:50,032 INFO L349 Elim1Store]: treesize reduction 34, result has 33.3 percent of original size [2025-03-03 09:28:50,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2025-03-03 09:28:50,103 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2025-03-03 09:28:50,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 49 [2025-03-03 09:29:07,244 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-03-03 09:29:07,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 224 treesize of output 209 [2025-03-03 09:29:21,489 WARN L286 SmtUtils]: Spent 12.86s on a formula simplification. DAG size of input: 392 DAG size of output: 82 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-03 09:29:21,489 INFO L349 Elim1Store]: treesize reduction 1696, result has 13.3 percent of original size [2025-03-03 09:29:21,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 60 case distinctions, treesize of input 238 treesize of output 902