./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-84.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 12d3a43944bcf873edb66a7d9a5f702d0b9b38d53543038559519bc18ead71d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:11:53,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:11:53,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:11:53,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:11:53,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:11:53,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:11:53,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:11:53,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:11:53,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:11:53,963 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:11:53,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:11:53,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:11:53,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:11:53,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:11:53,965 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:11:53,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:11:53,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:11:53,965 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:11:53,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:11:53,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:11:53,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:11:53,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:11:53,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:11:53,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:11:53,966 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:11:53,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:11:53,966 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:11:53,966 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:11:53,966 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:11:53,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:11:53,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:11:53,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:11:53,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:11:53,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:11:53,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:11:53,967 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:11:53,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:11:53,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:11:53,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:11:53,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:11:53,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:11:53,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:11:53,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:11:53,967 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 -> 12d3a43944bcf873edb66a7d9a5f702d0b9b38d53543038559519bc18ead71d6 [2025-03-03 20:11:54,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:11:54,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:11:54,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:11:54,197 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:11:54,198 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:11:54,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-84.i [2025-03-03 20:11:55,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4faac4bc/5bdce4e22bee4dd1bc1ab5ac21d3c22c/FLAGe28adbac8 [2025-03-03 20:11:55,556 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:11:55,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-84.i [2025-03-03 20:11:55,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4faac4bc/5bdce4e22bee4dd1bc1ab5ac21d3c22c/FLAGe28adbac8 [2025-03-03 20:11:55,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4faac4bc/5bdce4e22bee4dd1bc1ab5ac21d3c22c [2025-03-03 20:11:55,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:11:55,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:11:55,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:11:55,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:11:55,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:11:55,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:11:55" (1/1) ... [2025-03-03 20:11:55,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264b7190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:55, skipping insertion in model container [2025-03-03 20:11:55,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:11:55" (1/1) ... [2025-03-03 20:11:55,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:11:55,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-84.i[916,929] [2025-03-03 20:11:55,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:11:55,908 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:11:55,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-84.i[916,929] [2025-03-03 20:11:55,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:11:56,017 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:11:56,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:56 WrapperNode [2025-03-03 20:11:56,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:11:56,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:11:56,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:11:56,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:11:56,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:56" (1/1) ... [2025-03-03 20:11:56,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:56" (1/1) ... [2025-03-03 20:11:56,122 INFO L138 Inliner]: procedures = 26, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 991 [2025-03-03 20:11:56,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:11:56,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:11:56,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:11:56,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:11:56,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:56" (1/1) ... [2025-03-03 20:11:56,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:56" (1/1) ... [2025-03-03 20:11:56,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:56" (1/1) ... [2025-03-03 20:11:56,178 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:11:56,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:56" (1/1) ... [2025-03-03 20:11:56,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:56" (1/1) ... [2025-03-03 20:11:56,198 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:56" (1/1) ... [2025-03-03 20:11:56,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:56" (1/1) ... [2025-03-03 20:11:56,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:56" (1/1) ... [2025-03-03 20:11:56,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:56" (1/1) ... [2025-03-03 20:11:56,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:11:56,223 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:11:56,223 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:11:56,223 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:11:56,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:56" (1/1) ... [2025-03-03 20:11:56,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:11:56,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:56,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:11:56,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:11:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:11:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:11:56,275 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:11:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:11:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:11:56,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:11:56,408 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:11:56,410 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:11:57,202 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: havoc property_#t~bitwise96#1;havoc property_#t~short97#1;havoc property_#t~bitwise98#1;havoc property_#t~short99#1; [2025-03-03 20:11:57,407 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-03 20:11:57,407 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:11:57,445 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:11:57,448 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:11:57,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:11:57 BoogieIcfgContainer [2025-03-03 20:11:57,449 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:11:57,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:11:57,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:11:57,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:11:57,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:11:55" (1/3) ... [2025-03-03 20:11:57,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af2e28a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:11:57, skipping insertion in model container [2025-03-03 20:11:57,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:56" (2/3) ... [2025-03-03 20:11:57,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af2e28a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:11:57, skipping insertion in model container [2025-03-03 20:11:57,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:11:57" (3/3) ... [2025-03-03 20:11:57,457 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-84.i [2025-03-03 20:11:57,466 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:11:57,469 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-84.i that has 2 procedures, 404 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:11:57,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:11:57,535 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@72f021bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:11:57,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:11:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 404 states, 276 states have (on average 1.5724637681159421) internal successors, (434), 277 states have internal predecessors, (434), 125 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2025-03-03 20:11:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2025-03-03 20:11:57,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:57,583 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:57,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:57,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:57,587 INFO L85 PathProgramCache]: Analyzing trace with hash -343081947, now seen corresponding path program 1 times [2025-03-03 20:11:57,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:57,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113895090] [2025-03-03 20:11:57,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:57,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:57,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 793 statements into 1 equivalence classes. [2025-03-03 20:11:57,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 793 of 793 statements. [2025-03-03 20:11:57,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:57,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 30752 trivial. 0 not checked. [2025-03-03 20:11:58,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:58,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113895090] [2025-03-03 20:11:58,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113895090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:11:58,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987378138] [2025-03-03 20:11:58,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:58,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:58,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:58,159 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:11:58,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:11:58,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 793 statements into 1 equivalence classes. [2025-03-03 20:11:58,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 793 of 793 statements. [2025-03-03 20:11:58,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:58,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:58,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 1783 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:11:58,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:11:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 30752 trivial. 0 not checked. [2025-03-03 20:11:58,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:11:58,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987378138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:58,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:11:58,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:11:58,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789447976] [2025-03-03 20:11:58,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:58,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:11:58,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:58,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:11:58,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:11:58,654 INFO L87 Difference]: Start difference. First operand has 404 states, 276 states have (on average 1.5724637681159421) internal successors, (434), 277 states have internal predecessors, (434), 125 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) [2025-03-03 20:11:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:58,734 INFO L93 Difference]: Finished difference Result 801 states and 1486 transitions. [2025-03-03 20:11:58,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:11:58,736 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) Word has length 793 [2025-03-03 20:11:58,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:58,746 INFO L225 Difference]: With dead ends: 801 [2025-03-03 20:11:58,747 INFO L226 Difference]: Without dead ends: 400 [2025-03-03 20:11:58,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 794 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:11:58,754 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:58,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 650 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:11:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-03 20:11:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-03-03 20:11:58,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 273 states have (on average 1.5567765567765568) internal successors, (425), 273 states have internal predecessors, (425), 125 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2025-03-03 20:11:58,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 675 transitions. [2025-03-03 20:11:58,849 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 675 transitions. Word has length 793 [2025-03-03 20:11:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:58,851 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 675 transitions. [2025-03-03 20:11:58,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) [2025-03-03 20:11:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 675 transitions. [2025-03-03 20:11:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2025-03-03 20:11:58,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:58,868 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:58,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:11:59,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:11:59,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:59,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash -839484670, now seen corresponding path program 1 times [2025-03-03 20:11:59,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:59,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261841289] [2025-03-03 20:11:59,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:59,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-03-03 20:11:59,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-03-03 20:11:59,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:59,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:11:59,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:59,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261841289] [2025-03-03 20:11:59,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261841289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:59,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:59,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:59,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344433862] [2025-03-03 20:11:59,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:59,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:59,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:59,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:59,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:59,746 INFO L87 Difference]: Start difference. First operand 400 states and 675 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:11:59,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:59,892 INFO L93 Difference]: Finished difference Result 1066 states and 1805 transitions. [2025-03-03 20:11:59,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:59,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 794 [2025-03-03 20:11:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:59,899 INFO L225 Difference]: With dead ends: 1066 [2025-03-03 20:11:59,899 INFO L226 Difference]: Without dead ends: 669 [2025-03-03 20:11:59,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:59,901 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 450 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:59,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1396 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:59,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-03 20:11:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 666. [2025-03-03 20:11:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 489 states have (on average 1.586912065439673) internal successors, (776), 490 states have internal predecessors, (776), 174 states have call successors, (174), 2 states have call predecessors, (174), 2 states have return successors, (174), 173 states have call predecessors, (174), 174 states have call successors, (174) [2025-03-03 20:11:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1124 transitions. [2025-03-03 20:11:59,950 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1124 transitions. Word has length 794 [2025-03-03 20:11:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:59,952 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1124 transitions. [2025-03-03 20:11:59,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:11:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1124 transitions. [2025-03-03 20:11:59,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2025-03-03 20:11:59,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:59,962 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:59,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:11:59,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:59,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:59,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1809775677, now seen corresponding path program 1 times [2025-03-03 20:11:59,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:59,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288860504] [2025-03-03 20:11:59,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:59,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:00,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-03-03 20:12:00,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-03-03 20:12:00,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:00,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:12:00,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:00,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288860504] [2025-03-03 20:12:00,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288860504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:00,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:00,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:00,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700814378] [2025-03-03 20:12:00,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:00,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:00,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:00,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:00,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:00,376 INFO L87 Difference]: Start difference. First operand 666 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:00,515 INFO L93 Difference]: Finished difference Result 1845 states and 3113 transitions. [2025-03-03 20:12:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:00,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 794 [2025-03-03 20:12:00,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:00,528 INFO L225 Difference]: With dead ends: 1845 [2025-03-03 20:12:00,528 INFO L226 Difference]: Without dead ends: 1182 [2025-03-03 20:12:00,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:00,532 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 467 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:00,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1276 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-03-03 20:12:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1179. [2025-03-03 20:12:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 874 states have (on average 1.5812356979405033) internal successors, (1382), 877 states have internal predecessors, (1382), 300 states have call successors, (300), 4 states have call predecessors, (300), 4 states have return successors, (300), 297 states have call predecessors, (300), 300 states have call successors, (300) [2025-03-03 20:12:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1982 transitions. [2025-03-03 20:12:00,615 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1982 transitions. Word has length 794 [2025-03-03 20:12:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:00,619 INFO L471 AbstractCegarLoop]: Abstraction has 1179 states and 1982 transitions. [2025-03-03 20:12:00,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1982 transitions. [2025-03-03 20:12:00,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2025-03-03 20:12:00,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:00,626 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:00,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:12:00,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:00,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:00,628 INFO L85 PathProgramCache]: Analyzing trace with hash -827430778, now seen corresponding path program 1 times [2025-03-03 20:12:00,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:00,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275158400] [2025-03-03 20:12:00,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:00,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:00,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-03-03 20:12:00,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-03-03 20:12:00,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:00,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:12:00,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:00,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275158400] [2025-03-03 20:12:00,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275158400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:00,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:00,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:00,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338260678] [2025-03-03 20:12:00,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:00,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:00,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:00,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:00,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:00,927 INFO L87 Difference]: Start difference. First operand 1179 states and 1982 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:01,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:01,078 INFO L93 Difference]: Finished difference Result 3363 states and 5650 transitions. [2025-03-03 20:12:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:01,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 794 [2025-03-03 20:12:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:01,092 INFO L225 Difference]: With dead ends: 3363 [2025-03-03 20:12:01,092 INFO L226 Difference]: Without dead ends: 2187 [2025-03-03 20:12:01,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:01,098 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 453 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:01,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1477 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:01,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2025-03-03 20:12:01,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2183. [2025-03-03 20:12:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 1626 states have (on average 1.5719557195571956) internal successors, (2556), 1633 states have internal predecessors, (2556), 548 states have call successors, (548), 8 states have call predecessors, (548), 8 states have return successors, (548), 541 states have call predecessors, (548), 548 states have call successors, (548) [2025-03-03 20:12:01,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3652 transitions. [2025-03-03 20:12:01,243 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3652 transitions. Word has length 794 [2025-03-03 20:12:01,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:01,244 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 3652 transitions. [2025-03-03 20:12:01,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:01,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3652 transitions. [2025-03-03 20:12:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2025-03-03 20:12:01,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:01,252 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:01,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:12:01,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:01,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:01,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1435507641, now seen corresponding path program 1 times [2025-03-03 20:12:01,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:01,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499678585] [2025-03-03 20:12:01,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:01,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:01,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-03-03 20:12:01,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-03-03 20:12:01,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:01,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:12:01,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:01,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499678585] [2025-03-03 20:12:01,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499678585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:01,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:01,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:12:01,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564224118] [2025-03-03 20:12:01,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:01,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:12:01,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:01,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:12:01,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:01,815 INFO L87 Difference]: Start difference. First operand 2183 states and 3652 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:01,943 INFO L93 Difference]: Finished difference Result 4443 states and 7445 transitions. [2025-03-03 20:12:01,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:12:01,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 794 [2025-03-03 20:12:01,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:01,958 INFO L225 Difference]: With dead ends: 4443 [2025-03-03 20:12:01,959 INFO L226 Difference]: Without dead ends: 2263 [2025-03-03 20:12:01,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:01,965 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 12 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:01,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1298 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:01,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2025-03-03 20:12:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2215. [2025-03-03 20:12:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 1658 states have (on average 1.5705669481302775) internal successors, (2604), 1665 states have internal predecessors, (2604), 548 states have call successors, (548), 8 states have call predecessors, (548), 8 states have return successors, (548), 541 states have call predecessors, (548), 548 states have call successors, (548) [2025-03-03 20:12:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 3700 transitions. [2025-03-03 20:12:02,078 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 3700 transitions. Word has length 794 [2025-03-03 20:12:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:02,094 INFO L471 AbstractCegarLoop]: Abstraction has 2215 states and 3700 transitions. [2025-03-03 20:12:02,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:02,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 3700 transitions. [2025-03-03 20:12:02,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-03-03 20:12:02,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:02,105 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:02,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:12:02,107 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:02,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:02,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2132862302, now seen corresponding path program 1 times [2025-03-03 20:12:02,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:02,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682944334] [2025-03-03 20:12:02,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:02,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:02,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-03-03 20:12:02,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-03-03 20:12:02,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:02,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:12:02,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:02,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682944334] [2025-03-03 20:12:02,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682944334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:02,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:02,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:12:02,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125551881] [2025-03-03 20:12:02,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:02,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:12:02,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:02,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:12:02,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:02,595 INFO L87 Difference]: Start difference. First operand 2215 states and 3700 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:02,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:02,720 INFO L93 Difference]: Finished difference Result 4507 states and 7541 transitions. [2025-03-03 20:12:02,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:12:02,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-03-03 20:12:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:02,736 INFO L225 Difference]: With dead ends: 4507 [2025-03-03 20:12:02,736 INFO L226 Difference]: Without dead ends: 2295 [2025-03-03 20:12:02,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:02,744 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 12 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:02,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1306 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:02,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2025-03-03 20:12:02,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2215. [2025-03-03 20:12:02,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 1658 states have (on average 1.5705669481302775) internal successors, (2604), 1665 states have internal predecessors, (2604), 548 states have call successors, (548), 8 states have call predecessors, (548), 8 states have return successors, (548), 541 states have call predecessors, (548), 548 states have call successors, (548) [2025-03-03 20:12:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 3700 transitions. [2025-03-03 20:12:02,854 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 3700 transitions. Word has length 795 [2025-03-03 20:12:02,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:02,856 INFO L471 AbstractCegarLoop]: Abstraction has 2215 states and 3700 transitions. [2025-03-03 20:12:02,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:02,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 3700 transitions. [2025-03-03 20:12:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-03-03 20:12:02,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:02,862 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:02,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:12:02,863 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:02,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:02,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1295644095, now seen corresponding path program 1 times [2025-03-03 20:12:02,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:02,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351647604] [2025-03-03 20:12:02,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:02,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:02,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-03-03 20:12:02,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-03-03 20:12:02,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:02,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:12:03,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:03,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351647604] [2025-03-03 20:12:03,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351647604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:03,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:03,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:12:03,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442350203] [2025-03-03 20:12:03,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:03,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:12:03,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:03,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:12:03,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:12:03,483 INFO L87 Difference]: Start difference. First operand 2215 states and 3700 transitions. Second operand has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:05,156 INFO L93 Difference]: Finished difference Result 9911 states and 16458 transitions. [2025-03-03 20:12:05,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 20:12:05,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-03-03 20:12:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:05,188 INFO L225 Difference]: With dead ends: 9911 [2025-03-03 20:12:05,189 INFO L226 Difference]: Without dead ends: 7699 [2025-03-03 20:12:05,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:12:05,196 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 3402 mSDsluCounter, 3050 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3402 SdHoareTripleChecker+Valid, 3904 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:05,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3402 Valid, 3904 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 20:12:05,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7699 states. [2025-03-03 20:12:05,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7699 to 6121. [2025-03-03 20:12:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6121 states, 5132 states have (on average 1.627435697583788) internal successors, (8352), 5155 states have internal predecessors, (8352), 960 states have call successors, (960), 28 states have call predecessors, (960), 28 states have return successors, (960), 937 states have call predecessors, (960), 960 states have call successors, (960) [2025-03-03 20:12:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 10272 transitions. [2025-03-03 20:12:05,459 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 10272 transitions. Word has length 795 [2025-03-03 20:12:05,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:05,460 INFO L471 AbstractCegarLoop]: Abstraction has 6121 states and 10272 transitions. [2025-03-03 20:12:05,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 10272 transitions. [2025-03-03 20:12:05,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-03-03 20:12:05,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:05,472 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:05,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:12:05,473 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:05,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:05,473 INFO L85 PathProgramCache]: Analyzing trace with hash 888032832, now seen corresponding path program 1 times [2025-03-03 20:12:05,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:05,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154552831] [2025-03-03 20:12:05,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:05,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:05,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-03-03 20:12:05,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-03-03 20:12:05,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:05,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:12:05,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:05,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154552831] [2025-03-03 20:12:05,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154552831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:05,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:05,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:12:05,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495547914] [2025-03-03 20:12:05,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:05,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:12:05,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:05,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:12:05,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:05,967 INFO L87 Difference]: Start difference. First operand 6121 states and 10272 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:07,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:07,191 INFO L93 Difference]: Finished difference Result 23475 states and 39349 transitions. [2025-03-03 20:12:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:12:07,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-03-03 20:12:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:07,263 INFO L225 Difference]: With dead ends: 23475 [2025-03-03 20:12:07,264 INFO L226 Difference]: Without dead ends: 17357 [2025-03-03 20:12:07,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:07,284 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 1201 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:07,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 1979 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 20:12:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17357 states. [2025-03-03 20:12:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17357 to 6741. [2025-03-03 20:12:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6741 states, 5752 states have (on average 1.6289986091794157) internal successors, (9370), 5775 states have internal predecessors, (9370), 960 states have call successors, (960), 28 states have call predecessors, (960), 28 states have return successors, (960), 937 states have call predecessors, (960), 960 states have call successors, (960) [2025-03-03 20:12:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6741 states to 6741 states and 11290 transitions. [2025-03-03 20:12:07,844 INFO L78 Accepts]: Start accepts. Automaton has 6741 states and 11290 transitions. Word has length 795 [2025-03-03 20:12:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:07,845 INFO L471 AbstractCegarLoop]: Abstraction has 6741 states and 11290 transitions. [2025-03-03 20:12:07,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 6741 states and 11290 transitions. [2025-03-03 20:12:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-03-03 20:12:07,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:07,857 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:07,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:12:07,858 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:07,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:07,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1068704096, now seen corresponding path program 1 times [2025-03-03 20:12:07,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:07,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65571527] [2025-03-03 20:12:07,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:07,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:07,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-03-03 20:12:07,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-03-03 20:12:07,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:07,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:08,187 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:12:08,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:08,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65571527] [2025-03-03 20:12:08,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65571527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:08,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:08,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:08,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361244369] [2025-03-03 20:12:08,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:08,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:08,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:08,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:08,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:08,189 INFO L87 Difference]: Start difference. First operand 6741 states and 11290 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:08,535 INFO L93 Difference]: Finished difference Result 20217 states and 33864 transitions. [2025-03-03 20:12:08,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:08,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-03-03 20:12:08,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:08,584 INFO L225 Difference]: With dead ends: 20217 [2025-03-03 20:12:08,584 INFO L226 Difference]: Without dead ends: 13479 [2025-03-03 20:12:08,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:08,608 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 454 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:08,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1286 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:08,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13479 states. [2025-03-03 20:12:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13479 to 13477. [2025-03-03 20:12:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13477 states, 11500 states have (on average 1.6250434782608696) internal successors, (18688), 11546 states have internal predecessors, (18688), 1920 states have call successors, (1920), 56 states have call predecessors, (1920), 56 states have return successors, (1920), 1874 states have call predecessors, (1920), 1920 states have call successors, (1920) [2025-03-03 20:12:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13477 states to 13477 states and 22528 transitions. [2025-03-03 20:12:09,189 INFO L78 Accepts]: Start accepts. Automaton has 13477 states and 22528 transitions. Word has length 795 [2025-03-03 20:12:09,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:09,190 INFO L471 AbstractCegarLoop]: Abstraction has 13477 states and 22528 transitions. [2025-03-03 20:12:09,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 13477 states and 22528 transitions. [2025-03-03 20:12:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-03-03 20:12:09,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:09,206 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:09,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:12:09,206 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:09,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:09,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1082236897, now seen corresponding path program 1 times [2025-03-03 20:12:09,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:09,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215223435] [2025-03-03 20:12:09,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:09,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:09,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-03-03 20:12:09,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-03-03 20:12:09,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:09,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:12:09,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:09,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215223435] [2025-03-03 20:12:09,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215223435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:09,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:09,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:12:09,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342839949] [2025-03-03 20:12:09,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:09,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:12:09,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:09,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:12:09,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:12:09,665 INFO L87 Difference]: Start difference. First operand 13477 states and 22528 transitions. Second operand has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 2 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) [2025-03-03 20:12:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:12,799 INFO L93 Difference]: Finished difference Result 43594 states and 72579 transitions. [2025-03-03 20:12:12,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 20:12:12,800 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 2 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) Word has length 795 [2025-03-03 20:12:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:12,881 INFO L225 Difference]: With dead ends: 43594 [2025-03-03 20:12:12,882 INFO L226 Difference]: Without dead ends: 30120 [2025-03-03 20:12:12,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:12:12,916 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 3337 mSDsluCounter, 2541 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 1249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3337 SdHoareTripleChecker+Valid, 3756 SdHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1249 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:12,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3337 Valid, 3756 Invalid, 2891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1249 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 20:12:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30120 states. [2025-03-03 20:12:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30120 to 27184. [2025-03-03 20:12:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27184 states, 23106 states have (on average 1.6154245650480394) internal successors, (37326), 23199 states have internal predecessors, (37326), 3947 states have call successors, (3947), 130 states have call predecessors, (3947), 130 states have return successors, (3947), 3854 states have call predecessors, (3947), 3947 states have call successors, (3947) [2025-03-03 20:12:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27184 states to 27184 states and 45220 transitions. [2025-03-03 20:12:13,991 INFO L78 Accepts]: Start accepts. Automaton has 27184 states and 45220 transitions. Word has length 795 [2025-03-03 20:12:13,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:13,992 INFO L471 AbstractCegarLoop]: Abstraction has 27184 states and 45220 transitions. [2025-03-03 20:12:13,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 2 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) [2025-03-03 20:12:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 27184 states and 45220 transitions. [2025-03-03 20:12:14,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-03-03 20:12:14,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:14,027 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:14,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:12:14,027 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:14,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:14,028 INFO L85 PathProgramCache]: Analyzing trace with hash -725610624, now seen corresponding path program 1 times [2025-03-03 20:12:14,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:14,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838889572] [2025-03-03 20:12:14,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:14,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-03-03 20:12:14,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-03-03 20:12:14,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:14,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:12:14,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:14,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838889572] [2025-03-03 20:12:14,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838889572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:14,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:14,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:12:14,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135510754] [2025-03-03 20:12:14,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:14,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:12:14,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:14,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:12:14,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:12:14,538 INFO L87 Difference]: Start difference. First operand 27184 states and 45220 transitions. Second operand has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:18,022 INFO L93 Difference]: Finished difference Result 76634 states and 127187 transitions. [2025-03-03 20:12:18,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 20:12:18,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-03-03 20:12:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:18,170 INFO L225 Difference]: With dead ends: 76634 [2025-03-03 20:12:18,171 INFO L226 Difference]: Without dead ends: 49552 [2025-03-03 20:12:18,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-03-03 20:12:18,227 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 5241 mSDsluCounter, 4254 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 888 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5241 SdHoareTripleChecker+Valid, 5107 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 888 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:18,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5241 Valid, 5107 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [888 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 20:12:18,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49552 states. [2025-03-03 20:12:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49552 to 32136. [2025-03-03 20:12:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32136 states, 27529 states have (on average 1.6192742199135457) internal successors, (44577), 27638 states have internal predecessors, (44577), 4443 states have call successors, (4443), 163 states have call predecessors, (4443), 163 states have return successors, (4443), 4334 states have call predecessors, (4443), 4443 states have call successors, (4443) [2025-03-03 20:12:19,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32136 states to 32136 states and 53463 transitions. [2025-03-03 20:12:19,775 INFO L78 Accepts]: Start accepts. Automaton has 32136 states and 53463 transitions. Word has length 795 [2025-03-03 20:12:19,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:19,776 INFO L471 AbstractCegarLoop]: Abstraction has 32136 states and 53463 transitions. [2025-03-03 20:12:19,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:19,777 INFO L276 IsEmpty]: Start isEmpty. Operand 32136 states and 53463 transitions. [2025-03-03 20:12:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-03-03 20:12:19,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:19,808 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:19,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:12:19,809 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:19,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1458066303, now seen corresponding path program 1 times [2025-03-03 20:12:19,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:19,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688446930] [2025-03-03 20:12:19,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:19,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:19,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-03-03 20:12:19,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-03-03 20:12:19,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:19,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:12:20,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:20,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688446930] [2025-03-03 20:12:20,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688446930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:20,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:20,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:20,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069543833] [2025-03-03 20:12:20,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:20,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:20,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:20,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:20,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:20,363 INFO L87 Difference]: Start difference. First operand 32136 states and 53463 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:23,036 INFO L93 Difference]: Finished difference Result 96196 states and 160065 transitions. [2025-03-03 20:12:23,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:23,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-03-03 20:12:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:23,233 INFO L225 Difference]: With dead ends: 96196 [2025-03-03 20:12:23,233 INFO L226 Difference]: Without dead ends: 64166 [2025-03-03 20:12:23,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:23,296 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 438 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:23,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1290 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:23,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64166 states. [2025-03-03 20:12:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64166 to 63268. [2025-03-03 20:12:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63268 states, 54117 states have (on average 1.6150377884952973) internal successors, (87401), 54334 states have internal predecessors, (87401), 8827 states have call successors, (8827), 323 states have call predecessors, (8827), 323 states have return successors, (8827), 8610 states have call predecessors, (8827), 8827 states have call successors, (8827) [2025-03-03 20:12:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63268 states to 63268 states and 105055 transitions. [2025-03-03 20:12:26,157 INFO L78 Accepts]: Start accepts. Automaton has 63268 states and 105055 transitions. Word has length 795 [2025-03-03 20:12:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:26,158 INFO L471 AbstractCegarLoop]: Abstraction has 63268 states and 105055 transitions. [2025-03-03 20:12:26,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 63268 states and 105055 transitions. [2025-03-03 20:12:26,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-03-03 20:12:26,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:26,207 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:26,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:12:26,207 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:26,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:26,208 INFO L85 PathProgramCache]: Analyzing trace with hash 224363231, now seen corresponding path program 1 times [2025-03-03 20:12:26,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:26,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685079183] [2025-03-03 20:12:26,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:26,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:26,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-03-03 20:12:26,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-03-03 20:12:26,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:26,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:12:26,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:26,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685079183] [2025-03-03 20:12:26,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685079183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:26,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:26,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:26,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516328038] [2025-03-03 20:12:26,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:26,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:26,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:26,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:26,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:26,766 INFO L87 Difference]: Start difference. First operand 63268 states and 105055 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:29,407 INFO L93 Difference]: Finished difference Result 126430 states and 209948 transitions. [2025-03-03 20:12:29,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:29,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-03-03 20:12:29,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:29,567 INFO L225 Difference]: With dead ends: 126430 [2025-03-03 20:12:29,568 INFO L226 Difference]: Without dead ends: 63268 [2025-03-03 20:12:29,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:29,658 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 672 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:29,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 646 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:12:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63268 states. [2025-03-03 20:12:33,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63268 to 63268. [2025-03-03 20:12:33,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63268 states, 54117 states have (on average 1.6108986085703199) internal successors, (87177), 54334 states have internal predecessors, (87177), 8827 states have call successors, (8827), 323 states have call predecessors, (8827), 323 states have return successors, (8827), 8610 states have call predecessors, (8827), 8827 states have call successors, (8827) [2025-03-03 20:12:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63268 states to 63268 states and 104831 transitions. [2025-03-03 20:12:33,348 INFO L78 Accepts]: Start accepts. Automaton has 63268 states and 104831 transitions. Word has length 795 [2025-03-03 20:12:33,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:33,349 INFO L471 AbstractCegarLoop]: Abstraction has 63268 states and 104831 transitions. [2025-03-03 20:12:33,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:33,349 INFO L276 IsEmpty]: Start isEmpty. Operand 63268 states and 104831 transitions. [2025-03-03 20:12:33,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-03-03 20:12:33,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:33,410 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:33,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:12:33,410 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:33,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:33,411 INFO L85 PathProgramCache]: Analyzing trace with hash 353445950, now seen corresponding path program 1 times [2025-03-03 20:12:33,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:33,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376828129] [2025-03-03 20:12:33,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:33,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:33,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-03-03 20:12:33,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-03-03 20:12:33,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:33,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:12:34,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:34,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376828129] [2025-03-03 20:12:34,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376828129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:34,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:34,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:12:34,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811451917] [2025-03-03 20:12:34,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:34,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:12:34,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:34,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:12:34,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:34,022 INFO L87 Difference]: Start difference. First operand 63268 states and 104831 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:39,584 INFO L93 Difference]: Finished difference Result 241210 states and 400390 transitions. [2025-03-03 20:12:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:12:39,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-03-03 20:12:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:39,974 INFO L225 Difference]: With dead ends: 241210 [2025-03-03 20:12:39,974 INFO L226 Difference]: Without dead ends: 178048 [2025-03-03 20:12:40,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:12:40,084 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 997 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:40,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 2573 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:12:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178048 states. [2025-03-03 20:12:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178048 to 89144. [2025-03-03 20:12:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89144 states, 79993 states have (on average 1.6421561886665084) internal successors, (131361), 80210 states have internal predecessors, (131361), 8827 states have call successors, (8827), 323 states have call predecessors, (8827), 323 states have return successors, (8827), 8610 states have call predecessors, (8827), 8827 states have call successors, (8827) [2025-03-03 20:12:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89144 states to 89144 states and 149015 transitions. [2025-03-03 20:12:44,644 INFO L78 Accepts]: Start accepts. Automaton has 89144 states and 149015 transitions. Word has length 795 [2025-03-03 20:12:44,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:44,645 INFO L471 AbstractCegarLoop]: Abstraction has 89144 states and 149015 transitions. [2025-03-03 20:12:44,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:12:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 89144 states and 149015 transitions. [2025-03-03 20:12:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-03-03 20:12:44,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:44,722 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:44,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:12:44,722 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:44,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:44,723 INFO L85 PathProgramCache]: Analyzing trace with hash 564796863, now seen corresponding path program 1 times [2025-03-03 20:12:44,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:44,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037945140] [2025-03-03 20:12:44,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:44,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:44,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-03-03 20:12:44,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-03-03 20:12:44,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:44,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat