./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-72.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 50b59b38b7f87741ee4dcb2a257b93223ac85d7344325d072154171267f073ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:21:55,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:21:56,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:21:56,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:21:56,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:21:56,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:21:56,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:21:56,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:21:56,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:21:56,065 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:21:56,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:21:56,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:21:56,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:21:56,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:21:56,065 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:21:56,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:21:56,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:21:56,067 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:21:56,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:21:56,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:21:56,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:21:56,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:21:56,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:21:56,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:21:56,068 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:21:56,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:21:56,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:21:56,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:21:56,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:21:56,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:21:56,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:21:56,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:21:56,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:21:56,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:21:56,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:21:56,069 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:21:56,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:21:56,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:21:56,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:21:56,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:21:56,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:21:56,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:21:56,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:21:56,069 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 -> 50b59b38b7f87741ee4dcb2a257b93223ac85d7344325d072154171267f073ff [2025-03-08 11:21:56,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:21:56,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:21:56,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:21:56,312 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:21:56,312 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:21:56,313 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-72.i [2025-03-08 11:21:57,504 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63c9d2eda/61fdb5d6a48b4ecc88daf852d781d128/FLAGfbe211e83 [2025-03-08 11:21:57,778 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:21:57,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-72.i [2025-03-08 11:21:57,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63c9d2eda/61fdb5d6a48b4ecc88daf852d781d128/FLAGfbe211e83 [2025-03-08 11:21:57,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63c9d2eda/61fdb5d6a48b4ecc88daf852d781d128 [2025-03-08 11:21:57,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:21:57,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:21:57,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:21:57,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:21:57,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:21:57,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:21:57" (1/1) ... [2025-03-08 11:21:57,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5126683a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:57, skipping insertion in model container [2025-03-08 11:21:57,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:21:57" (1/1) ... [2025-03-08 11:21:57,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:21:57,989 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-72.i[916,929] [2025-03-08 11:21:58,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:21:58,113 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:21:58,123 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-72.i[916,929] [2025-03-08 11:21:58,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:21:58,216 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:21:58,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:58 WrapperNode [2025-03-08 11:21:58,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:21:58,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:21:58,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:21:58,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:21:58,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:58" (1/1) ... [2025-03-08 11:21:58,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:58" (1/1) ... [2025-03-08 11:21:58,293 INFO L138 Inliner]: procedures = 26, calls = 94, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 729 [2025-03-08 11:21:58,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:21:58,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:21:58,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:21:58,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:21:58,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:58" (1/1) ... [2025-03-08 11:21:58,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:58" (1/1) ... [2025-03-08 11:21:58,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:58" (1/1) ... [2025-03-08 11:21:58,345 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:21:58,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:58" (1/1) ... [2025-03-08 11:21:58,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:58" (1/1) ... [2025-03-08 11:21:58,365 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:58" (1/1) ... [2025-03-08 11:21:58,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:58" (1/1) ... [2025-03-08 11:21:58,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:58" (1/1) ... [2025-03-08 11:21:58,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:58" (1/1) ... [2025-03-08 11:21:58,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:21:58,398 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:21:58,399 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:21:58,399 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:21:58,400 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:58" (1/1) ... [2025-03-08 11:21:58,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:21:58,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:21:58,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:21:58,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:21:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:21:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:21:58,450 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:21:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:21:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:21:58,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:21:58,568 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:21:58,570 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:21:59,578 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-08 11:21:59,578 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:21:59,606 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:21:59,606 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:21:59,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:21:59 BoogieIcfgContainer [2025-03-08 11:21:59,611 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:21:59,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:21:59,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:21:59,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:21:59,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:21:57" (1/3) ... [2025-03-08 11:21:59,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5536c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:21:59, skipping insertion in model container [2025-03-08 11:21:59,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:58" (2/3) ... [2025-03-08 11:21:59,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5536c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:21:59, skipping insertion in model container [2025-03-08 11:21:59,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:21:59" (3/3) ... [2025-03-08 11:21:59,621 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-72.i [2025-03-08 11:21:59,633 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:21:59,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-72.i that has 2 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:21:59,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:21:59,698 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;@66dc5ded, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:21:59,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:21:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 218 states have (on average 1.651376146788991) internal successors, (360), 219 states have internal predecessors, (360), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 11:21:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-08 11:21:59,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:59,719 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:21:59,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:59,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:59,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1711141778, now seen corresponding path program 1 times [2025-03-08 11:21:59,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:59,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980616433] [2025-03-08 11:21:59,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:59,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:59,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-08 11:21:59,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-08 11:21:59,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:59,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:00,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2025-03-08 11:22:00,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:00,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980616433] [2025-03-08 11:22:00,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980616433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:22:00,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439876171] [2025-03-08 11:22:00,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:00,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:22:00,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:22:00,218 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:22:00,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:22:00,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-08 11:22:00,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-08 11:22:00,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:00,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:00,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:22:00,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:22:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2025-03-08 11:22:00,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:22:00,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439876171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:00,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:22:00,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:22:00,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653078285] [2025-03-08 11:22:00,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:00,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:22:00,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:00,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:22:00,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:22:00,608 INFO L87 Difference]: Start difference. First operand has 302 states, 218 states have (on average 1.651376146788991) internal successors, (360), 219 states have internal predecessors, (360), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-08 11:22:00,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:00,669 INFO L93 Difference]: Finished difference Result 596 states and 1116 transitions. [2025-03-08 11:22:00,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:22:00,674 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) Word has length 532 [2025-03-08 11:22:00,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:00,682 INFO L225 Difference]: With dead ends: 596 [2025-03-08 11:22:00,682 INFO L226 Difference]: Without dead ends: 297 [2025-03-08 11:22:00,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:22:00,693 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:00,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 497 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:22:00,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-08 11:22:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-03-08 11:22:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 214 states have (on average 1.6308411214953271) internal successors, (349), 214 states have internal predecessors, (349), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 11:22:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 511 transitions. [2025-03-08 11:22:00,748 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 511 transitions. Word has length 532 [2025-03-08 11:22:00,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:00,749 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 511 transitions. [2025-03-08 11:22:00,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-08 11:22:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 511 transitions. [2025-03-08 11:22:00,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-08 11:22:00,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:00,761 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:22:00,770 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-08 11:22:00,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:22:00,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:00,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:00,967 INFO L85 PathProgramCache]: Analyzing trace with hash 297421096, now seen corresponding path program 1 times [2025-03-08 11:22:00,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:00,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830319858] [2025-03-08 11:22:00,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:00,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:01,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-08 11:22:01,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-08 11:22:01,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:01,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-08 11:22:01,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:01,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830319858] [2025-03-08 11:22:01,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830319858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:01,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:01,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:01,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350439839] [2025-03-08 11:22:01,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:01,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:01,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:01,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:01,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:01,450 INFO L87 Difference]: Start difference. First operand 297 states and 511 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:01,561 INFO L93 Difference]: Finished difference Result 775 states and 1344 transitions. [2025-03-08 11:22:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:01,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 532 [2025-03-08 11:22:01,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:01,568 INFO L225 Difference]: With dead ends: 775 [2025-03-08 11:22:01,570 INFO L226 Difference]: Without dead ends: 481 [2025-03-08 11:22:01,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:01,572 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 328 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:01,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1008 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:22:01,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-08 11:22:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 478. [2025-03-08 11:22:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 377 states have (on average 1.6816976127320955) internal successors, (634), 378 states have internal predecessors, (634), 98 states have call successors, (98), 2 states have call predecessors, (98), 2 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-08 11:22:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 830 transitions. [2025-03-08 11:22:01,626 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 830 transitions. Word has length 532 [2025-03-08 11:22:01,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:01,628 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 830 transitions. [2025-03-08 11:22:01,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 830 transitions. [2025-03-08 11:22:01,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-08 11:22:01,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:01,634 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:22:01,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:22:01,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:01,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:01,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1030726102, now seen corresponding path program 1 times [2025-03-08 11:22:01,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:01,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195530981] [2025-03-08 11:22:01,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:01,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:01,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-08 11:22:01,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-08 11:22:01,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:01,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:01,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-08 11:22:01,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:01,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195530981] [2025-03-08 11:22:01,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195530981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:01,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:01,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:01,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478109136] [2025-03-08 11:22:01,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:01,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:01,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:01,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:01,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:01,925 INFO L87 Difference]: Start difference. First operand 478 states and 830 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:02,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:02,059 INFO L93 Difference]: Finished difference Result 1418 states and 2467 transitions. [2025-03-08 11:22:02,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:02,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 532 [2025-03-08 11:22:02,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:02,070 INFO L225 Difference]: With dead ends: 1418 [2025-03-08 11:22:02,071 INFO L226 Difference]: Without dead ends: 943 [2025-03-08 11:22:02,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:02,073 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 485 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:02,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 977 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:22:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-08 11:22:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 929. [2025-03-08 11:22:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 728 states have (on average 1.6744505494505495) internal successors, (1219), 730 states have internal predecessors, (1219), 196 states have call successors, (196), 4 states have call predecessors, (196), 4 states have return successors, (196), 194 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-08 11:22:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1611 transitions. [2025-03-08 11:22:02,163 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1611 transitions. Word has length 532 [2025-03-08 11:22:02,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:02,166 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1611 transitions. [2025-03-08 11:22:02,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1611 transitions. [2025-03-08 11:22:02,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-08 11:22:02,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:02,174 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:22:02,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:22:02,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:02,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:02,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1467709800, now seen corresponding path program 1 times [2025-03-08 11:22:02,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:02,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953642194] [2025-03-08 11:22:02,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:02,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:02,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-08 11:22:02,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-08 11:22:02,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:02,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-08 11:22:02,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:02,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953642194] [2025-03-08 11:22:02,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953642194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:02,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:02,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:02,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621190501] [2025-03-08 11:22:02,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:02,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:02,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:02,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:02,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:02,439 INFO L87 Difference]: Start difference. First operand 929 states and 1611 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:02,555 INFO L93 Difference]: Finished difference Result 2587 states and 4496 transitions. [2025-03-08 11:22:02,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:02,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 532 [2025-03-08 11:22:02,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:02,567 INFO L225 Difference]: With dead ends: 2587 [2025-03-08 11:22:02,568 INFO L226 Difference]: Without dead ends: 1661 [2025-03-08 11:22:02,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:02,572 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 342 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:02,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 979 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:22:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2025-03-08 11:22:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1657. [2025-03-08 11:22:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1350 states have (on average 1.6837037037037037) internal successors, (2273), 1356 states have internal predecessors, (2273), 298 states have call successors, (298), 8 states have call predecessors, (298), 8 states have return successors, (298), 292 states have call predecessors, (298), 298 states have call successors, (298) [2025-03-08 11:22:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2869 transitions. [2025-03-08 11:22:02,703 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2869 transitions. Word has length 532 [2025-03-08 11:22:02,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:02,704 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2869 transitions. [2025-03-08 11:22:02,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2869 transitions. [2025-03-08 11:22:02,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-08 11:22:02,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:02,711 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:22:02,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:22:02,711 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:02,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:02,712 INFO L85 PathProgramCache]: Analyzing trace with hash 342163111, now seen corresponding path program 1 times [2025-03-08 11:22:02,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:02,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354071138] [2025-03-08 11:22:02,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:02,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:02,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-08 11:22:02,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-08 11:22:02,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:02,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-08 11:22:02,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:02,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354071138] [2025-03-08 11:22:02,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354071138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:02,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:02,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:02,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904234855] [2025-03-08 11:22:02,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:02,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:02,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:02,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:02,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:02,921 INFO L87 Difference]: Start difference. First operand 1657 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:03,066 INFO L93 Difference]: Finished difference Result 4503 states and 7778 transitions. [2025-03-08 11:22:03,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:03,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 532 [2025-03-08 11:22:03,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:03,079 INFO L225 Difference]: With dead ends: 4503 [2025-03-08 11:22:03,080 INFO L226 Difference]: Without dead ends: 2849 [2025-03-08 11:22:03,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:03,084 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 289 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:03,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1222 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:22:03,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2025-03-08 11:22:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2845. [2025-03-08 11:22:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 2310 states have (on average 1.6696969696969697) internal successors, (3857), 2324 states have internal predecessors, (3857), 518 states have call successors, (518), 16 states have call predecessors, (518), 16 states have return successors, (518), 504 states have call predecessors, (518), 518 states have call successors, (518) [2025-03-08 11:22:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 4893 transitions. [2025-03-08 11:22:03,222 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 4893 transitions. Word has length 532 [2025-03-08 11:22:03,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:03,223 INFO L471 AbstractCegarLoop]: Abstraction has 2845 states and 4893 transitions. [2025-03-08 11:22:03,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 4893 transitions. [2025-03-08 11:22:03,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-08 11:22:03,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:03,230 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:22:03,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:22:03,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:03,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:03,231 INFO L85 PathProgramCache]: Analyzing trace with hash -824533208, now seen corresponding path program 1 times [2025-03-08 11:22:03,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:03,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818067415] [2025-03-08 11:22:03,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:03,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:03,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-08 11:22:03,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-08 11:22:03,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:03,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-08 11:22:03,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:03,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818067415] [2025-03-08 11:22:03,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818067415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:03,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:03,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:03,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459946969] [2025-03-08 11:22:03,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:03,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:03,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:03,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:03,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:03,629 INFO L87 Difference]: Start difference. First operand 2845 states and 4893 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:03,772 INFO L93 Difference]: Finished difference Result 5929 states and 10136 transitions. [2025-03-08 11:22:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:03,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 532 [2025-03-08 11:22:03,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:03,788 INFO L225 Difference]: With dead ends: 5929 [2025-03-08 11:22:03,789 INFO L226 Difference]: Without dead ends: 3087 [2025-03-08 11:22:03,796 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-08 11:22:03,797 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 18 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:03,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 991 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:22:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2025-03-08 11:22:03,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 2909. [2025-03-08 11:22:03,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2909 states, 2374 states have (on average 1.665122156697557) internal successors, (3953), 2388 states have internal predecessors, (3953), 518 states have call successors, (518), 16 states have call predecessors, (518), 16 states have return successors, (518), 504 states have call predecessors, (518), 518 states have call successors, (518) [2025-03-08 11:22:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 4989 transitions. [2025-03-08 11:22:03,984 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 4989 transitions. Word has length 532 [2025-03-08 11:22:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:03,986 INFO L471 AbstractCegarLoop]: Abstraction has 2909 states and 4989 transitions. [2025-03-08 11:22:03,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 4989 transitions. [2025-03-08 11:22:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-08 11:22:03,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:03,994 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:22:03,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:22:03,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:03,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash 673096475, now seen corresponding path program 1 times [2025-03-08 11:22:03,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:03,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643747456] [2025-03-08 11:22:03,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:03,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:04,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-08 11:22:04,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-08 11:22:04,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:04,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:04,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-08 11:22:04,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:04,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643747456] [2025-03-08 11:22:04,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643747456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:04,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:04,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:22:04,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064894772] [2025-03-08 11:22:04,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:04,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:22:04,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:04,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:22:04,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:22:04,313 INFO L87 Difference]: Start difference. First operand 2909 states and 4989 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-08 11:22:04,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:04,784 INFO L93 Difference]: Finished difference Result 8657 states and 14865 transitions. [2025-03-08 11:22:04,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:22:04,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) Word has length 533 [2025-03-08 11:22:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:04,819 INFO L225 Difference]: With dead ends: 8657 [2025-03-08 11:22:04,819 INFO L226 Difference]: Without dead ends: 5751 [2025-03-08 11:22:04,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:22:04,832 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 897 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:04,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 970 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:22:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5751 states. [2025-03-08 11:22:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5751 to 2909. [2025-03-08 11:22:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2909 states, 2374 states have (on average 1.665122156697557) internal successors, (3953), 2388 states have internal predecessors, (3953), 518 states have call successors, (518), 16 states have call predecessors, (518), 16 states have return successors, (518), 504 states have call predecessors, (518), 518 states have call successors, (518) [2025-03-08 11:22:05,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 4989 transitions. [2025-03-08 11:22:05,088 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 4989 transitions. Word has length 533 [2025-03-08 11:22:05,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:05,089 INFO L471 AbstractCegarLoop]: Abstraction has 2909 states and 4989 transitions. [2025-03-08 11:22:05,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-08 11:22:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 4989 transitions. [2025-03-08 11:22:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-08 11:22:05,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:05,096 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:22:05,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:22:05,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:05,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:05,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2006510077, now seen corresponding path program 1 times [2025-03-08 11:22:05,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:05,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21630350] [2025-03-08 11:22:05,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:05,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:05,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-08 11:22:05,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-08 11:22:05,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:05,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-08 11:22:05,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:05,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21630350] [2025-03-08 11:22:05,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21630350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:05,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:05,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:22:05,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120008847] [2025-03-08 11:22:05,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:05,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:22:05,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:05,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:22:05,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:22:05,422 INFO L87 Difference]: Start difference. First operand 2909 states and 4989 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:06,386 INFO L93 Difference]: Finished difference Result 13789 states and 23680 transitions. [2025-03-08 11:22:06,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:22:06,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 533 [2025-03-08 11:22:06,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:06,440 INFO L225 Difference]: With dead ends: 13789 [2025-03-08 11:22:06,440 INFO L226 Difference]: Without dead ends: 10883 [2025-03-08 11:22:06,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:22:06,453 INFO L435 NwaCegarLoop]: 1069 mSDtfsCounter, 1092 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:06,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 2219 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:22:06,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10883 states. [2025-03-08 11:22:07,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10883 to 10839. [2025-03-08 11:22:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10839 states, 9034 states have (on average 1.6702457383218952) internal successors, (15089), 9094 states have internal predecessors, (15089), 1740 states have call successors, (1740), 64 states have call predecessors, (1740), 64 states have return successors, (1740), 1680 states have call predecessors, (1740), 1740 states have call successors, (1740) [2025-03-08 11:22:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 18569 transitions. [2025-03-08 11:22:07,091 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 18569 transitions. Word has length 533 [2025-03-08 11:22:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:07,092 INFO L471 AbstractCegarLoop]: Abstraction has 10839 states and 18569 transitions. [2025-03-08 11:22:07,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 18569 transitions. [2025-03-08 11:22:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-08 11:22:07,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:07,108 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:22:07,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:22:07,108 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:07,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:07,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1039174290, now seen corresponding path program 1 times [2025-03-08 11:22:07,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:07,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639456364] [2025-03-08 11:22:07,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:07,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:07,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-08 11:22:07,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-08 11:22:07,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:07,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-08 11:22:07,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:07,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639456364] [2025-03-08 11:22:07,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639456364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:07,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:07,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:07,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020338180] [2025-03-08 11:22:07,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:07,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:07,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:07,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:07,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:07,420 INFO L87 Difference]: Start difference. First operand 10839 states and 18569 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:07,758 INFO L93 Difference]: Finished difference Result 21675 states and 37135 transitions. [2025-03-08 11:22:07,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:07,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 534 [2025-03-08 11:22:07,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:07,805 INFO L225 Difference]: With dead ends: 21675 [2025-03-08 11:22:07,805 INFO L226 Difference]: Without dead ends: 10839 [2025-03-08 11:22:07,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:07,837 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 0 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:07,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 987 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:22:07,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10839 states. [2025-03-08 11:22:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10839 to 10839. [2025-03-08 11:22:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10839 states, 9034 states have (on average 1.6631613903032987) internal successors, (15025), 9094 states have internal predecessors, (15025), 1740 states have call successors, (1740), 64 states have call predecessors, (1740), 64 states have return successors, (1740), 1680 states have call predecessors, (1740), 1740 states have call successors, (1740) [2025-03-08 11:22:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 18505 transitions. [2025-03-08 11:22:08,402 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 18505 transitions. Word has length 534 [2025-03-08 11:22:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:08,403 INFO L471 AbstractCegarLoop]: Abstraction has 10839 states and 18505 transitions. [2025-03-08 11:22:08,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 18505 transitions. [2025-03-08 11:22:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-08 11:22:08,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:08,422 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:22:08,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:22:08,423 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:08,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash 235994258, now seen corresponding path program 1 times [2025-03-08 11:22:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:08,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280505657] [2025-03-08 11:22:08,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:08,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-08 11:22:08,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-08 11:22:08,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:08,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-08 11:22:09,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:09,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280505657] [2025-03-08 11:22:09,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280505657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:09,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:09,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 11:22:09,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441429312] [2025-03-08 11:22:09,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:09,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:22:09,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:09,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:22:09,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:22:09,948 INFO L87 Difference]: Start difference. First operand 10839 states and 18505 transitions. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 3 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) [2025-03-08 11:22:12,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:12,264 INFO L93 Difference]: Finished difference Result 39464 states and 66663 transitions. [2025-03-08 11:22:12,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:22:12,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 3 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) Word has length 535 [2025-03-08 11:22:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:12,366 INFO L225 Difference]: With dead ends: 39464 [2025-03-08 11:22:12,366 INFO L226 Difference]: Without dead ends: 28628 [2025-03-08 11:22:12,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:22:12,400 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 1658 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 2073 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:12,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 2073 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 11:22:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28628 states. [2025-03-08 11:22:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28628 to 28562. [2025-03-08 11:22:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28562 states, 23057 states have (on average 1.625016264041289) internal successors, (37468), 23278 states have internal predecessors, (37468), 5279 states have call successors, (5279), 225 states have call predecessors, (5279), 225 states have return successors, (5279), 5058 states have call predecessors, (5279), 5279 states have call successors, (5279) [2025-03-08 11:22:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28562 states to 28562 states and 48026 transitions. [2025-03-08 11:22:13,984 INFO L78 Accepts]: Start accepts. Automaton has 28562 states and 48026 transitions. Word has length 535 [2025-03-08 11:22:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:13,985 INFO L471 AbstractCegarLoop]: Abstraction has 28562 states and 48026 transitions. [2025-03-08 11:22:13,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 3 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) [2025-03-08 11:22:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 28562 states and 48026 transitions. [2025-03-08 11:22:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-08 11:22:14,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:14,021 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:22:14,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:22:14,021 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:14,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:14,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1423941805, now seen corresponding path program 1 times [2025-03-08 11:22:14,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:14,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616707022] [2025-03-08 11:22:14,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:14,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:14,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-08 11:22:14,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-08 11:22:14,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:14,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-08 11:22:14,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:14,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616707022] [2025-03-08 11:22:14,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616707022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:14,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:14,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:22:14,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326018245] [2025-03-08 11:22:14,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:14,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:22:14,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:14,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:22:14,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:22:14,417 INFO L87 Difference]: Start difference. First operand 28562 states and 48026 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:18,185 INFO L93 Difference]: Finished difference Result 114098 states and 191876 transitions. [2025-03-08 11:22:18,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:22:18,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 535 [2025-03-08 11:22:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:18,487 INFO L225 Difference]: With dead ends: 114098 [2025-03-08 11:22:18,487 INFO L226 Difference]: Without dead ends: 85586 [2025-03-08 11:22:18,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:22:18,563 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 959 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:18,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 1425 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:22:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85586 states. [2025-03-08 11:22:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85586 to 85582. [2025-03-08 11:22:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85582 states, 69125 states have (on average 1.6233490054249549) internal successors, (112214), 69786 states have internal predecessors, (112214), 15783 states have call successors, (15783), 673 states have call predecessors, (15783), 673 states have return successors, (15783), 15122 states have call predecessors, (15783), 15783 states have call successors, (15783) [2025-03-08 11:22:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85582 states to 85582 states and 143780 transitions. [2025-03-08 11:22:23,184 INFO L78 Accepts]: Start accepts. Automaton has 85582 states and 143780 transitions. Word has length 535 [2025-03-08 11:22:23,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:23,185 INFO L471 AbstractCegarLoop]: Abstraction has 85582 states and 143780 transitions. [2025-03-08 11:22:23,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:23,185 INFO L276 IsEmpty]: Start isEmpty. Operand 85582 states and 143780 transitions. [2025-03-08 11:22:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-08 11:22:23,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:23,268 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:22:23,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:22:23,269 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:23,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:23,270 INFO L85 PathProgramCache]: Analyzing trace with hash -247681069, now seen corresponding path program 1 times [2025-03-08 11:22:23,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:23,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852950852] [2025-03-08 11:22:23,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:23,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:23,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-08 11:22:23,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-08 11:22:23,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:23,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-08 11:22:23,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:23,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852950852] [2025-03-08 11:22:23,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852950852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:23,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:23,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:23,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296024199] [2025-03-08 11:22:23,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:23,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:23,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:23,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:23,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:23,456 INFO L87 Difference]: Start difference. First operand 85582 states and 143780 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-08 11:22:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:29,058 INFO L93 Difference]: Finished difference Result 221468 states and 369577 transitions. [2025-03-08 11:22:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:29,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 535 [2025-03-08 11:22:29,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:29,511 INFO L225 Difference]: With dead ends: 221468 [2025-03-08 11:22:29,511 INFO L226 Difference]: Without dead ends: 135936 [2025-03-08 11:22:29,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:29,694 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 275 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:29,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1065 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:22:29,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135936 states.