./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-250_file-66.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 16ff97a558b757e7503fa9deac406f5ee96ecd7ac74bc40e1b185d8532e8df37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:01:12,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:01:12,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:01:12,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:01:12,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:01:12,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:01:12,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:01:12,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:01:12,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:01:12,988 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:01:12,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:01:12,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:01:12,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:01:12,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:01:12,988 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:01:12,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:01:12,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:01:12,990 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:01:12,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:01:12,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:01:12,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:01:12,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:01:12,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:01:12,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:01:12,992 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:01:12,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:01:12,992 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:01:12,992 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:01:12,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:01:12,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:01:12,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:01:12,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:01:12,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:01:12,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:01:12,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:01:12,993 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:01:12,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:01:12,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:01:12,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:01:12,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:01:12,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:01:12,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:01:12,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:01:12,994 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 -> 16ff97a558b757e7503fa9deac406f5ee96ecd7ac74bc40e1b185d8532e8df37 [2025-03-08 11:01:13,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:01:13,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:01:13,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:01:13,231 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:01:13,231 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:01:13,233 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-250_file-66.i [2025-03-08 11:01:14,382 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27973393/df5dea348049446896fae2000a9d3ea9/FLAG2ace3f70a [2025-03-08 11:01:14,697 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:01:14,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-66.i [2025-03-08 11:01:14,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27973393/df5dea348049446896fae2000a9d3ea9/FLAG2ace3f70a [2025-03-08 11:01:14,973 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27973393/df5dea348049446896fae2000a9d3ea9 [2025-03-08 11:01:14,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:01:14,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:01:14,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:01:14,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:01:14,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:01:14,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:01:14" (1/1) ... [2025-03-08 11:01:14,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3867afc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:14, skipping insertion in model container [2025-03-08 11:01:14,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:01:14" (1/1) ... [2025-03-08 11:01:15,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:01:15,087 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-250_file-66.i[916,929] [2025-03-08 11:01:15,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:01:15,185 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:01:15,194 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-250_file-66.i[916,929] [2025-03-08 11:01:15,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:01:15,262 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:01:15,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:15 WrapperNode [2025-03-08 11:01:15,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:01:15,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:01:15,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:01:15,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:01:15,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:15" (1/1) ... [2025-03-08 11:01:15,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:15" (1/1) ... [2025-03-08 11:01:15,312 INFO L138 Inliner]: procedures = 26, calls = 87, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 539 [2025-03-08 11:01:15,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:01:15,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:01:15,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:01:15,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:01:15,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:15" (1/1) ... [2025-03-08 11:01:15,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:15" (1/1) ... [2025-03-08 11:01:15,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:15" (1/1) ... [2025-03-08 11:01:15,342 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-08 11:01:15,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:15" (1/1) ... [2025-03-08 11:01:15,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:15" (1/1) ... [2025-03-08 11:01:15,355 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:15" (1/1) ... [2025-03-08 11:01:15,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:15" (1/1) ... [2025-03-08 11:01:15,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:15" (1/1) ... [2025-03-08 11:01:15,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:15" (1/1) ... [2025-03-08 11:01:15,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:01:15,379 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:01:15,379 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:01:15,380 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:01:15,381 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:15" (1/1) ... [2025-03-08 11:01:15,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:01:15,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:01:15,407 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-08 11:01:15,411 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-08 11:01:15,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:01:15,428 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:01:15,428 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:01:15,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:01:15,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:01:15,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:01:15,534 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:01:15,536 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:01:16,255 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-08 11:01:16,257 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:01:16,287 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:01:16,289 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:01:16,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:01:16 BoogieIcfgContainer [2025-03-08 11:01:16,290 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:01:16,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:01:16,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:01:16,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:01:16,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:01:14" (1/3) ... [2025-03-08 11:01:16,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1c4384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:01:16, skipping insertion in model container [2025-03-08 11:01:16,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:15" (2/3) ... [2025-03-08 11:01:16,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1c4384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:01:16, skipping insertion in model container [2025-03-08 11:01:16,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:01:16" (3/3) ... [2025-03-08 11:01:16,297 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-66.i [2025-03-08 11:01:16,307 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:01:16,309 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-66.i that has 2 procedures, 225 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:01:16,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:01:16,358 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;@24bc6749, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:01:16,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:01:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 225 states, 148 states have (on average 1.527027027027027) internal successors, (226), 149 states have internal predecessors, (226), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 11:01:16,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-08 11:01:16,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:16,387 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:16,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:16,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:16,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1840790759, now seen corresponding path program 1 times [2025-03-08 11:01:16,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:16,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353274628] [2025-03-08 11:01:16,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:16,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:16,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-08 11:01:16,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-08 11:01:16,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:16,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-08 11:01:16,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:16,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353274628] [2025-03-08 11:01:16,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353274628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:01:16,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258214596] [2025-03-08 11:01:16,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:16,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:01:16,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:01:16,882 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-08 11:01:16,884 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-08 11:01:17,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-08 11:01:17,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-08 11:01:17,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:17,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:17,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:01:17,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:01:17,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-08 11:01:17,203 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:01:17,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258214596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:17,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:01:17,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:01:17,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190790229] [2025-03-08 11:01:17,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:17,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:01:17,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:17,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:01:17,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:01:17,232 INFO L87 Difference]: Start difference. First operand has 225 states, 148 states have (on average 1.527027027027027) internal successors, (226), 149 states have internal predecessors, (226), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-08 11:01:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:17,285 INFO L93 Difference]: Finished difference Result 444 states and 817 transitions. [2025-03-08 11:01:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:01:17,290 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) Word has length 476 [2025-03-08 11:01:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:17,296 INFO L225 Difference]: With dead ends: 444 [2025-03-08 11:01:17,297 INFO L226 Difference]: Without dead ends: 222 [2025-03-08 11:01:17,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 477 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-08 11:01:17,304 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:17,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:01:17,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-08 11:01:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-03-08 11:01:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 146 states have (on average 1.5136986301369864) internal successors, (221), 146 states have internal predecessors, (221), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 11:01:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 369 transitions. [2025-03-08 11:01:17,372 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 369 transitions. Word has length 476 [2025-03-08 11:01:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:17,373 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 369 transitions. [2025-03-08 11:01:17,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-08 11:01:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 369 transitions. [2025-03-08 11:01:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-08 11:01:17,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:17,385 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:17,393 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-08 11:01:17,586 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-08 11:01:17,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:17,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:17,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2016674715, now seen corresponding path program 1 times [2025-03-08 11:01:17,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:17,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726455614] [2025-03-08 11:01:17,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:17,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:17,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-08 11:01:17,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-08 11:01:17,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:17,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 11:01:18,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:18,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726455614] [2025-03-08 11:01:18,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726455614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:18,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:01:18,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:01:18,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434584867] [2025-03-08 11:01:18,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:18,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:01:18,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:18,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:01:18,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:01:18,009 INFO L87 Difference]: Start difference. First operand 222 states and 369 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:18,182 INFO L93 Difference]: Finished difference Result 579 states and 962 transitions. [2025-03-08 11:01:18,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:01:18,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 476 [2025-03-08 11:01:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:18,190 INFO L225 Difference]: With dead ends: 579 [2025-03-08 11:01:18,192 INFO L226 Difference]: Without dead ends: 360 [2025-03-08 11:01:18,193 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-08 11:01:18,196 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 206 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:18,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 709 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:01:18,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-08 11:01:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 357. [2025-03-08 11:01:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 242 states have (on average 1.5206611570247934) internal successors, (368), 243 states have internal predecessors, (368), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-08 11:01:18,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 592 transitions. [2025-03-08 11:01:18,259 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 592 transitions. Word has length 476 [2025-03-08 11:01:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:18,260 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 592 transitions. [2025-03-08 11:01:18,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 592 transitions. [2025-03-08 11:01:18,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-08 11:01:18,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:18,265 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:18,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:01:18,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:18,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:18,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1819201403, now seen corresponding path program 1 times [2025-03-08 11:01:18,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:18,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017694947] [2025-03-08 11:01:18,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:18,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:18,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-08 11:01:18,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-08 11:01:18,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:18,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 11:01:18,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:18,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017694947] [2025-03-08 11:01:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017694947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:18,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:01:18,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:01:18,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751071572] [2025-03-08 11:01:18,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:18,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:01:18,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:18,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:01:18,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:01:18,714 INFO L87 Difference]: Start difference. First operand 357 states and 592 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:19,039 INFO L93 Difference]: Finished difference Result 949 states and 1570 transitions. [2025-03-08 11:01:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:01:19,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 476 [2025-03-08 11:01:19,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:19,047 INFO L225 Difference]: With dead ends: 949 [2025-03-08 11:01:19,049 INFO L226 Difference]: Without dead ends: 595 [2025-03-08 11:01:19,050 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-08 11:01:19,052 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 200 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:19,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1069 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:01:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-08 11:01:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 591. [2025-03-08 11:01:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 404 states have (on average 1.5148514851485149) internal successors, (612), 407 states have internal predecessors, (612), 182 states have call successors, (182), 4 states have call predecessors, (182), 4 states have return successors, (182), 179 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-08 11:01:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 976 transitions. [2025-03-08 11:01:19,138 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 976 transitions. Word has length 476 [2025-03-08 11:01:19,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:19,140 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 976 transitions. [2025-03-08 11:01:19,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 976 transitions. [2025-03-08 11:01:19,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-08 11:01:19,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:19,148 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:19,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:01:19,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:19,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:19,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1726687521, now seen corresponding path program 1 times [2025-03-08 11:01:19,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:19,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740160527] [2025-03-08 11:01:19,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:19,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:19,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-08 11:01:19,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-08 11:01:19,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:19,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 11:01:20,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:20,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740160527] [2025-03-08 11:01:20,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740160527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:20,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:01:20,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:01:20,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641697964] [2025-03-08 11:01:20,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:20,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:01:20,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:20,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:01:20,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:01:20,015 INFO L87 Difference]: Start difference. First operand 591 states and 976 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:21,192 INFO L93 Difference]: Finished difference Result 1747 states and 2843 transitions. [2025-03-08 11:01:21,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:01:21,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 477 [2025-03-08 11:01:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:21,199 INFO L225 Difference]: With dead ends: 1747 [2025-03-08 11:01:21,199 INFO L226 Difference]: Without dead ends: 1159 [2025-03-08 11:01:21,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:01:21,202 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 446 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:21,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1903 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:01:21,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-03-08 11:01:21,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 633. [2025-03-08 11:01:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 442 states have (on average 1.497737556561086) internal successors, (662), 445 states have internal predecessors, (662), 182 states have call successors, (182), 8 states have call predecessors, (182), 8 states have return successors, (182), 179 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-08 11:01:21,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1026 transitions. [2025-03-08 11:01:21,303 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1026 transitions. Word has length 477 [2025-03-08 11:01:21,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:21,304 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 1026 transitions. [2025-03-08 11:01:21,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1026 transitions. [2025-03-08 11:01:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-08 11:01:21,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:21,314 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:21,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:01:21,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:21,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:21,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1106699776, now seen corresponding path program 1 times [2025-03-08 11:01:21,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:21,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999382380] [2025-03-08 11:01:21,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:21,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:21,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-08 11:01:21,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-08 11:01:21,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:21,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 11:01:21,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999382380] [2025-03-08 11:01:21,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999382380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:21,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:01:21,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:01:21,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711773542] [2025-03-08 11:01:21,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:21,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:01:21,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:21,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:01:21,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:01:21,815 INFO L87 Difference]: Start difference. First operand 633 states and 1026 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:23,068 INFO L93 Difference]: Finished difference Result 3008 states and 4864 transitions. [2025-03-08 11:01:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:01:23,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 477 [2025-03-08 11:01:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:23,082 INFO L225 Difference]: With dead ends: 3008 [2025-03-08 11:01:23,082 INFO L226 Difference]: Without dead ends: 2378 [2025-03-08 11:01:23,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:01:23,086 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 964 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:23,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 1732 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:01:23,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2025-03-08 11:01:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2362. [2025-03-08 11:01:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 1638 states have (on average 1.4908424908424909) internal successors, (2442), 1653 states have internal predecessors, (2442), 686 states have call successors, (686), 37 states have call predecessors, (686), 37 states have return successors, (686), 671 states have call predecessors, (686), 686 states have call successors, (686) [2025-03-08 11:01:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 3814 transitions. [2025-03-08 11:01:23,285 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 3814 transitions. Word has length 477 [2025-03-08 11:01:23,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:23,286 INFO L471 AbstractCegarLoop]: Abstraction has 2362 states and 3814 transitions. [2025-03-08 11:01:23,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3814 transitions. [2025-03-08 11:01:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-08 11:01:23,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:23,304 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:23,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:01:23,305 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:23,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash 983687543, now seen corresponding path program 1 times [2025-03-08 11:01:23,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:23,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700230441] [2025-03-08 11:01:23,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:23,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:23,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-08 11:01:23,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-08 11:01:23,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:23,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 11:01:23,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:23,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700230441] [2025-03-08 11:01:23,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700230441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:23,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:01:23,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:01:23,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28611038] [2025-03-08 11:01:23,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:23,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:01:23,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:23,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:01:23,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:01:23,599 INFO L87 Difference]: Start difference. First operand 2362 states and 3814 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:23,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:23,976 INFO L93 Difference]: Finished difference Result 5811 states and 9366 transitions. [2025-03-08 11:01:23,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:01:23,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 477 [2025-03-08 11:01:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:23,999 INFO L225 Difference]: With dead ends: 5811 [2025-03-08 11:01:23,999 INFO L226 Difference]: Without dead ends: 3510 [2025-03-08 11:01:24,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:01:24,008 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 515 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:24,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1906 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:01:24,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2025-03-08 11:01:24,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 3477. [2025-03-08 11:01:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3477 states, 2444 states have (on average 1.4885433715220948) internal successors, (3638), 2467 states have internal predecessors, (3638), 975 states have call successors, (975), 57 states have call predecessors, (975), 57 states have return successors, (975), 952 states have call predecessors, (975), 975 states have call successors, (975) [2025-03-08 11:01:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3477 states to 3477 states and 5588 transitions. [2025-03-08 11:01:24,298 INFO L78 Accepts]: Start accepts. Automaton has 3477 states and 5588 transitions. Word has length 477 [2025-03-08 11:01:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:24,299 INFO L471 AbstractCegarLoop]: Abstraction has 3477 states and 5588 transitions. [2025-03-08 11:01:24,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3477 states and 5588 transitions. [2025-03-08 11:01:24,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 11:01:24,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:24,303 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:24,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:01:24,303 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:24,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:24,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1069630629, now seen corresponding path program 1 times [2025-03-08 11:01:24,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:24,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179542553] [2025-03-08 11:01:24,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:24,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:24,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 11:01:24,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 11:01:24,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:24,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 11:01:24,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:24,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179542553] [2025-03-08 11:01:24,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179542553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:24,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:01:24,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:01:24,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204216029] [2025-03-08 11:01:24,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:24,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:01:24,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:24,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:01:24,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:01:24,470 INFO L87 Difference]: Start difference. First operand 3477 states and 5588 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:25,197 INFO L93 Difference]: Finished difference Result 11137 states and 17937 transitions. [2025-03-08 11:01:25,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:01:25,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 478 [2025-03-08 11:01:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:25,238 INFO L225 Difference]: With dead ends: 11137 [2025-03-08 11:01:25,238 INFO L226 Difference]: Without dead ends: 7721 [2025-03-08 11:01:25,252 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-08 11:01:25,253 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 631 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:25,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 1507 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:01:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7721 states. [2025-03-08 11:01:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7721 to 7695. [2025-03-08 11:01:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7695 states, 5390 states have (on average 1.4849721706864565) internal successors, (8004), 5445 states have internal predecessors, (8004), 2181 states have call successors, (2181), 123 states have call predecessors, (2181), 123 states have return successors, (2181), 2126 states have call predecessors, (2181), 2181 states have call successors, (2181) [2025-03-08 11:01:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7695 states to 7695 states and 12366 transitions. [2025-03-08 11:01:26,017 INFO L78 Accepts]: Start accepts. Automaton has 7695 states and 12366 transitions. Word has length 478 [2025-03-08 11:01:26,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:26,019 INFO L471 AbstractCegarLoop]: Abstraction has 7695 states and 12366 transitions. [2025-03-08 11:01:26,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:26,019 INFO L276 IsEmpty]: Start isEmpty. Operand 7695 states and 12366 transitions. [2025-03-08 11:01:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 11:01:26,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:26,025 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:26,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:01:26,025 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:26,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:26,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1134949348, now seen corresponding path program 1 times [2025-03-08 11:01:26,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:26,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266039602] [2025-03-08 11:01:26,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:26,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:26,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 11:01:26,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 11:01:26,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:26,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 11:01:26,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:26,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266039602] [2025-03-08 11:01:26,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266039602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:26,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:01:26,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:01:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191297135] [2025-03-08 11:01:26,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:26,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:01:26,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:26,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:01:26,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:01:26,215 INFO L87 Difference]: Start difference. First operand 7695 states and 12366 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:26,874 INFO L93 Difference]: Finished difference Result 15365 states and 24706 transitions. [2025-03-08 11:01:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:01:26,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 478 [2025-03-08 11:01:26,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:26,929 INFO L225 Difference]: With dead ends: 15365 [2025-03-08 11:01:26,932 INFO L226 Difference]: Without dead ends: 7731 [2025-03-08 11:01:26,954 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-08 11:01:26,955 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 229 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:26,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1000 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:01:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7731 states. [2025-03-08 11:01:27,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7731 to 7727. [2025-03-08 11:01:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7727 states, 5422 states have (on average 1.482109922537809) internal successors, (8036), 5477 states have internal predecessors, (8036), 2181 states have call successors, (2181), 123 states have call predecessors, (2181), 123 states have return successors, (2181), 2126 states have call predecessors, (2181), 2181 states have call successors, (2181) [2025-03-08 11:01:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7727 states to 7727 states and 12398 transitions. [2025-03-08 11:01:27,618 INFO L78 Accepts]: Start accepts. Automaton has 7727 states and 12398 transitions. Word has length 478 [2025-03-08 11:01:27,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:27,620 INFO L471 AbstractCegarLoop]: Abstraction has 7727 states and 12398 transitions. [2025-03-08 11:01:27,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 7727 states and 12398 transitions. [2025-03-08 11:01:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 11:01:27,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:27,630 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:27,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:01:27,630 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:27,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:27,631 INFO L85 PathProgramCache]: Analyzing trace with hash 218360349, now seen corresponding path program 1 times [2025-03-08 11:01:27,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:27,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492048731] [2025-03-08 11:01:27,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:27,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:27,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 11:01:27,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 11:01:27,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:27,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 11:01:28,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:28,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492048731] [2025-03-08 11:01:28,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492048731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:28,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:01:28,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:01:28,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212137202] [2025-03-08 11:01:28,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:28,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:01:28,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:28,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:01:28,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:01:28,067 INFO L87 Difference]: Start difference. First operand 7727 states and 12398 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:29,105 INFO L93 Difference]: Finished difference Result 13239 states and 21258 transitions. [2025-03-08 11:01:29,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:01:29,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 478 [2025-03-08 11:01:29,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:29,132 INFO L225 Difference]: With dead ends: 13239 [2025-03-08 11:01:29,133 INFO L226 Difference]: Without dead ends: 5573 [2025-03-08 11:01:29,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:01:29,155 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 758 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:29,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 780 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:01:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5573 states. [2025-03-08 11:01:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5573 to 5569. [2025-03-08 11:01:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5569 states, 3926 states have (on average 1.4865002547121753) internal successors, (5836), 3965 states have internal predecessors, (5836), 1553 states have call successors, (1553), 89 states have call predecessors, (1553), 89 states have return successors, (1553), 1514 states have call predecessors, (1553), 1553 states have call successors, (1553) [2025-03-08 11:01:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 8942 transitions. [2025-03-08 11:01:29,582 INFO L78 Accepts]: Start accepts. Automaton has 5569 states and 8942 transitions. Word has length 478 [2025-03-08 11:01:29,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:29,583 INFO L471 AbstractCegarLoop]: Abstraction has 5569 states and 8942 transitions. [2025-03-08 11:01:29,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 5569 states and 8942 transitions. [2025-03-08 11:01:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 11:01:29,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:29,589 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:29,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:01:29,589 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:29,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:29,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1747953723, now seen corresponding path program 1 times [2025-03-08 11:01:29,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:29,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352560390] [2025-03-08 11:01:29,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:29,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:29,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 11:01:29,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 11:01:29,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:29,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 11:01:29,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:29,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352560390] [2025-03-08 11:01:29,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352560390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:29,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:01:29,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:01:29,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252021769] [2025-03-08 11:01:29,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:29,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:01:29,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:29,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:01:29,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:01:29,931 INFO L87 Difference]: Start difference. First operand 5569 states and 8942 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:31,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:31,652 INFO L93 Difference]: Finished difference Result 23856 states and 38465 transitions. [2025-03-08 11:01:31,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:01:31,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 478 [2025-03-08 11:01:31,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:31,728 INFO L225 Difference]: With dead ends: 23856 [2025-03-08 11:01:31,728 INFO L226 Difference]: Without dead ends: 18348 [2025-03-08 11:01:31,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:01:31,749 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 843 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:31,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1532 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:01:31,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18348 states. [2025-03-08 11:01:32,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18348 to 9269. [2025-03-08 11:01:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9269 states, 7060 states have (on average 1.553257790368272) internal successors, (10966), 7122 states have internal predecessors, (10966), 2096 states have call successors, (2096), 112 states have call predecessors, (2096), 112 states have return successors, (2096), 2034 states have call predecessors, (2096), 2096 states have call successors, (2096) [2025-03-08 11:01:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9269 states to 9269 states and 15158 transitions. [2025-03-08 11:01:32,742 INFO L78 Accepts]: Start accepts. Automaton has 9269 states and 15158 transitions. Word has length 478 [2025-03-08 11:01:32,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:32,743 INFO L471 AbstractCegarLoop]: Abstraction has 9269 states and 15158 transitions. [2025-03-08 11:01:32,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 9269 states and 15158 transitions. [2025-03-08 11:01:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 11:01:32,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:32,751 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:32,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:01:32,751 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:32,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:32,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1507413594, now seen corresponding path program 1 times [2025-03-08 11:01:32,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:32,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336086814] [2025-03-08 11:01:32,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:32,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:32,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 11:01:32,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 11:01:32,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:32,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 11:01:51,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:51,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336086814] [2025-03-08 11:01:51,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336086814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:51,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:01:51,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 11:01:51,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700385073] [2025-03-08 11:01:51,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:51,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 11:01:51,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:51,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 11:01:51,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:01:51,172 INFO L87 Difference]: Start difference. First operand 9269 states and 15158 transitions. Second operand has 15 states, 15 states have (on average 7.4) internal successors, (111), 15 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:53,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:53,130 INFO L93 Difference]: Finished difference Result 25009 states and 39790 transitions. [2025-03-08 11:01:53,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 11:01:53,135 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.4) internal successors, (111), 15 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 478 [2025-03-08 11:01:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:53,188 INFO L225 Difference]: With dead ends: 25009 [2025-03-08 11:01:53,188 INFO L226 Difference]: Without dead ends: 15743 [2025-03-08 11:01:53,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:01:53,212 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 229 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:53,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1773 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:01:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15743 states. [2025-03-08 11:01:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15743 to 12213. [2025-03-08 11:01:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12213 states, 9684 states have (on average 1.5223048327137547) internal successors, (14742), 9810 states have internal predecessors, (14742), 2352 states have call successors, (2352), 176 states have call predecessors, (2352), 176 states have return successors, (2352), 2226 states have call predecessors, (2352), 2352 states have call successors, (2352) [2025-03-08 11:01:54,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12213 states to 12213 states and 19446 transitions. [2025-03-08 11:01:54,085 INFO L78 Accepts]: Start accepts. Automaton has 12213 states and 19446 transitions. Word has length 478 [2025-03-08 11:01:54,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:54,086 INFO L471 AbstractCegarLoop]: Abstraction has 12213 states and 19446 transitions. [2025-03-08 11:01:54,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.4) internal successors, (111), 15 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:01:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand 12213 states and 19446 transitions. [2025-03-08 11:01:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 11:01:54,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:54,096 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:54,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:01:54,097 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:54,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:54,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1506490073, now seen corresponding path program 1 times [2025-03-08 11:01:54,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:54,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728169592] [2025-03-08 11:01:54,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:54,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:54,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 11:01:54,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 11:01:54,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:54,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 11:02:27,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:27,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728169592] [2025-03-08 11:02:27,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728169592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:27,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:27,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 11:02:27,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044272877] [2025-03-08 11:02:27,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:27,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 11:02:27,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:27,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 11:02:27,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:02:27,307 INFO L87 Difference]: Start difference. First operand 12213 states and 19446 transitions. Second operand has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:02:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:31,584 INFO L93 Difference]: Finished difference Result 14719 states and 22907 transitions. [2025-03-08 11:02:31,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 11:02:31,585 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 478 [2025-03-08 11:02:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:31,627 INFO L225 Difference]: With dead ends: 14719 [2025-03-08 11:02:31,627 INFO L226 Difference]: Without dead ends: 14717 [2025-03-08 11:02:31,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-03-08 11:02:31,632 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 132 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 2637 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:31,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 2637 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 11:02:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14717 states. [2025-03-08 11:02:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14717 to 12213. [2025-03-08 11:02:32,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12213 states, 9684 states have (on average 1.5223048327137547) internal successors, (14742), 9810 states have internal predecessors, (14742), 2352 states have call successors, (2352), 176 states have call predecessors, (2352), 176 states have return successors, (2352), 2226 states have call predecessors, (2352), 2352 states have call successors, (2352) [2025-03-08 11:02:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12213 states to 12213 states and 19446 transitions. [2025-03-08 11:02:32,578 INFO L78 Accepts]: Start accepts. Automaton has 12213 states and 19446 transitions. Word has length 478 [2025-03-08 11:02:32,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:32,579 INFO L471 AbstractCegarLoop]: Abstraction has 12213 states and 19446 transitions. [2025-03-08 11:02:32,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 11:02:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 12213 states and 19446 transitions. [2025-03-08 11:02:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 11:02:32,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:32,589 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:02:32,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:02:32,590 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:32,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:32,590 INFO L85 PathProgramCache]: Analyzing trace with hash 980099239, now seen corresponding path program 1 times [2025-03-08 11:02:32,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:32,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688686293] [2025-03-08 11:02:32,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:32,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:32,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 11:02:32,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 11:02:32,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:32,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat