./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array28_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/array28_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 8b49bb3ea989868d96c18ff859c95dc74ebb805f64994c11617c2c5b61c8e87f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:29:40,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:29:40,173 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:29:40,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:29:40,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:29:40,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:29:40,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:29:40,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:29:40,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:29:40,199 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:29:40,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:29:40,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:29:40,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:29:40,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:29:40,200 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:29:40,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:29:40,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:29:40,200 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:29:40,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:29:40,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:29:40,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:29:40,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:29:40,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:29:40,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:29:40,200 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:29:40,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:29:40,200 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:29:40,200 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:29:40,201 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:29:40,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:29:40,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:29:40,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:29:40,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:29:40,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:29:40,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:29:40,201 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:29:40,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:29:40,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:29:40,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:29:40,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:29:40,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:29:40,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:29:40,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:29:40,201 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 -> 8b49bb3ea989868d96c18ff859c95dc74ebb805f64994c11617c2c5b61c8e87f [2025-03-03 09:29:40,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:29:40,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:29:40,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:29:40,439 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:29:40,439 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:29:40,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array28_pattern.c [2025-03-03 09:29:41,528 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c1f499b/d2cd8128fd7548d199097f5e64688049/FLAGd385a9a3c [2025-03-03 09:29:41,735 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:29:41,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array28_pattern.c [2025-03-03 09:29:41,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c1f499b/d2cd8128fd7548d199097f5e64688049/FLAGd385a9a3c [2025-03-03 09:29:42,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c1f499b/d2cd8128fd7548d199097f5e64688049 [2025-03-03 09:29:42,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:29:42,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:29:42,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:29:42,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:29:42,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:29:42,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:29:42" (1/1) ... [2025-03-03 09:29:42,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f0c4243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:42, skipping insertion in model container [2025-03-03 09:29:42,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:29:42" (1/1) ... [2025-03-03 09:29:42,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:29:42,206 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/array28_pattern.c[1246,1259] [2025-03-03 09:29:42,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:29:42,226 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:29:42,234 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/array28_pattern.c[1246,1259] [2025-03-03 09:29:42,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:29:42,252 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:29:42,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:42 WrapperNode [2025-03-03 09:29:42,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:29:42,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:29:42,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:29:42,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:29:42,259 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:29:42" (1/1) ... [2025-03-03 09:29:42,263 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:29:42" (1/1) ... [2025-03-03 09:29:42,273 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-03-03 09:29:42,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:29:42,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:29:42,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:29:42,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:29:42,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:42" (1/1) ... [2025-03-03 09:29:42,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:42" (1/1) ... [2025-03-03 09:29:42,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:42" (1/1) ... [2025-03-03 09:29:42,285 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 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:29:42,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:42" (1/1) ... [2025-03-03 09:29:42,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:42" (1/1) ... [2025-03-03 09:29:42,288 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:42" (1/1) ... [2025-03-03 09:29:42,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:42" (1/1) ... [2025-03-03 09:29:42,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:42" (1/1) ... [2025-03-03 09:29:42,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:42" (1/1) ... [2025-03-03 09:29:42,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:29:42,291 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:29:42,291 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:29:42,291 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:29:42,291 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:42" (1/1) ... [2025-03-03 09:29:42,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:29:42,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:42,311 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:29:42,312 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:29:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:29:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:29:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:29:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:29:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:29:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:29:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:29:42,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:29:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:29:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:29:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:29:42,368 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:29:42,369 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:29:42,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: 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:29:42,469 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 09:29:42,470 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:29:42,475 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:29:42,475 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:29:42,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:29:42 BoogieIcfgContainer [2025-03-03 09:29:42,475 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:29:42,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:29:42,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:29:42,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:29:42,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:29:42" (1/3) ... [2025-03-03 09:29:42,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a6aa4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:29:42, skipping insertion in model container [2025-03-03 09:29:42,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:42" (2/3) ... [2025-03-03 09:29:42,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a6aa4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:29:42, skipping insertion in model container [2025-03-03 09:29:42,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:29:42" (3/3) ... [2025-03-03 09:29:42,481 INFO L128 eAbstractionObserver]: Analyzing ICFG array28_pattern.c [2025-03-03 09:29:42,490 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:29:42,491 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array28_pattern.c that has 1 procedures, 18 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 09:29:42,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:29:42,535 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;@648f87b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:29:42,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:29:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:42,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 09:29:42,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:42,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:42,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:42,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash -712016550, now seen corresponding path program 1 times [2025-03-03 09:29:42,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:42,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65840736] [2025-03-03 09:29:42,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:42,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:42,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 09:29:42,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 09:29:42,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:42,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:42,645 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:29:42,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:42,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65840736] [2025-03-03 09:29:42,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65840736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:42,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:42,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:29:42,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937591611] [2025-03-03 09:29:42,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:42,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:29:42,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:42,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:29:42,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:29:42,666 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:42,674 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2025-03-03 09:29:42,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:29:42,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 09:29:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:42,680 INFO L225 Difference]: With dead ends: 33 [2025-03-03 09:29:42,680 INFO L226 Difference]: Without dead ends: 14 [2025-03-03 09:29:42,682 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:29:42,685 INFO L435 NwaCegarLoop]: 23 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, 23 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:29:42,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:42,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-03 09:29:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-03 09:29:42,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2025-03-03 09:29:42,711 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 8 [2025-03-03 09:29:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:42,711 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-03-03 09:29:42,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2025-03-03 09:29:42,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 09:29:42,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:42,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:42,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:29:42,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:42,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:42,714 INFO L85 PathProgramCache]: Analyzing trace with hash -683387399, now seen corresponding path program 1 times [2025-03-03 09:29:42,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:42,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995352355] [2025-03-03 09:29:42,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:42,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 09:29:42,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 09:29:42,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:42,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:42,843 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:29:42,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:42,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995352355] [2025-03-03 09:29:42,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995352355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:42,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:42,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:29:42,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878605638] [2025-03-03 09:29:42,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:42,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:29:42,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:42,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:29:42,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:42,848 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:42,864 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2025-03-03 09:29:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:29:42,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 09:29:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:42,865 INFO L225 Difference]: With dead ends: 19 [2025-03-03 09:29:42,865 INFO L226 Difference]: Without dead ends: 16 [2025-03-03 09:29:42,865 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:29:42,866 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 39 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:29:42,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-03 09:29:42,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-03 09:29:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2025-03-03 09:29:42,869 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 8 [2025-03-03 09:29:42,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:42,869 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-03 09:29:42,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2025-03-03 09:29:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 09:29:42,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:42,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:42,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:29:42,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:42,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:42,871 INFO L85 PathProgramCache]: Analyzing trace with hash -559311989, now seen corresponding path program 1 times [2025-03-03 09:29:42,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:42,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102462166] [2025-03-03 09:29:42,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:42,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:42,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 09:29:42,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 09:29:42,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:42,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:29:42,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:42,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102462166] [2025-03-03 09:29:42,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102462166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:42,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:42,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:29:42,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178062602] [2025-03-03 09:29:42,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:42,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:29:42,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:42,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:29:42,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:42,995 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:43,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:43,041 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2025-03-03 09:29:43,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:29:43,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-03 09:29:43,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:43,042 INFO L225 Difference]: With dead ends: 32 [2025-03-03 09:29:43,043 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 09:29:43,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:29:43,044 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:43,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 16 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:43,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 09:29:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2025-03-03 09:29:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2025-03-03 09:29:43,048 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 11 [2025-03-03 09:29:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:43,048 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-03-03 09:29:43,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2025-03-03 09:29:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 09:29:43,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:43,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:43,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:29:43,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:43,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:43,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1177784718, now seen corresponding path program 1 times [2025-03-03 09:29:43,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:43,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094140419] [2025-03-03 09:29:43,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:43,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:43,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 09:29:43,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 09:29:43,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:43,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:29:43,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:43,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094140419] [2025-03-03 09:29:43,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094140419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:43,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:43,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:29:43,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811952954] [2025-03-03 09:29:43,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:43,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:29:43,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:43,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:29:43,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:43,132 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:43,202 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2025-03-03 09:29:43,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:29:43,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-03 09:29:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:43,203 INFO L225 Difference]: With dead ends: 38 [2025-03-03 09:29:43,203 INFO L226 Difference]: Without dead ends: 26 [2025-03-03 09:29:43,203 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:29:43,203 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:43,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 17 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-03 09:29:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2025-03-03 09:29:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:43,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-03 09:29:43,209 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2025-03-03 09:29:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:43,210 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-03 09:29:43,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-03-03 09:29:43,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:29:43,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:43,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:43,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:29:43,211 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:43,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:43,211 INFO L85 PathProgramCache]: Analyzing trace with hash 980213806, now seen corresponding path program 1 times [2025-03-03 09:29:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:43,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185280667] [2025-03-03 09:29:43,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:43,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:43,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:29:43,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:29:43,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:43,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:29:43,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805252265] [2025-03-03 09:29:43,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:43,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:43,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:43,243 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:29:43,244 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:29:43,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:29:43,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:29:43,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:43,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:43,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 09:29:43,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:43,361 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:29:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:29:43,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:43,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-03 09:29:43,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2025-03-03 09:29:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:29:43,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:43,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185280667] [2025-03-03 09:29:43,546 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:29:43,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805252265] [2025-03-03 09:29:43,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805252265] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:43,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:29:43,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2025-03-03 09:29:43,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053454123] [2025-03-03 09:29:43,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:43,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:29:43,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:43,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:29:43,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:29:43,549 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:43,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:43,701 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2025-03-03 09:29:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:29:43,702 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 09:29:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:43,703 INFO L225 Difference]: With dead ends: 40 [2025-03-03 09:29:43,703 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 09:29:43,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:29:43,704 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:43,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 60 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:43,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 09:29:43,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2025-03-03 09:29:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2025-03-03 09:29:43,708 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 17 [2025-03-03 09:29:43,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:43,708 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2025-03-03 09:29:43,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2025-03-03 09:29:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 09:29:43,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:43,709 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:43,715 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:29:43,910 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:29:43,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:43,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:43,911 INFO L85 PathProgramCache]: Analyzing trace with hash 322812184, now seen corresponding path program 2 times [2025-03-03 09:29:43,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:43,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384370406] [2025-03-03 09:29:43,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:29:43,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:43,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-03 09:29:43,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:29:43,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:29:43,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:29:44,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384370406] [2025-03-03 09:29:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384370406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:44,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728931463] [2025-03-03 09:29:44,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:29:44,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:44,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:44,008 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:29:44,010 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:29:44,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-03 09:29:44,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:29:44,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:29:44,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:44,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:29:44,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:44,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:29:44,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:29:44,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728931463] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:44,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:44,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-03 09:29:44,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185141933] [2025-03-03 09:29:44,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:44,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:29:44,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:44,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:29:44,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:29:44,160 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:44,370 INFO L93 Difference]: Finished difference Result 121 states and 192 transitions. [2025-03-03 09:29:44,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 09:29:44,371 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-03 09:29:44,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:44,371 INFO L225 Difference]: With dead ends: 121 [2025-03-03 09:29:44,372 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 09:29:44,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:29:44,372 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 83 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:44,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 32 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:44,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 09:29:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 78. [2025-03-03 09:29:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.5714285714285714) internal successors, (121), 77 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2025-03-03 09:29:44,388 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 18 [2025-03-03 09:29:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:44,388 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2025-03-03 09:29:44,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2025-03-03 09:29:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 09:29:44,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:44,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:44,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 09:29:44,590 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:29:44,590 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:44,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:44,591 INFO L85 PathProgramCache]: Analyzing trace with hash 156557622, now seen corresponding path program 3 times [2025-03-03 09:29:44,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:44,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076166159] [2025-03-03 09:29:44,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:29:44,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:44,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-03-03 09:29:44,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:29:44,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:29:44,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:29:44,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:44,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076166159] [2025-03-03 09:29:44,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076166159] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:44,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946005366] [2025-03-03 09:29:44,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:29:44,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:44,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:44,674 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:29:44,676 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:29:44,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-03-03 09:29:44,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:29:44,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:29:44,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:44,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:29:44,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:29:44,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:29:44,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946005366] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:44,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:44,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 09:29:44,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896728266] [2025-03-03 09:29:44,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:44,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:29:44,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:44,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:29:44,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:29:44,791 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:44,856 INFO L93 Difference]: Finished difference Result 123 states and 190 transitions. [2025-03-03 09:29:44,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:29:44,857 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-03 09:29:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:44,857 INFO L225 Difference]: With dead ends: 123 [2025-03-03 09:29:44,858 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 09:29:44,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:29:44,858 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:44,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 26 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 09:29:44,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 79. [2025-03-03 09:29:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 78 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2025-03-03 09:29:44,868 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 20 [2025-03-03 09:29:44,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:44,868 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2025-03-03 09:29:44,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2025-03-03 09:29:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 09:29:44,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:44,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:44,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:29:45,071 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:29:45,071 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:45,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:45,072 INFO L85 PathProgramCache]: Analyzing trace with hash -735074571, now seen corresponding path program 1 times [2025-03-03 09:29:45,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:45,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078341953] [2025-03-03 09:29:45,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:45,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:45,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 09:29:45,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:29:45,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:45,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:29:45,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:45,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078341953] [2025-03-03 09:29:45,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078341953] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:45,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469295976] [2025-03-03 09:29:45,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:45,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:45,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:45,142 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:29:45,144 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:29:45,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 09:29:45,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:29:45,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:45,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:45,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:29:45,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:29:45,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:29:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469295976] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:45,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:45,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-03 09:29:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214856021] [2025-03-03 09:29:45,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:45,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:29:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:45,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:29:45,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:29:45,247 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:45,368 INFO L93 Difference]: Finished difference Result 164 states and 255 transitions. [2025-03-03 09:29:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 09:29:45,369 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-03 09:29:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:45,370 INFO L225 Difference]: With dead ends: 164 [2025-03-03 09:29:45,370 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 09:29:45,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:29:45,370 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 60 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:45,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 28 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 09:29:45,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 64. [2025-03-03 09:29:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:45,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2025-03-03 09:29:45,381 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 22 [2025-03-03 09:29:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:45,381 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2025-03-03 09:29:45,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2025-03-03 09:29:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 09:29:45,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:45,382 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:45,387 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:29:45,582 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:29:45,582 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:45,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:45,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2123497080, now seen corresponding path program 1 times [2025-03-03 09:29:45,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:45,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770940825] [2025-03-03 09:29:45,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:45,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 09:29:45,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:29:45,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:45,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:45,646 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:29:45,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:45,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770940825] [2025-03-03 09:29:45,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770940825] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:45,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602514199] [2025-03-03 09:29:45,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:45,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:45,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:45,648 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:29:45,650 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:29:45,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 09:29:45,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:29:45,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:45,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:45,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:29:45,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:29:45,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:29:45,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602514199] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:45,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:45,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 09:29:45,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436118829] [2025-03-03 09:29:45,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:45,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:29:45,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:45,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:29:45,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:29:45,785 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:45,907 INFO L93 Difference]: Finished difference Result 84 states and 112 transitions. [2025-03-03 09:29:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:29:45,908 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-03 09:29:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:45,908 INFO L225 Difference]: With dead ends: 84 [2025-03-03 09:29:45,908 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 09:29:45,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:29:45,909 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:45,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 22 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:45,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 09:29:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2025-03-03 09:29:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2025-03-03 09:29:45,913 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 26 [2025-03-03 09:29:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:45,914 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2025-03-03 09:29:45,914 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2025-03-03 09:29:45,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:29:45,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:45,914 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:45,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 09:29:46,119 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:29:46,119 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:46,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1328903663, now seen corresponding path program 2 times [2025-03-03 09:29:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:46,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860267451] [2025-03-03 09:29:46,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:29:46,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:46,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:29:46,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:29:46,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:29:46,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:29:46,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:46,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860267451] [2025-03-03 09:29:46,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860267451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:46,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355950627] [2025-03-03 09:29:46,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:29:46,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:46,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:46,213 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:29:46,215 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:29:46,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:29:46,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:29:46,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:29:46,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:46,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 09:29:46,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:29:46,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:29:46,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355950627] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:46,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:46,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2025-03-03 09:29:46,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041922872] [2025-03-03 09:29:46,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:46,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:29:46,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:46,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:29:46,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:29:46,366 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:46,744 INFO L93 Difference]: Finished difference Result 138 states and 201 transitions. [2025-03-03 09:29:46,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 09:29:46,744 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-03 09:29:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:46,746 INFO L225 Difference]: With dead ends: 138 [2025-03-03 09:29:46,746 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 09:29:46,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 09:29:46,747 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 79 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:46,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 31 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:46,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 09:29:46,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 41. [2025-03-03 09:29:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2025-03-03 09:29:46,752 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 31 [2025-03-03 09:29:46,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:46,752 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2025-03-03 09:29:46,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:29:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2025-03-03 09:29:46,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 09:29:46,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:46,756 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:46,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 09:29:46,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:46,957 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:46,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:46,957 INFO L85 PathProgramCache]: Analyzing trace with hash -720288844, now seen corresponding path program 3 times [2025-03-03 09:29:46,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:46,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512324319] [2025-03-03 09:29:46,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:29:46,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:46,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 6 equivalence classes. [2025-03-03 09:29:46,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:29:46,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 09:29:46,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:29:46,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [125973018] [2025-03-03 09:29:46,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:29:46,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:46,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:46,994 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:29:46,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:29:47,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 6 equivalence classes. [2025-03-03 09:29:47,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 33 of 35 statements. [2025-03-03 09:29:47,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:29:47,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:47,139 WARN L254 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-03 09:29:47,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:47,190 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:29:47,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2025-03-03 09:29:47,335 INFO L349 Elim1Store]: treesize reduction 36, result has 46.3 percent of original size [2025-03-03 09:29:47,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2025-03-03 09:29:47,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:47,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:47,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:47,582 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-03 09:29:47,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 69 [2025-03-03 09:29:48,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:48,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:48,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:48,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:48,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:48,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:48,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:48,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:48,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:48,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:48,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:48,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 50 [2025-03-03 09:29:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:29:48,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:49,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2025-03-03 09:29:49,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:49,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 494 treesize of output 470 [2025-03-03 09:29:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:29:49,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:49,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512324319] [2025-03-03 09:29:49,246 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:29:49,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125973018] [2025-03-03 09:29:49,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125973018] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:49,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:29:49,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2025-03-03 09:29:49,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70243393] [2025-03-03 09:29:49,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:49,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 09:29:49,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:49,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 09:29:49,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1600, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 09:29:49,248 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 44 states, 44 states have (on average 1.5) internal successors, (66), 44 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:37,938 INFO L93 Difference]: Finished difference Result 292 states and 401 transitions. [2025-03-03 09:30:37,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2025-03-03 09:30:37,939 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.5) internal successors, (66), 44 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-03 09:30:37,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:37,940 INFO L225 Difference]: With dead ends: 292 [2025-03-03 09:30:37,940 INFO L226 Difference]: Without dead ends: 257 [2025-03-03 09:30:37,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11176 ImplicationChecksByTransitivity, 48.0s TimeCoverageRelationStatistics Valid=4882, Invalid=24530, Unknown=0, NotChecked=0, Total=29412 [2025-03-03 09:30:37,948 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 231 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:37,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 83 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 09:30:37,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-03 09:30:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 135. [2025-03-03 09:30:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.3582089552238805) internal successors, (182), 134 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 182 transitions. [2025-03-03 09:30:37,976 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 182 transitions. Word has length 35 [2025-03-03 09:30:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:37,976 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 182 transitions. [2025-03-03 09:30:37,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.5) internal successors, (66), 44 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 182 transitions. [2025-03-03 09:30:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 09:30:37,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:37,977 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:37,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:30:38,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:38,178 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:38,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash 188962672, now seen corresponding path program 4 times [2025-03-03 09:30:38,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:38,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499441363] [2025-03-03 09:30:38,178 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:30:38,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:38,187 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-03 09:30:38,191 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 37 statements. [2025-03-03 09:30:38,192 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:30:38,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:30:38,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:38,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499441363] [2025-03-03 09:30:38,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499441363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:30:38,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55986000] [2025-03-03 09:30:38,271 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:30:38,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:38,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:38,273 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:30:38,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:30:38,308 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-03 09:30:38,319 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 37 statements. [2025-03-03 09:30:38,319 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:30:38,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:38,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:30:38,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:30:38,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:30:38,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55986000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:30:38,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:30:38,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-03 09:30:38,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885834447] [2025-03-03 09:30:38,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:38,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:30:38,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:38,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:30:38,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:30:38,402 INFO L87 Difference]: Start difference. First operand 135 states and 182 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:38,499 INFO L93 Difference]: Finished difference Result 323 states and 432 transitions. [2025-03-03 09:30:38,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:30:38,499 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 09:30:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:38,500 INFO L225 Difference]: With dead ends: 323 [2025-03-03 09:30:38,500 INFO L226 Difference]: Without dead ends: 207 [2025-03-03 09:30:38,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:30:38,501 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:38,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 29 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:30:38,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-03 09:30:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 172. [2025-03-03 09:30:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.3099415204678362) internal successors, (224), 171 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2025-03-03 09:30:38,536 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 37 [2025-03-03 09:30:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:38,536 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2025-03-03 09:30:38,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2025-03-03 09:30:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:30:38,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:38,537 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:38,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 09:30:38,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:30:38,741 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:38,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1148258710, now seen corresponding path program 5 times [2025-03-03 09:30:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:38,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405013319] [2025-03-03 09:30:38,741 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:30:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:38,747 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 7 equivalence classes. [2025-03-03 09:30:38,760 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:30:38,760 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-03 09:30:38,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-03 09:30:38,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:38,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405013319] [2025-03-03 09:30:38,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405013319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:30:38,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755381085] [2025-03-03 09:30:38,839 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:30:38,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:38,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:38,843 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:30:38,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:30:38,877 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 7 equivalence classes. [2025-03-03 09:30:38,934 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:30:38,934 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-03 09:30:38,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:38,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:30:38,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:30:39,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 49 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:30:39,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755381085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:30:39,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:30:39,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 23 [2025-03-03 09:30:39,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533181009] [2025-03-03 09:30:39,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:39,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:30:39,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:39,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:30:39,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:30:39,167 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:39,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:39,674 INFO L93 Difference]: Finished difference Result 497 states and 674 transitions. [2025-03-03 09:30:39,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-03 09:30:39,674 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 09:30:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:39,675 INFO L225 Difference]: With dead ends: 497 [2025-03-03 09:30:39,675 INFO L226 Difference]: Without dead ends: 333 [2025-03-03 09:30:39,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=804, Invalid=2058, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 09:30:39,677 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 141 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:39,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 45 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:30:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-03 09:30:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 254. [2025-03-03 09:30:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.316205533596838) internal successors, (333), 253 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 333 transitions. [2025-03-03 09:30:39,724 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 333 transitions. Word has length 39 [2025-03-03 09:30:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:39,724 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 333 transitions. [2025-03-03 09:30:39,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 333 transitions. [2025-03-03 09:30:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 09:30:39,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:39,725 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:39,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:30:39,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:30:39,929 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:39,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:39,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1294634237, now seen corresponding path program 6 times [2025-03-03 09:30:39,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:39,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991751443] [2025-03-03 09:30:39,929 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:30:39,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:39,935 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 6 equivalence classes. [2025-03-03 09:30:39,942 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 42 statements. [2025-03-03 09:30:39,942 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 09:30:39,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 09:30:39,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:39,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991751443] [2025-03-03 09:30:39,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991751443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:30:39,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294729085] [2025-03-03 09:30:39,998 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:30:39,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:39,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:40,000 INFO L229 MonitoredProcess]: Starting monitored process 11 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:30:40,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:30:40,034 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 6 equivalence classes. [2025-03-03 09:30:40,053 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 42 statements. [2025-03-03 09:30:40,053 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 09:30:40,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:40,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 09:30:40,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 32 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 09:30:40,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 32 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 09:30:40,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294729085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:30:40,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:30:40,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 09:30:40,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019291461] [2025-03-03 09:30:40,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:40,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:30:40,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:40,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:30:40,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:30:40,119 INFO L87 Difference]: Start difference. First operand 254 states and 333 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:40,214 INFO L93 Difference]: Finished difference Result 449 states and 601 transitions. [2025-03-03 09:30:40,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:30:40,215 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-03 09:30:40,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:40,216 INFO L225 Difference]: With dead ends: 449 [2025-03-03 09:30:40,216 INFO L226 Difference]: Without dead ends: 209 [2025-03-03 09:30:40,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:30:40,216 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 42 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:40,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 18 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:30:40,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-03 09:30:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 186. [2025-03-03 09:30:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.2378378378378379) internal successors, (229), 185 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 229 transitions. [2025-03-03 09:30:40,257 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 229 transitions. Word has length 42 [2025-03-03 09:30:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:40,257 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 229 transitions. [2025-03-03 09:30:40,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 229 transitions. [2025-03-03 09:30:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:30:40,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:40,258 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:40,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 09:30:40,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 09:30:40,458 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:40,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:40,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1613531307, now seen corresponding path program 7 times [2025-03-03 09:30:40,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:40,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358059974] [2025-03-03 09:30:40,459 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:30:40,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:40,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:30:40,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:30:40,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:30:40,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 3 proven. 60 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 09:30:40,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:40,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358059974] [2025-03-03 09:30:40,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358059974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:30:40,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824485811] [2025-03-03 09:30:40,582 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:30:40,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:40,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:40,584 INFO L229 MonitoredProcess]: Starting monitored process 12 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:30:40,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:30:40,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:30:40,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:30:40,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:30:40,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:40,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:30:40,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-03 09:30:40,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-03 09:30:40,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824485811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:30:40,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:30:40,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2025-03-03 09:30:40,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246508295] [2025-03-03 09:30:40,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:40,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:30:40,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:40,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:30:40,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:30:40,743 INFO L87 Difference]: Start difference. First operand 186 states and 229 transitions. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:41,004 INFO L93 Difference]: Finished difference Result 262 states and 326 transitions. [2025-03-03 09:30:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 09:30:41,004 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-03 09:30:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:41,005 INFO L225 Difference]: With dead ends: 262 [2025-03-03 09:30:41,005 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 09:30:41,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 09:30:41,006 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:41,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 30 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:30:41,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 09:30:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2025-03-03 09:30:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.162162162162162) internal successors, (129), 111 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:41,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2025-03-03 09:30:41,026 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 129 transitions. Word has length 44 [2025-03-03 09:30:41,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:41,027 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 129 transitions. [2025-03-03 09:30:41,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2025-03-03 09:30:41,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 09:30:41,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:41,027 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 6, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:41,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 09:30:41,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:30:41,228 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:41,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:41,228 INFO L85 PathProgramCache]: Analyzing trace with hash -240461423, now seen corresponding path program 8 times [2025-03-03 09:30:41,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:41,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185510641] [2025-03-03 09:30:41,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:30:41,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:41,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-03 09:30:41,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:30:41,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:30:41,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 15 proven. 71 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-03 09:30:41,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:41,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185510641] [2025-03-03 09:30:41,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185510641] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:30:41,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948973339] [2025-03-03 09:30:41,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:30:41,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:41,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:41,339 INFO L229 MonitoredProcess]: Starting monitored process 13 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:30:41,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:30:41,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-03 09:30:41,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:30:41,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:30:41,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:41,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:30:41,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 20 proven. 66 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-03 09:30:41,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 20 proven. 66 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-03 09:30:41,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948973339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:30:41,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:30:41,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-03 09:30:41,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88324745] [2025-03-03 09:30:41,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:41,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:30:41,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:41,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:30:41,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:30:41,551 INFO L87 Difference]: Start difference. First operand 112 states and 129 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:41,699 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2025-03-03 09:30:41,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:30:41,699 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-03 09:30:41,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:41,700 INFO L225 Difference]: With dead ends: 129 [2025-03-03 09:30:41,700 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 09:30:41,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:30:41,701 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 39 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:41,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 28 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:30:41,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 09:30:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 81. [2025-03-03 09:30:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.15) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2025-03-03 09:30:41,717 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 55 [2025-03-03 09:30:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:41,717 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2025-03-03 09:30:41,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2025-03-03 09:30:41,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:30:41,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:41,718 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 6, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:41,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 09:30:41,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 09:30:41,918 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:41,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:41,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1741613581, now seen corresponding path program 9 times [2025-03-03 09:30:41,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:41,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141351656] [2025-03-03 09:30:41,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:30:41,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:41,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 9 equivalence classes. [2025-03-03 09:30:41,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 44 of 57 statements. [2025-03-03 09:30:41,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 09:30:41,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-03-03 09:30:42,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:42,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141351656] [2025-03-03 09:30:42,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141351656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:30:42,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955193345] [2025-03-03 09:30:42,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:30:42,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:42,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:42,014 INFO L229 MonitoredProcess]: Starting monitored process 14 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:30:42,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:30:42,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 9 equivalence classes. [2025-03-03 09:30:42,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 44 of 57 statements. [2025-03-03 09:30:42,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 09:30:42,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:42,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:30:42,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-03-03 09:30:42,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:42,375 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-03-03 09:30:42,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955193345] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:30:42,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:30:42,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-03 09:30:42,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801538100] [2025-03-03 09:30:42,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:42,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 09:30:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:42,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 09:30:42,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:30:42,376 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:42,578 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2025-03-03 09:30:42,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 09:30:42,578 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-03 09:30:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:42,579 INFO L225 Difference]: With dead ends: 140 [2025-03-03 09:30:42,579 INFO L226 Difference]: Without dead ends: 137 [2025-03-03 09:30:42,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=277, Invalid=779, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 09:30:42,580 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 109 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:42,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 47 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:30:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-03 09:30:42,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 88. [2025-03-03 09:30:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.160919540229885) internal successors, (101), 87 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2025-03-03 09:30:42,598 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 57 [2025-03-03 09:30:42,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:42,598 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2025-03-03 09:30:42,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:30:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2025-03-03 09:30:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 09:30:42,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:42,599 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:42,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 09:30:42,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 09:30:42,799 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:42,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:42,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1049090569, now seen corresponding path program 10 times [2025-03-03 09:30:42,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:42,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022048501] [2025-03-03 09:30:42,800 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:30:42,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:42,807 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 62 statements into 2 equivalence classes. [2025-03-03 09:30:42,825 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 09:30:42,826 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:30:42,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:30:42,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1680553120] [2025-03-03 09:30:42,827 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:30:42,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:42,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:42,829 INFO L229 MonitoredProcess]: Starting monitored process 15 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:30:42,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:30:42,879 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 62 statements into 2 equivalence classes. [2025-03-03 09:30:43,857 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 09:30:43,857 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:30:43,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:43,861 WARN L254 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 137 conjuncts are in the unsatisfiable core [2025-03-03 09:30:43,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:43,943 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:30:44,005 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 22 [2025-03-03 09:30:44,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:44,096 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 1 case distinctions, treesize of input 32 treesize of output 36 [2025-03-03 09:30:44,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:44,237 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 3 case distinctions, treesize of input 43 treesize of output 48 [2025-03-03 09:30:44,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:44,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 60 [2025-03-03 09:30:44,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:44,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 74 [2025-03-03 09:30:44,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:44,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 86 [2025-03-03 09:30:44,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:44,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 98 [2025-03-03 09:30:44,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:44,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 110 [2025-03-03 09:30:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:30:46,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:56,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1323 treesize of output 1305