./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-91.i --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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-91.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c96b2c0a4805af872684054e348cbdc2f3aecf564e5f15847ec776b279df9b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:12:43,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:12:43,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:12:43,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:12:43,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:12:43,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:12:43,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:12:43,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:12:43,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:12:43,548 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:12:43,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:12:43,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:12:43,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:12:43,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:12:43,548 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:12:43,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:12:43,548 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:12:43,548 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:12:43,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:12:43,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:12:43,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:12:43,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:12:43,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:12:43,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:12:43,550 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:12:43,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:12:43,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:12:43,550 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 -> 4c96b2c0a4805af872684054e348cbdc2f3aecf564e5f15847ec776b279df9b4 [2025-03-03 20:12:43,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:12:43,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:12:43,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:12:43,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:12:43,776 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:12:43,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-91.i [2025-03-03 20:12:44,900 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6ec6e85/e6f100733f19466b83b56d4370ea3284/FLAGc7af62bfc [2025-03-03 20:12:45,222 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:12:45,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-91.i [2025-03-03 20:12:45,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6ec6e85/e6f100733f19466b83b56d4370ea3284/FLAGc7af62bfc [2025-03-03 20:12:45,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6ec6e85/e6f100733f19466b83b56d4370ea3284 [2025-03-03 20:12:45,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:12:45,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:12:45,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:12:45,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:12:45,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:12:45,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:12:45" (1/1) ... [2025-03-03 20:12:45,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2a9750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:45, skipping insertion in model container [2025-03-03 20:12:45,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:12:45" (1/1) ... [2025-03-03 20:12:45,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:12:45,609 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-91.i[916,929] [2025-03-03 20:12:45,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:12:45,750 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:12:45,759 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-91.i[916,929] [2025-03-03 20:12:45,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:12:45,841 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:12:45,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:45 WrapperNode [2025-03-03 20:12:45,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:12:45,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:12:45,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:12:45,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:12:45,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:45" (1/1) ... [2025-03-03 20:12:45,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:45" (1/1) ... [2025-03-03 20:12:45,919 INFO L138 Inliner]: procedures = 26, calls = 144, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 901 [2025-03-03 20:12:45,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:12:45,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:12:45,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:12:45,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:12:45,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:45" (1/1) ... [2025-03-03 20:12:45,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:45" (1/1) ... [2025-03-03 20:12:45,940 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:45" (1/1) ... [2025-03-03 20:12:45,973 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:12:45,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:45" (1/1) ... [2025-03-03 20:12:45,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:45" (1/1) ... [2025-03-03 20:12:45,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:45" (1/1) ... [2025-03-03 20:12:46,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:45" (1/1) ... [2025-03-03 20:12:46,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:45" (1/1) ... [2025-03-03 20:12:46,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:45" (1/1) ... [2025-03-03 20:12:46,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:12:46,035 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:12:46,035 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:12:46,035 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:12:46,037 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:45" (1/1) ... [2025-03-03 20:12:46,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:12:46,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:12:46,064 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 20:12:46,066 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 20:12:46,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:12:46,085 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:12:46,085 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:12:46,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:12:46,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:12:46,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:12:46,214 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:12:46,216 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:12:47,181 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 20:12:47,181 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:12:47,213 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:12:47,215 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 20:12:47,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:12:47 BoogieIcfgContainer [2025-03-03 20:12:47,216 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:12:47,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:12:47,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:12:47,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:12:47,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:12:45" (1/3) ... [2025-03-03 20:12:47,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32777e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:12:47, skipping insertion in model container [2025-03-03 20:12:47,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:45" (2/3) ... [2025-03-03 20:12:47,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32777e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:12:47, skipping insertion in model container [2025-03-03 20:12:47,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:12:47" (3/3) ... [2025-03-03 20:12:47,224 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-91.i [2025-03-03 20:12:47,234 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:12:47,238 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-91.i that has 2 procedures, 375 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:12:47,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:12:47,314 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;@325ee31c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:12:47,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:12:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 375 states, 241 states have (on average 1.5394190871369295) internal successors, (371), 242 states have internal predecessors, (371), 131 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) [2025-03-03 20:12:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-03-03 20:12:47,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:47,344 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:47,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:47,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:47,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1326024322, now seen corresponding path program 1 times [2025-03-03 20:12:47,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:47,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297212704] [2025-03-03 20:12:47,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:47,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:47,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-03-03 20:12:47,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-03-03 20:12:47,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:47,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 33800 trivial. 0 not checked. [2025-03-03 20:12:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:47,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297212704] [2025-03-03 20:12:47,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297212704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:12:47,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492664604] [2025-03-03 20:12:47,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:47,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:12:47,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:12:47,986 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 20:12:47,987 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 20:12:48,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-03-03 20:12:48,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-03-03 20:12:48,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:48,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:48,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 1831 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:12:48,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:12:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 33800 trivial. 0 not checked. [2025-03-03 20:12:48,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:12:48,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492664604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:48,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:12:48,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:12:48,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529791757] [2025-03-03 20:12:48,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:48,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:12:48,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:48,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:12:48,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:12:48,508 INFO L87 Difference]: Start difference. First operand has 375 states, 241 states have (on average 1.5394190871369295) internal successors, (371), 242 states have internal predecessors, (371), 131 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 2 states have call successors, (131) [2025-03-03 20:12:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:48,589 INFO L93 Difference]: Finished difference Result 744 states and 1392 transitions. [2025-03-03 20:12:48,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:12:48,591 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 2 states have call successors, (131) Word has length 819 [2025-03-03 20:12:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:48,599 INFO L225 Difference]: With dead ends: 744 [2025-03-03 20:12:48,599 INFO L226 Difference]: Without dead ends: 372 [2025-03-03 20:12:48,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 820 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 20:12:48,606 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:48,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 609 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:12:48,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-03 20:12:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-03-03 20:12:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 239 states have (on average 1.5104602510460252) internal successors, (361), 239 states have internal predecessors, (361), 131 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) [2025-03-03 20:12:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 623 transitions. [2025-03-03 20:12:48,692 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 623 transitions. Word has length 819 [2025-03-03 20:12:48,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:48,693 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 623 transitions. [2025-03-03 20:12:48,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 2 states have call successors, (131) [2025-03-03 20:12:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 623 transitions. [2025-03-03 20:12:48,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-03-03 20:12:48,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:48,711 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:48,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:12:48,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:12:48,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:48,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:48,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1917703893, now seen corresponding path program 1 times [2025-03-03 20:12:48,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:48,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691515178] [2025-03-03 20:12:48,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:48,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:48,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-03-03 20:12:49,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-03-03 20:12:49,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:49,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-03 20:12:49,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:49,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691515178] [2025-03-03 20:12:49,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691515178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:49,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:49,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:49,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497992752] [2025-03-03 20:12:49,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:49,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:49,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:49,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:49,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:49,523 INFO L87 Difference]: Start difference. First operand 372 states and 623 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:49,613 INFO L93 Difference]: Finished difference Result 939 states and 1582 transitions. [2025-03-03 20:12:49,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:49,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 819 [2025-03-03 20:12:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:49,619 INFO L225 Difference]: With dead ends: 939 [2025-03-03 20:12:49,619 INFO L226 Difference]: Without dead ends: 570 [2025-03-03 20:12:49,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:49,621 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 325 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:49,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1269 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-03 20:12:49,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 567. [2025-03-03 20:12:49,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 409 states have (on average 1.5843520782396088) internal successors, (648), 410 states have internal predecessors, (648), 155 states have call successors, (155), 2 states have call predecessors, (155), 2 states have return successors, (155), 154 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-03 20:12:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 958 transitions. [2025-03-03 20:12:49,675 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 958 transitions. Word has length 819 [2025-03-03 20:12:49,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:49,676 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 958 transitions. [2025-03-03 20:12:49,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 958 transitions. [2025-03-03 20:12:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-03-03 20:12:49,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:49,685 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:49,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:12:49,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:49,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:49,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1519915475, now seen corresponding path program 1 times [2025-03-03 20:12:49,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:49,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212371068] [2025-03-03 20:12:49,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:49,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:49,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-03-03 20:12:49,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-03-03 20:12:49,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:49,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-03 20:12:50,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:50,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212371068] [2025-03-03 20:12:50,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212371068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:50,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:50,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:50,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176569180] [2025-03-03 20:12:50,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:50,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:50,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:50,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:50,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:50,003 INFO L87 Difference]: Start difference. First operand 567 states and 958 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:50,102 INFO L93 Difference]: Finished difference Result 1499 states and 2534 transitions. [2025-03-03 20:12:50,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:50,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 819 [2025-03-03 20:12:50,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:50,114 INFO L225 Difference]: With dead ends: 1499 [2025-03-03 20:12:50,114 INFO L226 Difference]: Without dead ends: 935 [2025-03-03 20:12:50,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:50,116 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 318 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:50,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1305 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-03 20:12:50,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 932. [2025-03-03 20:12:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 706 states have (on average 1.5991501416430596) internal successors, (1129), 709 states have internal predecessors, (1129), 221 states have call successors, (221), 4 states have call predecessors, (221), 4 states have return successors, (221), 218 states have call predecessors, (221), 221 states have call successors, (221) [2025-03-03 20:12:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1571 transitions. [2025-03-03 20:12:50,170 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1571 transitions. Word has length 819 [2025-03-03 20:12:50,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:50,171 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1571 transitions. [2025-03-03 20:12:50,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1571 transitions. [2025-03-03 20:12:50,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-03-03 20:12:50,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:50,177 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:50,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:12:50,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:50,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:50,178 INFO L85 PathProgramCache]: Analyzing trace with hash 844432716, now seen corresponding path program 1 times [2025-03-03 20:12:50,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:50,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103101525] [2025-03-03 20:12:50,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:50,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:50,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-03-03 20:12:50,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-03-03 20:12:50,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:50,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:50,592 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-03 20:12:50,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:50,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103101525] [2025-03-03 20:12:50,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103101525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:50,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:50,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:12:50,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037487833] [2025-03-03 20:12:50,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:50,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:12:50,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:50,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:12:50,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:50,594 INFO L87 Difference]: Start difference. First operand 932 states and 1571 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:50,720 INFO L93 Difference]: Finished difference Result 2461 states and 4144 transitions. [2025-03-03 20:12:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:12:50,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 819 [2025-03-03 20:12:50,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:50,731 INFO L225 Difference]: With dead ends: 2461 [2025-03-03 20:12:50,731 INFO L226 Difference]: Without dead ends: 1532 [2025-03-03 20:12:50,734 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 20:12:50,735 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 283 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:50,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 2018 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2025-03-03 20:12:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1525. [2025-03-03 20:12:50,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1157 states have (on average 1.5903197925669836) internal successors, (1840), 1164 states have internal predecessors, (1840), 359 states have call successors, (359), 8 states have call predecessors, (359), 8 states have return successors, (359), 352 states have call predecessors, (359), 359 states have call successors, (359) [2025-03-03 20:12:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2558 transitions. [2025-03-03 20:12:50,853 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2558 transitions. Word has length 819 [2025-03-03 20:12:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:50,854 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 2558 transitions. [2025-03-03 20:12:50,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2558 transitions. [2025-03-03 20:12:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2025-03-03 20:12:50,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:50,865 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:50,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:12:50,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:50,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:50,866 INFO L85 PathProgramCache]: Analyzing trace with hash -283501585, now seen corresponding path program 1 times [2025-03-03 20:12:50,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:50,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112175778] [2025-03-03 20:12:50,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:50,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:50,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 820 statements into 1 equivalence classes. [2025-03-03 20:12:50,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 820 of 820 statements. [2025-03-03 20:12:50,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:50,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-03 20:12:51,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:51,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112175778] [2025-03-03 20:12:51,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112175778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:51,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:51,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:51,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347043697] [2025-03-03 20:12:51,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:51,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:51,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:51,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:51,115 INFO L87 Difference]: Start difference. First operand 1525 states and 2558 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:51,259 INFO L93 Difference]: Finished difference Result 4505 states and 7552 transitions. [2025-03-03 20:12:51,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:51,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 820 [2025-03-03 20:12:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:51,276 INFO L225 Difference]: With dead ends: 4505 [2025-03-03 20:12:51,277 INFO L226 Difference]: Without dead ends: 2983 [2025-03-03 20:12:51,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:51,282 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 560 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:51,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1250 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:12:51,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2025-03-03 20:12:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2177. [2025-03-03 20:12:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2177 states, 1809 states have (on average 1.642896627971255) internal successors, (2972), 1816 states have internal predecessors, (2972), 359 states have call successors, (359), 8 states have call predecessors, (359), 8 states have return successors, (359), 352 states have call predecessors, (359), 359 states have call successors, (359) [2025-03-03 20:12:51,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 3690 transitions. [2025-03-03 20:12:51,408 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 3690 transitions. Word has length 820 [2025-03-03 20:12:51,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:51,411 INFO L471 AbstractCegarLoop]: Abstraction has 2177 states and 3690 transitions. [2025-03-03 20:12:51,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:51,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 3690 transitions. [2025-03-03 20:12:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2025-03-03 20:12:51,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:51,418 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:51,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:12:51,418 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:51,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:51,419 INFO L85 PathProgramCache]: Analyzing trace with hash 136015246, now seen corresponding path program 1 times [2025-03-03 20:12:51,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:51,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107725249] [2025-03-03 20:12:51,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:51,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:51,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 820 statements into 1 equivalence classes. [2025-03-03 20:12:51,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 820 of 820 statements. [2025-03-03 20:12:51,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:51,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-03 20:12:51,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:51,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107725249] [2025-03-03 20:12:51,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107725249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:51,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:51,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:12:51,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392597401] [2025-03-03 20:12:51,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:51,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:12:51,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:51,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:12:51,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:51,744 INFO L87 Difference]: Start difference. First operand 2177 states and 3690 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:52,537 INFO L93 Difference]: Finished difference Result 7874 states and 13315 transitions. [2025-03-03 20:12:52,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:12:52,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 820 [2025-03-03 20:12:52,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:52,565 INFO L225 Difference]: With dead ends: 7874 [2025-03-03 20:12:52,565 INFO L226 Difference]: Without dead ends: 5700 [2025-03-03 20:12:52,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:52,574 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 657 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:52,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1710 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:12:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2025-03-03 20:12:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5695. [2025-03-03 20:12:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5695 states, 4637 states have (on average 1.626698296312271) internal successors, (7543), 4659 states have internal predecessors, (7543), 1033 states have call successors, (1033), 24 states have call predecessors, (1033), 24 states have return successors, (1033), 1011 states have call predecessors, (1033), 1033 states have call successors, (1033) [2025-03-03 20:12:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5695 states to 5695 states and 9609 transitions. [2025-03-03 20:12:52,857 INFO L78 Accepts]: Start accepts. Automaton has 5695 states and 9609 transitions. Word has length 820 [2025-03-03 20:12:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:52,858 INFO L471 AbstractCegarLoop]: Abstraction has 5695 states and 9609 transitions. [2025-03-03 20:12:52,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 5695 states and 9609 transitions. [2025-03-03 20:12:52,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-03-03 20:12:52,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:52,868 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:52,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:12:52,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:52,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1780753739, now seen corresponding path program 1 times [2025-03-03 20:12:52,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:52,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092471974] [2025-03-03 20:12:52,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:52,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:52,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-03-03 20:12:52,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-03-03 20:12:52,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:52,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-03 20:12:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:53,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092471974] [2025-03-03 20:12:53,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092471974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:53,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:53,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702308000] [2025-03-03 20:12:53,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:53,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:53,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:53,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:53,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:53,165 INFO L87 Difference]: Start difference. First operand 5695 states and 9609 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:53,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:53,512 INFO L93 Difference]: Finished difference Result 16365 states and 27620 transitions. [2025-03-03 20:12:53,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:53,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 821 [2025-03-03 20:12:53,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:53,565 INFO L225 Difference]: With dead ends: 16365 [2025-03-03 20:12:53,566 INFO L226 Difference]: Without dead ends: 10673 [2025-03-03 20:12:53,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:53,581 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 281 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:53,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1279 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:53,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2025-03-03 20:12:53,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 10659. [2025-03-03 20:12:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10659 states, 8929 states have (on average 1.628737820584612) internal successors, (14543), 8975 states have internal predecessors, (14543), 1681 states have call successors, (1681), 48 states have call predecessors, (1681), 48 states have return successors, (1681), 1635 states have call predecessors, (1681), 1681 states have call successors, (1681) [2025-03-03 20:12:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10659 states to 10659 states and 17905 transitions. [2025-03-03 20:12:54,055 INFO L78 Accepts]: Start accepts. Automaton has 10659 states and 17905 transitions. Word has length 821 [2025-03-03 20:12:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:54,056 INFO L471 AbstractCegarLoop]: Abstraction has 10659 states and 17905 transitions. [2025-03-03 20:12:54,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 10659 states and 17905 transitions. [2025-03-03 20:12:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-03-03 20:12:54,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:54,073 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:54,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:12:54,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:54,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2094696726, now seen corresponding path program 1 times [2025-03-03 20:12:54,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080130747] [2025-03-03 20:12:54,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:54,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-03-03 20:12:54,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-03-03 20:12:54,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:54,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:54,288 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-03 20:12:54,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:54,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080130747] [2025-03-03 20:12:54,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080130747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:54,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:54,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:54,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088965293] [2025-03-03 20:12:54,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:54,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:54,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:54,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:54,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:54,290 INFO L87 Difference]: Start difference. First operand 10659 states and 17905 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:54,643 INFO L93 Difference]: Finished difference Result 21377 states and 35856 transitions. [2025-03-03 20:12:54,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:54,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 821 [2025-03-03 20:12:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:54,687 INFO L225 Difference]: With dead ends: 21377 [2025-03-03 20:12:54,687 INFO L226 Difference]: Without dead ends: 10721 [2025-03-03 20:12:54,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:54,712 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 276 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:54,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1358 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10721 states. [2025-03-03 20:12:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10721 to 8703. [2025-03-03 20:12:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8703 states, 7633 states have (on average 1.6353989257172803) internal successors, (12483), 7655 states have internal predecessors, (12483), 1033 states have call successors, (1033), 36 states have call predecessors, (1033), 36 states have return successors, (1033), 1011 states have call predecessors, (1033), 1033 states have call successors, (1033) [2025-03-03 20:12:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8703 states to 8703 states and 14549 transitions. [2025-03-03 20:12:55,112 INFO L78 Accepts]: Start accepts. Automaton has 8703 states and 14549 transitions. Word has length 821 [2025-03-03 20:12:55,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:55,114 INFO L471 AbstractCegarLoop]: Abstraction has 8703 states and 14549 transitions. [2025-03-03 20:12:55,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand 8703 states and 14549 transitions. [2025-03-03 20:12:55,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-03-03 20:12:55,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:55,132 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:55,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:12:55,133 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:55,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:55,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1133082709, now seen corresponding path program 1 times [2025-03-03 20:12:55,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:55,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796935928] [2025-03-03 20:12:55,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:55,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:55,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-03-03 20:12:55,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-03-03 20:12:55,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:55,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-03 20:12:55,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:55,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796935928] [2025-03-03 20:12:55,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796935928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:55,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:55,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:55,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780542594] [2025-03-03 20:12:55,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:55,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:55,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:55,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:55,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:55,422 INFO L87 Difference]: Start difference. First operand 8703 states and 14549 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:55,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:55,879 INFO L93 Difference]: Finished difference Result 19791 states and 32857 transitions. [2025-03-03 20:12:55,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:55,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 821 [2025-03-03 20:12:55,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:55,922 INFO L225 Difference]: With dead ends: 19791 [2025-03-03 20:12:55,922 INFO L226 Difference]: Without dead ends: 11091 [2025-03-03 20:12:55,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:55,947 INFO L435 NwaCegarLoop]: 1078 mSDtfsCounter, 525 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:55,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1674 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11091 states. [2025-03-03 20:12:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11091 to 8703. [2025-03-03 20:12:56,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8703 states, 7633 states have (on average 1.6196777151840691) internal successors, (12363), 7655 states have internal predecessors, (12363), 1033 states have call successors, (1033), 36 states have call predecessors, (1033), 36 states have return successors, (1033), 1011 states have call predecessors, (1033), 1033 states have call successors, (1033) [2025-03-03 20:12:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8703 states to 8703 states and 14429 transitions. [2025-03-03 20:12:56,305 INFO L78 Accepts]: Start accepts. Automaton has 8703 states and 14429 transitions. Word has length 821 [2025-03-03 20:12:56,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:56,306 INFO L471 AbstractCegarLoop]: Abstraction has 8703 states and 14429 transitions. [2025-03-03 20:12:56,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 8703 states and 14429 transitions. [2025-03-03 20:12:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-03-03 20:12:56,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:56,318 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:56,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:12:56,319 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:56,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash -921731796, now seen corresponding path program 1 times [2025-03-03 20:12:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:56,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834795275] [2025-03-03 20:12:56,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:56,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-03-03 20:12:56,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-03-03 20:12:56,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:56,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-03 20:12:56,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:56,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834795275] [2025-03-03 20:12:56,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834795275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:56,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:56,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:56,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205319835] [2025-03-03 20:12:56,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:56,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:56,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:56,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:56,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:56,523 INFO L87 Difference]: Start difference. First operand 8703 states and 14429 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:56,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:56,791 INFO L93 Difference]: Finished difference Result 21937 states and 36296 transitions. [2025-03-03 20:12:56,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:56,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 821 [2025-03-03 20:12:56,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:56,834 INFO L225 Difference]: With dead ends: 21937 [2025-03-03 20:12:56,835 INFO L226 Difference]: Without dead ends: 13237 [2025-03-03 20:12:56,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:56,861 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 263 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:56,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1272 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:12:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13237 states. [2025-03-03 20:12:57,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13237 to 13211. [2025-03-03 20:12:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13211 states, 11589 states have (on average 1.6145482785399947) internal successors, (18711), 11635 states have internal predecessors, (18711), 1561 states have call successors, (1561), 60 states have call predecessors, (1561), 60 states have return successors, (1561), 1515 states have call predecessors, (1561), 1561 states have call successors, (1561) [2025-03-03 20:12:57,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13211 states to 13211 states and 21833 transitions. [2025-03-03 20:12:57,289 INFO L78 Accepts]: Start accepts. Automaton has 13211 states and 21833 transitions. Word has length 821 [2025-03-03 20:12:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:57,291 INFO L471 AbstractCegarLoop]: Abstraction has 13211 states and 21833 transitions. [2025-03-03 20:12:57,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 13211 states and 21833 transitions. [2025-03-03 20:12:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-03-03 20:12:57,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:57,308 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:57,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:12:57,308 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:57,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:57,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1918804149, now seen corresponding path program 1 times [2025-03-03 20:12:57,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:57,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111959716] [2025-03-03 20:12:57,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:57,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-03-03 20:12:57,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-03-03 20:12:57,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:57,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-03 20:12:57,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:57,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111959716] [2025-03-03 20:12:57,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111959716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:57,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:57,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:57,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303760766] [2025-03-03 20:12:57,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:57,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:57,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:57,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:57,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:57,500 INFO L87 Difference]: Start difference. First operand 13211 states and 21833 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:58,031 INFO L93 Difference]: Finished difference Result 39483 states and 65205 transitions. [2025-03-03 20:12:58,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:58,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 821 [2025-03-03 20:12:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:58,116 INFO L225 Difference]: With dead ends: 39483 [2025-03-03 20:12:58,116 INFO L226 Difference]: Without dead ends: 26275 [2025-03-03 20:12:58,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:58,147 INFO L435 NwaCegarLoop]: 1195 mSDtfsCounter, 613 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:58,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1793 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:58,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26275 states. [2025-03-03 20:12:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26275 to 13307. [2025-03-03 20:12:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13307 states, 11685 states have (on average 1.6094993581514763) internal successors, (18807), 11731 states have internal predecessors, (18807), 1561 states have call successors, (1561), 60 states have call predecessors, (1561), 60 states have return successors, (1561), 1515 states have call predecessors, (1561), 1561 states have call successors, (1561) [2025-03-03 20:12:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13307 states to 13307 states and 21929 transitions. [2025-03-03 20:12:58,870 INFO L78 Accepts]: Start accepts. Automaton has 13307 states and 21929 transitions. Word has length 821 [2025-03-03 20:12:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:58,871 INFO L471 AbstractCegarLoop]: Abstraction has 13307 states and 21929 transitions. [2025-03-03 20:12:58,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:12:58,871 INFO L276 IsEmpty]: Start isEmpty. Operand 13307 states and 21929 transitions. [2025-03-03 20:12:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 823 [2025-03-03 20:12:58,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:58,895 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:58,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:12:58,896 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:58,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:58,897 INFO L85 PathProgramCache]: Analyzing trace with hash -881639336, now seen corresponding path program 1 times [2025-03-03 20:12:58,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:58,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601480202] [2025-03-03 20:12:58,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:58,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:58,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 822 statements into 1 equivalence classes. [2025-03-03 20:12:58,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 822 of 822 statements. [2025-03-03 20:12:58,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:58,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-03 20:12:59,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:59,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601480202] [2025-03-03 20:12:59,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601480202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:59,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:59,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:12:59,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864390114] [2025-03-03 20:12:59,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:59,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:12:59,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:59,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:12:59,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:59,390 INFO L87 Difference]: Start difference. First operand 13307 states and 21929 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:13:00,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:00,633 INFO L93 Difference]: Finished difference Result 48353 states and 79227 transitions. [2025-03-03 20:13:00,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:13:00,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 822 [2025-03-03 20:13:00,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:00,723 INFO L225 Difference]: With dead ends: 48353 [2025-03-03 20:13:00,723 INFO L226 Difference]: Without dead ends: 35049 [2025-03-03 20:13:00,750 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 20:13:00,751 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 621 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:00,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 1464 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:13:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35049 states. [2025-03-03 20:13:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35049 to 16079. [2025-03-03 20:13:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16079 states, 14457 states have (on average 1.6171404855779208) internal successors, (23379), 14503 states have internal predecessors, (23379), 1561 states have call successors, (1561), 60 states have call predecessors, (1561), 60 states have return successors, (1561), 1515 states have call predecessors, (1561), 1561 states have call successors, (1561) [2025-03-03 20:13:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16079 states to 16079 states and 26501 transitions. [2025-03-03 20:13:01,336 INFO L78 Accepts]: Start accepts. Automaton has 16079 states and 26501 transitions. Word has length 822 [2025-03-03 20:13:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:01,337 INFO L471 AbstractCegarLoop]: Abstraction has 16079 states and 26501 transitions. [2025-03-03 20:13:01,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:13:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 16079 states and 26501 transitions. [2025-03-03 20:13:01,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 823 [2025-03-03 20:13:01,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:01,358 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:01,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:13:01,358 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:01,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:01,359 INFO L85 PathProgramCache]: Analyzing trace with hash -861301961, now seen corresponding path program 1 times [2025-03-03 20:13:01,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:01,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837056399] [2025-03-03 20:13:01,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:01,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:01,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 822 statements into 1 equivalence classes. [2025-03-03 20:13:01,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 822 of 822 statements. [2025-03-03 20:13:01,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:01,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:01,966 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-03 20:13:01,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:01,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837056399] [2025-03-03 20:13:01,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837056399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:01,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:01,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:01,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004952935] [2025-03-03 20:13:01,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:01,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:01,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:01,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:01,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:01,968 INFO L87 Difference]: Start difference. First operand 16079 states and 26501 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:13:02,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:02,536 INFO L93 Difference]: Finished difference Result 48231 states and 79497 transitions. [2025-03-03 20:13:02,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:02,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 822 [2025-03-03 20:13:02,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:02,628 INFO L225 Difference]: With dead ends: 48231 [2025-03-03 20:13:02,628 INFO L226 Difference]: Without dead ends: 32155 [2025-03-03 20:13:02,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:02,663 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 346 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:02,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1205 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:13:02,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32155 states. [2025-03-03 20:13:03,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32155 to 32057. [2025-03-03 20:13:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32057 states, 28814 states have (on average 1.6117859373915457) internal successors, (46442), 28906 states have internal predecessors, (46442), 3122 states have call successors, (3122), 120 states have call predecessors, (3122), 120 states have return successors, (3122), 3030 states have call predecessors, (3122), 3122 states have call successors, (3122) [2025-03-03 20:13:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32057 states to 32057 states and 52686 transitions. [2025-03-03 20:13:03,590 INFO L78 Accepts]: Start accepts. Automaton has 32057 states and 52686 transitions. Word has length 822 [2025-03-03 20:13:03,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:03,591 INFO L471 AbstractCegarLoop]: Abstraction has 32057 states and 52686 transitions. [2025-03-03 20:13:03,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-03-03 20:13:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 32057 states and 52686 transitions. [2025-03-03 20:13:03,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 823 [2025-03-03 20:13:03,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:03,615 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:03,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:13:03,616 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:03,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:03,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1760753576, now seen corresponding path program 1 times [2025-03-03 20:13:03,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:03,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688523400] [2025-03-03 20:13:03,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:03,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:03,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 822 statements into 1 equivalence classes. [2025-03-03 20:13:03,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 822 of 822 statements. [2025-03-03 20:13:03,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:03,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-03 20:13:05,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688523400] [2025-03-03 20:13:05,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688523400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:05,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:05,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:13:05,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697770640] [2025-03-03 20:13:05,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:05,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:13:05,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:05,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:13:05,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:13:05,793 INFO L87 Difference]: Start difference. First operand 32057 states and 52686 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 2 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) [2025-03-03 20:13:11,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:11,482 INFO L93 Difference]: Finished difference Result 213753 states and 349211 transitions. [2025-03-03 20:13:11,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 20:13:11,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 2 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) Word has length 822 [2025-03-03 20:13:11,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:12,300 INFO L225 Difference]: With dead ends: 213753 [2025-03-03 20:13:12,300 INFO L226 Difference]: Without dead ends: 181699 [2025-03-03 20:13:12,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:13:12,394 INFO L435 NwaCegarLoop]: 1336 mSDtfsCounter, 3372 mSDsluCounter, 6220 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3372 SdHoareTripleChecker+Valid, 7556 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1109 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:12,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3372 Valid, 7556 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1109 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 20:13:12,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181699 states. [2025-03-03 20:13:17,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181699 to 112899. [2025-03-03 20:13:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112899 states, 100494 states have (on average 1.6017473680020697) internal successors, (160966), 100871 states have internal predecessors, (160966), 11919 states have call successors, (11919), 485 states have call predecessors, (11919), 485 states have return successors, (11919), 11542 states have call predecessors, (11919), 11919 states have call successors, (11919) [2025-03-03 20:13:18,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112899 states to 112899 states and 184804 transitions. [2025-03-03 20:13:18,401 INFO L78 Accepts]: Start accepts. Automaton has 112899 states and 184804 transitions. Word has length 822 [2025-03-03 20:13:18,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:18,402 INFO L471 AbstractCegarLoop]: Abstraction has 112899 states and 184804 transitions. [2025-03-03 20:13:18,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 2 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) [2025-03-03 20:13:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 112899 states and 184804 transitions. [2025-03-03 20:13:18,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 824 [2025-03-03 20:13:18,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:18,512 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:18,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:13:18,513 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:18,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2129287100, now seen corresponding path program 1 times [2025-03-03 20:13:18,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:18,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625515394] [2025-03-03 20:13:18,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:18,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:18,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 823 statements into 1 equivalence classes. [2025-03-03 20:13:18,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 823 of 823 statements. [2025-03-03 20:13:18,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:18,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-03-03 20:13:19,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:19,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625515394] [2025-03-03 20:13:19,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625515394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:19,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:19,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:13:19,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954772164] [2025-03-03 20:13:19,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:19,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:13:19,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:19,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:13:19,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:13:19,610 INFO L87 Difference]: Start difference. First operand 112899 states and 184804 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 2 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) [2025-03-03 20:13:31,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:31,890 INFO L93 Difference]: Finished difference Result 392575 states and 637144 transitions. [2025-03-03 20:13:31,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:13:31,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 2 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) Word has length 823 [2025-03-03 20:13:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:32,751 INFO L225 Difference]: With dead ends: 392575 [2025-03-03 20:13:32,752 INFO L226 Difference]: Without dead ends: 279905 [2025-03-03 20:13:32,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:13:32,969 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 1305 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 2337 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:32,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1305 Valid, 2337 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 20:13:33,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279905 states. [2025-03-03 20:13:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279905 to 224753. [2025-03-03 20:13:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224753 states, 196149 states have (on average 1.5815171119913942) internal successors, (310213), 197030 states have internal predecessors, (310213), 27475 states have call successors, (27475), 1128 states have call predecessors, (27475), 1128 states have return successors, (27475), 26594 states have call predecessors, (27475), 27475 states have call successors, (27475) [2025-03-03 20:13:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224753 states to 224753 states and 365163 transitions. [2025-03-03 20:13:45,530 INFO L78 Accepts]: Start accepts. Automaton has 224753 states and 365163 transitions. Word has length 823 [2025-03-03 20:13:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:45,531 INFO L471 AbstractCegarLoop]: Abstraction has 224753 states and 365163 transitions. [2025-03-03 20:13:45,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 2 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) [2025-03-03 20:13:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 224753 states and 365163 transitions. [2025-03-03 20:13:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 824 [2025-03-03 20:13:45,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:45,663 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:45,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 20:13:45,663 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:45,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash 321439579, now seen corresponding path program 1 times [2025-03-03 20:13:45,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:45,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849279842] [2025-03-03 20:13:45,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:45,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:45,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 823 statements into 1 equivalence classes. [2025-03-03 20:13:46,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 823 of 823 statements. [2025-03-03 20:13:46,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:46,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 90 proven. 300 refuted. 0 times theorem prover too weak. 33670 trivial. 0 not checked. [2025-03-03 20:13:46,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:46,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849279842] [2025-03-03 20:13:46,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849279842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:13:46,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146467887] [2025-03-03 20:13:46,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:46,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:13:46,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:13:46,449 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 20:13:46,450 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 20:13:46,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 823 statements into 1 equivalence classes. [2025-03-03 20:13:46,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 823 of 823 statements. [2025-03-03 20:13:46,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:46,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:46,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 1830 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 20:13:46,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:13:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 16698 proven. 162 refuted. 0 times theorem prover too weak. 17200 trivial. 0 not checked. [2025-03-03 20:13:47,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:13:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 228 proven. 162 refuted. 0 times theorem prover too weak. 33670 trivial. 0 not checked. [2025-03-03 20:13:48,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146467887] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:13:48,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:13:48,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2025-03-03 20:13:48,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631894143] [2025-03-03 20:13:48,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:13:48,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:13:48,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:48,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:13:48,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:13:48,333 INFO L87 Difference]: Start difference. First operand 224753 states and 365163 transitions. Second operand has 10 states, 10 states have (on average 38.7) internal successors, (387), 10 states have internal predecessors, (387), 4 states have call successors, (285), 2 states have call predecessors, (285), 4 states have return successors, (287), 4 states have call predecessors, (287), 4 states have call successors, (287)