./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-75.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 5f27064a0b5796ba4fcefa469388f6a0b44b51572a6c95971fa540335b609a62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:10:51,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:10:51,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:10:51,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:10:51,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:10:51,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:10:51,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:10:51,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:10:51,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:10:51,442 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:10:51,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:10:51,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:10:51,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:10:51,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:10:51,443 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:10:51,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:10:51,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:10:51,444 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:10:51,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:10:51,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:10:51,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:10:51,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:10:51,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:10:51,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:10:51,444 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:10:51,445 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:10:51,445 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:10:51,445 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:10:51,445 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:10:51,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:10:51,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:10:51,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:10:51,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:51,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:10:51,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:10:51,446 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:10:51,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:10:51,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:10:51,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:10:51,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:10:51,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:10:51,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:10:51,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:10:51,446 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 -> 5f27064a0b5796ba4fcefa469388f6a0b44b51572a6c95971fa540335b609a62 [2025-03-03 20:10:51,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:10:51,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:10:51,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:10:51,676 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:10:51,676 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:10:51,677 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-75.i [2025-03-03 20:10:52,789 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba18b1791/00f27f0cc210408ea2b5c380e3f534c5/FLAGfeeb6db13 [2025-03-03 20:10:53,124 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:10:53,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-75.i [2025-03-03 20:10:53,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba18b1791/00f27f0cc210408ea2b5c380e3f534c5/FLAGfeeb6db13 [2025-03-03 20:10:53,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba18b1791/00f27f0cc210408ea2b5c380e3f534c5 [2025-03-03 20:10:53,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:10:53,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:10:53,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:53,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:10:53,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:10:53,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:53" (1/1) ... [2025-03-03 20:10:53,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47254d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:53, skipping insertion in model container [2025-03-03 20:10:53,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:53" (1/1) ... [2025-03-03 20:10:53,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:10:53,300 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-75.i[916,929] [2025-03-03 20:10:53,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:53,490 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:10:53,500 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-75.i[916,929] [2025-03-03 20:10:53,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:53,580 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:10:53,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:53 WrapperNode [2025-03-03 20:10:53,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:53,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:53,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:10:53,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:10:53,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:53" (1/1) ... [2025-03-03 20:10:53,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:53" (1/1) ... [2025-03-03 20:10:53,666 INFO L138 Inliner]: procedures = 26, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1113 [2025-03-03 20:10:53,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:53,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:10:53,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:10:53,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:10:53,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:53" (1/1) ... [2025-03-03 20:10:53,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:53" (1/1) ... [2025-03-03 20:10:53,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:53" (1/1) ... [2025-03-03 20:10:53,723 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:10:53,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:53" (1/1) ... [2025-03-03 20:10:53,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:53" (1/1) ... [2025-03-03 20:10:53,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:53" (1/1) ... [2025-03-03 20:10:53,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:53" (1/1) ... [2025-03-03 20:10:53,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:53" (1/1) ... [2025-03-03 20:10:53,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:53" (1/1) ... [2025-03-03 20:10:53,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:10:53,773 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:10:53,773 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:10:53,774 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:10:53,774 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:53" (1/1) ... [2025-03-03 20:10:53,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:53,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:53,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:10:53,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:10:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:10:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:10:53,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:10:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:10:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:10:53,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:10:53,966 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:10:53,968 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:10:54,884 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L758: havoc property_#t~bitwise114#1;havoc property_#t~ite116#1;havoc property_#t~bitwise115#1;havoc property_#t~short117#1; [2025-03-03 20:10:55,111 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-03 20:10:55,111 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:10:55,150 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:10:55,151 INFO L336 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-03 20:10:55,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:55 BoogieIcfgContainer [2025-03-03 20:10:55,152 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:10:55,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:10:55,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:10:55,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:10:55,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:10:53" (1/3) ... [2025-03-03 20:10:55,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5897d922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:55, skipping insertion in model container [2025-03-03 20:10:55,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:53" (2/3) ... [2025-03-03 20:10:55,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5897d922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:55, skipping insertion in model container [2025-03-03 20:10:55,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:55" (3/3) ... [2025-03-03 20:10:55,159 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-75.i [2025-03-03 20:10:55,168 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:10:55,170 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-75.i that has 2 procedures, 444 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:10:55,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:10:55,238 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;@370ca885, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:10:55,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:10:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 444 states, 318 states have (on average 1.5628930817610063) internal successors, (497), 319 states have internal predecessors, (497), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) [2025-03-03 20:10:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2025-03-03 20:10:55,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:55,282 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:55,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:55,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:55,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1874437340, now seen corresponding path program 1 times [2025-03-03 20:10:55,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:55,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552732121] [2025-03-03 20:10:55,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:55,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:55,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 787 statements into 1 equivalence classes. [2025-03-03 20:10:55,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 787 of 787 statements. [2025-03-03 20:10:55,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:55,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 29768 trivial. 0 not checked. [2025-03-03 20:10:55,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:55,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552732121] [2025-03-03 20:10:55,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552732121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:10:55,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013369954] [2025-03-03 20:10:55,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:55,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:10:55,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:55,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:10:55,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:10:56,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 787 statements into 1 equivalence classes. [2025-03-03 20:10:56,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 787 of 787 statements. [2025-03-03 20:10:56,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:56,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:56,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 1778 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:10:56,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:10:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 29768 trivial. 0 not checked. [2025-03-03 20:10:56,383 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:10:56,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013369954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:56,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:10:56,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:10:56,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464523163] [2025-03-03 20:10:56,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:56,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:10:56,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:56,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:10:56,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:10:56,412 INFO L87 Difference]: Start difference. First operand has 444 states, 318 states have (on average 1.5628930817610063) internal successors, (497), 319 states have internal predecessors, (497), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) Second operand has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 2 states have call successors, (123) [2025-03-03 20:10:56,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:56,526 INFO L93 Difference]: Finished difference Result 882 states and 1604 transitions. [2025-03-03 20:10:56,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:10:56,529 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 2 states have call successors, (123) Word has length 787 [2025-03-03 20:10:56,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:56,539 INFO L225 Difference]: With dead ends: 882 [2025-03-03 20:10:56,539 INFO L226 Difference]: Without dead ends: 441 [2025-03-03 20:10:56,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 788 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:10:56,550 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:56,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 703 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:56,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-03 20:10:56,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-03-03 20:10:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 316 states have (on average 1.5537974683544304) internal successors, (491), 316 states have internal predecessors, (491), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) [2025-03-03 20:10:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 737 transitions. [2025-03-03 20:10:56,640 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 737 transitions. Word has length 787 [2025-03-03 20:10:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:56,640 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 737 transitions. [2025-03-03 20:10:56,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 2 states have call successors, (123) [2025-03-03 20:10:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 737 transitions. [2025-03-03 20:10:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2025-03-03 20:10:56,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:56,657 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:56,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:10:56,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:10:56,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:56,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:56,859 INFO L85 PathProgramCache]: Analyzing trace with hash 240180751, now seen corresponding path program 1 times [2025-03-03 20:10:56,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:56,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281412787] [2025-03-03 20:10:56,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:56,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:56,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 788 statements into 1 equivalence classes. [2025-03-03 20:10:56,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 788 of 788 statements. [2025-03-03 20:10:56,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:56,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:57,628 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-03 20:10:57,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:57,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281412787] [2025-03-03 20:10:57,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281412787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:57,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:57,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:57,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100785241] [2025-03-03 20:10:57,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:57,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:57,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:57,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:57,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:57,634 INFO L87 Difference]: Start difference. First operand 441 states and 737 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:10:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:57,759 INFO L93 Difference]: Finished difference Result 880 states and 1473 transitions. [2025-03-03 20:10:57,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:57,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 788 [2025-03-03 20:10:57,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:57,766 INFO L225 Difference]: With dead ends: 880 [2025-03-03 20:10:57,767 INFO L226 Difference]: Without dead ends: 442 [2025-03-03 20:10:57,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:57,768 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 0 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:57,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1397 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-03 20:10:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-03-03 20:10:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 317 states have (on average 1.5520504731861198) internal successors, (492), 317 states have internal predecessors, (492), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) [2025-03-03 20:10:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 738 transitions. [2025-03-03 20:10:57,793 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 738 transitions. Word has length 788 [2025-03-03 20:10:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:57,795 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 738 transitions. [2025-03-03 20:10:57,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:10:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 738 transitions. [2025-03-03 20:10:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-03-03 20:10:57,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:57,801 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:57,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:10:57,802 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:57,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1449485522, now seen corresponding path program 1 times [2025-03-03 20:10:57,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:57,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254849686] [2025-03-03 20:10:57,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:57,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:57,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-03-03 20:10:57,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-03-03 20:10:57,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:57,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-03 20:10:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:58,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254849686] [2025-03-03 20:10:58,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254849686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:58,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:58,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:58,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572756561] [2025-03-03 20:10:58,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:58,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:58,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:58,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:58,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:58,117 INFO L87 Difference]: Start difference. First operand 442 states and 738 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:10:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:58,281 INFO L93 Difference]: Finished difference Result 1318 states and 2204 transitions. [2025-03-03 20:10:58,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:58,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 789 [2025-03-03 20:10:58,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:58,293 INFO L225 Difference]: With dead ends: 1318 [2025-03-03 20:10:58,293 INFO L226 Difference]: Without dead ends: 879 [2025-03-03 20:10:58,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:58,298 INFO L435 NwaCegarLoop]: 1147 mSDtfsCounter, 715 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:58,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1841 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-03 20:10:58,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 874. [2025-03-03 20:10:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 625 states have (on average 1.5488) internal successors, (968), 625 states have internal predecessors, (968), 246 states have call successors, (246), 2 states have call predecessors, (246), 2 states have return successors, (246), 246 states have call predecessors, (246), 246 states have call successors, (246) [2025-03-03 20:10:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1460 transitions. [2025-03-03 20:10:58,369 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1460 transitions. Word has length 789 [2025-03-03 20:10:58,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:58,372 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1460 transitions. [2025-03-03 20:10:58,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:10:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1460 transitions. [2025-03-03 20:10:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-03-03 20:10:58,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:58,380 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:58,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:10:58,380 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:58,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash -221028047, now seen corresponding path program 1 times [2025-03-03 20:10:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:58,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506532651] [2025-03-03 20:10:58,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:58,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:58,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-03-03 20:10:58,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-03-03 20:10:58,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:58,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-03 20:10:58,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:58,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506532651] [2025-03-03 20:10:58,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506532651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:58,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:58,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:58,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499380781] [2025-03-03 20:10:58,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:58,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:58,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:58,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:58,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:58,701 INFO L87 Difference]: Start difference. First operand 874 states and 1460 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:10:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:58,838 INFO L93 Difference]: Finished difference Result 2156 states and 3602 transitions. [2025-03-03 20:10:58,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:58,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 789 [2025-03-03 20:10:58,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:58,847 INFO L225 Difference]: With dead ends: 2156 [2025-03-03 20:10:58,848 INFO L226 Difference]: Without dead ends: 1285 [2025-03-03 20:10:58,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:58,850 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 333 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:58,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1416 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:58,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-03-03 20:10:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1281. [2025-03-03 20:10:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 974 states have (on average 1.570841889117043) internal successors, (1530), 976 states have internal predecessors, (1530), 302 states have call successors, (302), 4 states have call predecessors, (302), 4 states have return successors, (302), 300 states have call predecessors, (302), 302 states have call successors, (302) [2025-03-03 20:10:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 2134 transitions. [2025-03-03 20:10:58,945 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 2134 transitions. Word has length 789 [2025-03-03 20:10:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:58,946 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 2134 transitions. [2025-03-03 20:10:58,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:10:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 2134 transitions. [2025-03-03 20:10:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-03-03 20:10:58,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:58,953 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:58,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:10:58,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:58,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:58,955 INFO L85 PathProgramCache]: Analyzing trace with hash -220452112, now seen corresponding path program 1 times [2025-03-03 20:10:58,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:58,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650952376] [2025-03-03 20:10:58,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:58,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:58,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-03-03 20:10:59,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-03-03 20:10:59,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:59,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-03 20:10:59,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:59,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650952376] [2025-03-03 20:10:59,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650952376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:59,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:59,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:59,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872328472] [2025-03-03 20:10:59,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:59,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:59,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:59,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:59,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:59,231 INFO L87 Difference]: Start difference. First operand 1281 states and 2134 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:10:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:59,372 INFO L93 Difference]: Finished difference Result 3167 states and 5226 transitions. [2025-03-03 20:10:59,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:59,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 789 [2025-03-03 20:10:59,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:59,386 INFO L225 Difference]: With dead ends: 3167 [2025-03-03 20:10:59,386 INFO L226 Difference]: Without dead ends: 1889 [2025-03-03 20:10:59,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:59,391 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 310 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:59,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1635 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:59,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2025-03-03 20:10:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1885. [2025-03-03 20:10:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1338 states have (on average 1.5037369207772795) internal successors, (2012), 1344 states have internal predecessors, (2012), 538 states have call successors, (538), 8 states have call predecessors, (538), 8 states have return successors, (538), 532 states have call predecessors, (538), 538 states have call successors, (538) [2025-03-03 20:10:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 3088 transitions. [2025-03-03 20:10:59,549 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 3088 transitions. Word has length 789 [2025-03-03 20:10:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:59,550 INFO L471 AbstractCegarLoop]: Abstraction has 1885 states and 3088 transitions. [2025-03-03 20:10:59,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:10:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 3088 transitions. [2025-03-03 20:10:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-03-03 20:10:59,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:59,557 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:59,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:10:59,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:59,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:59,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1024312369, now seen corresponding path program 1 times [2025-03-03 20:10:59,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:59,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334751575] [2025-03-03 20:10:59,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:59,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-03-03 20:10:59,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-03-03 20:10:59,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:59,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:59,994 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-03 20:10:59,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:59,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334751575] [2025-03-03 20:10:59,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334751575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:59,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:59,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:10:59,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815507890] [2025-03-03 20:10:59,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:59,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:10:59,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:59,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:10:59,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:10:59,997 INFO L87 Difference]: Start difference. First operand 1885 states and 3088 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:00,387 INFO L93 Difference]: Finished difference Result 5649 states and 9258 transitions. [2025-03-03 20:11:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:11:00,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 789 [2025-03-03 20:11:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:00,408 INFO L225 Difference]: With dead ends: 5649 [2025-03-03 20:11:00,408 INFO L226 Difference]: Without dead ends: 3767 [2025-03-03 20:11:00,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:11:00,413 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 912 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:00,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 2067 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:11:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3767 states. [2025-03-03 20:11:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 3733. [2025-03-03 20:11:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3733 states, 2640 states have (on average 1.5) internal successors, (3960), 2652 states have internal predecessors, (3960), 1076 states have call successors, (1076), 16 states have call predecessors, (1076), 16 states have return successors, (1076), 1064 states have call predecessors, (1076), 1076 states have call successors, (1076) [2025-03-03 20:11:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 6112 transitions. [2025-03-03 20:11:00,671 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 6112 transitions. Word has length 789 [2025-03-03 20:11:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:00,673 INFO L471 AbstractCegarLoop]: Abstraction has 3733 states and 6112 transitions. [2025-03-03 20:11:00,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 6112 transitions. [2025-03-03 20:11:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-03-03 20:11:00,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:00,680 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:00,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:11:00,681 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:00,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:00,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1891364594, now seen corresponding path program 1 times [2025-03-03 20:11:00,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:00,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299151125] [2025-03-03 20:11:00,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:00,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:00,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-03-03 20:11:00,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-03-03 20:11:00,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:00,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-03 20:11:01,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:01,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299151125] [2025-03-03 20:11:01,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299151125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:01,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:01,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:01,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174064141] [2025-03-03 20:11:01,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:01,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:01,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:01,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:01,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:01,120 INFO L87 Difference]: Start difference. First operand 3733 states and 6112 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:01,400 INFO L93 Difference]: Finished difference Result 9339 states and 15300 transitions. [2025-03-03 20:11:01,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:01,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 789 [2025-03-03 20:11:01,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:01,429 INFO L225 Difference]: With dead ends: 9339 [2025-03-03 20:11:01,429 INFO L226 Difference]: Without dead ends: 5609 [2025-03-03 20:11:01,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:01,442 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 513 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:01,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1392 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:01,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5609 states. [2025-03-03 20:11:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5609 to 5595. [2025-03-03 20:11:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5595 states, 3956 states have (on average 1.4989888776541962) internal successors, (5930), 3974 states have internal predecessors, (5930), 1614 states have call successors, (1614), 24 states have call predecessors, (1614), 24 states have return successors, (1614), 1596 states have call predecessors, (1614), 1614 states have call successors, (1614) [2025-03-03 20:11:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5595 states to 5595 states and 9158 transitions. [2025-03-03 20:11:01,882 INFO L78 Accepts]: Start accepts. Automaton has 5595 states and 9158 transitions. Word has length 789 [2025-03-03 20:11:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:01,883 INFO L471 AbstractCegarLoop]: Abstraction has 5595 states and 9158 transitions. [2025-03-03 20:11:01,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 5595 states and 9158 transitions. [2025-03-03 20:11:01,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-03 20:11:01,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:01,891 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:01,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:11:01,891 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:01,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:01,892 INFO L85 PathProgramCache]: Analyzing trace with hash 207360640, now seen corresponding path program 1 times [2025-03-03 20:11:01,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:01,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173999846] [2025-03-03 20:11:01,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:01,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:01,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-03 20:11:01,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-03 20:11:01,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:01,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:02,071 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-03 20:11:02,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:02,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173999846] [2025-03-03 20:11:02,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173999846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:02,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:02,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:02,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661962803] [2025-03-03 20:11:02,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:02,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:02,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:02,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:02,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:02,074 INFO L87 Difference]: Start difference. First operand 5595 states and 9158 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:02,397 INFO L93 Difference]: Finished difference Result 14741 states and 24070 transitions. [2025-03-03 20:11:02,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:02,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 790 [2025-03-03 20:11:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:02,439 INFO L225 Difference]: With dead ends: 14741 [2025-03-03 20:11:02,440 INFO L226 Difference]: Without dead ends: 9149 [2025-03-03 20:11:02,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:02,454 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 340 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:02,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1389 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9149 states. [2025-03-03 20:11:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9149 to 9135. [2025-03-03 20:11:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9135 states, 6776 states have (on average 1.5103305785123966) internal successors, (10234), 6818 states have internal predecessors, (10234), 2310 states have call successors, (2310), 48 states have call predecessors, (2310), 48 states have return successors, (2310), 2268 states have call predecessors, (2310), 2310 states have call successors, (2310) [2025-03-03 20:11:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9135 states to 9135 states and 14854 transitions. [2025-03-03 20:11:02,990 INFO L78 Accepts]: Start accepts. Automaton has 9135 states and 14854 transitions. Word has length 790 [2025-03-03 20:11:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:02,991 INFO L471 AbstractCegarLoop]: Abstraction has 9135 states and 14854 transitions. [2025-03-03 20:11:02,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 9135 states and 14854 transitions. [2025-03-03 20:11:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-03 20:11:03,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:03,003 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:03,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:11:03,004 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:03,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:03,004 INFO L85 PathProgramCache]: Analyzing trace with hash -529190559, now seen corresponding path program 1 times [2025-03-03 20:11:03,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:03,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488592019] [2025-03-03 20:11:03,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:03,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:03,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-03 20:11:03,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-03 20:11:03,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:03,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:04,785 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-03 20:11:04,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:04,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488592019] [2025-03-03 20:11:04,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488592019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:04,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:04,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:11:04,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121895124] [2025-03-03 20:11:04,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:04,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:11:04,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:04,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:11:04,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:11:04,787 INFO L87 Difference]: Start difference. First operand 9135 states and 14854 transitions. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 3 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 3 states have call predecessors, (123), 3 states have call successors, (123) [2025-03-03 20:11:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:07,293 INFO L93 Difference]: Finished difference Result 26251 states and 42628 transitions. [2025-03-03 20:11:07,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:11:07,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 3 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 3 states have call predecessors, (123), 3 states have call successors, (123) Word has length 790 [2025-03-03 20:11:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:07,359 INFO L225 Difference]: With dead ends: 26251 [2025-03-03 20:11:07,359 INFO L226 Difference]: Without dead ends: 17119 [2025-03-03 20:11:07,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:11:07,381 INFO L435 NwaCegarLoop]: 1453 mSDtfsCounter, 2003 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2003 SdHoareTripleChecker+Valid, 3983 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:07,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2003 Valid, 3983 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 20:11:07,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17119 states. [2025-03-03 20:11:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17119 to 13149. [2025-03-03 20:11:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13149 states, 9920 states have (on average 1.5169354838709677) internal successors, (15048), 9986 states have internal predecessors, (15048), 3156 states have call successors, (3156), 72 states have call predecessors, (3156), 72 states have return successors, (3156), 3090 states have call predecessors, (3156), 3156 states have call successors, (3156) [2025-03-03 20:11:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13149 states to 13149 states and 21360 transitions. [2025-03-03 20:11:08,369 INFO L78 Accepts]: Start accepts. Automaton has 13149 states and 21360 transitions. Word has length 790 [2025-03-03 20:11:08,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:08,370 INFO L471 AbstractCegarLoop]: Abstraction has 13149 states and 21360 transitions. [2025-03-03 20:11:08,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 3 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 3 states have call predecessors, (123), 3 states have call successors, (123) [2025-03-03 20:11:08,371 INFO L276 IsEmpty]: Start isEmpty. Operand 13149 states and 21360 transitions. [2025-03-03 20:11:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-03 20:11:08,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:08,390 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:08,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:11:08,391 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:08,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash 409341056, now seen corresponding path program 1 times [2025-03-03 20:11:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:08,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917793891] [2025-03-03 20:11:08,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:08,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-03 20:11:08,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-03 20:11:08,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:08,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-03 20:11:08,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:08,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917793891] [2025-03-03 20:11:08,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917793891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:08,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:08,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:08,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269610124] [2025-03-03 20:11:08,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:08,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:08,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:08,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:08,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:08,699 INFO L87 Difference]: Start difference. First operand 13149 states and 21360 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:09,664 INFO L93 Difference]: Finished difference Result 39390 states and 63987 transitions. [2025-03-03 20:11:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:09,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 790 [2025-03-03 20:11:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:09,758 INFO L225 Difference]: With dead ends: 39390 [2025-03-03 20:11:09,758 INFO L226 Difference]: Without dead ends: 26244 [2025-03-03 20:11:09,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:09,788 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 521 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:09,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1440 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26244 states. [2025-03-03 20:11:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26244 to 26242. [2025-03-03 20:11:11,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26242 states, 19785 states have (on average 1.5157947940358858) internal successors, (29990), 19917 states have internal predecessors, (29990), 6312 states have call successors, (6312), 144 states have call predecessors, (6312), 144 states have return successors, (6312), 6180 states have call predecessors, (6312), 6312 states have call successors, (6312) [2025-03-03 20:11:11,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26242 states to 26242 states and 42614 transitions. [2025-03-03 20:11:11,449 INFO L78 Accepts]: Start accepts. Automaton has 26242 states and 42614 transitions. Word has length 790 [2025-03-03 20:11:11,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:11,450 INFO L471 AbstractCegarLoop]: Abstraction has 26242 states and 42614 transitions. [2025-03-03 20:11:11,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 26242 states and 42614 transitions. [2025-03-03 20:11:11,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2025-03-03 20:11:11,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:11,471 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:11,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:11:11,471 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:11,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:11,472 INFO L85 PathProgramCache]: Analyzing trace with hash 250380491, now seen corresponding path program 1 times [2025-03-03 20:11:11,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:11,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631512321] [2025-03-03 20:11:11,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:11,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-03 20:11:11,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-03 20:11:11,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:11,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-03 20:11:12,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:12,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631512321] [2025-03-03 20:11:12,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631512321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:12,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:12,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:12,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667019406] [2025-03-03 20:11:12,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:12,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:12,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:12,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:12,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:12,038 INFO L87 Difference]: Start difference. First operand 26242 states and 42614 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:13,513 INFO L93 Difference]: Finished difference Result 52625 states and 85513 transitions. [2025-03-03 20:11:13,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:13,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 791 [2025-03-03 20:11:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:13,631 INFO L225 Difference]: With dead ends: 52625 [2025-03-03 20:11:13,631 INFO L226 Difference]: Without dead ends: 26386 [2025-03-03 20:11:13,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:13,695 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 0 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:13,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1375 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26386 states. [2025-03-03 20:11:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26386 to 26386. [2025-03-03 20:11:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26386 states, 19929 states have (on average 1.5120678408349641) internal successors, (30134), 20061 states have internal predecessors, (30134), 6312 states have call successors, (6312), 144 states have call predecessors, (6312), 144 states have return successors, (6312), 6180 states have call predecessors, (6312), 6312 states have call successors, (6312) [2025-03-03 20:11:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 42758 transitions. [2025-03-03 20:11:15,437 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 42758 transitions. Word has length 791 [2025-03-03 20:11:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:15,438 INFO L471 AbstractCegarLoop]: Abstraction has 26386 states and 42758 transitions. [2025-03-03 20:11:15,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 42758 transitions. [2025-03-03 20:11:15,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2025-03-03 20:11:15,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:15,460 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:15,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:11:15,460 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:15,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:15,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1645775864, now seen corresponding path program 1 times [2025-03-03 20:11:15,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:15,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153221216] [2025-03-03 20:11:15,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:15,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:15,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-03-03 20:11:15,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-03-03 20:11:15,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:15,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-03 20:11:16,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:16,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153221216] [2025-03-03 20:11:16,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153221216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:16,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:16,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:16,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182716431] [2025-03-03 20:11:16,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:16,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:16,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:16,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:16,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:16,182 INFO L87 Difference]: Start difference. First operand 26386 states and 42758 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:18,127 INFO L93 Difference]: Finished difference Result 79300 states and 128414 transitions. [2025-03-03 20:11:18,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:11:18,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 792 [2025-03-03 20:11:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:18,338 INFO L225 Difference]: With dead ends: 79300 [2025-03-03 20:11:18,339 INFO L226 Difference]: Without dead ends: 52917 [2025-03-03 20:11:18,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:18,411 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 1462 mSDsluCounter, 2093 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 3365 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:18,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 3365 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:11:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52917 states. [2025-03-03 20:11:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52917 to 52767. [2025-03-03 20:11:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52767 states, 39854 states have (on average 1.5085060470718121) internal successors, (60120), 40118 states have internal predecessors, (60120), 12624 states have call successors, (12624), 288 states have call predecessors, (12624), 288 states have return successors, (12624), 12360 states have call predecessors, (12624), 12624 states have call successors, (12624) [2025-03-03 20:11:22,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52767 states to 52767 states and 85368 transitions. [2025-03-03 20:11:22,521 INFO L78 Accepts]: Start accepts. Automaton has 52767 states and 85368 transitions. Word has length 792 [2025-03-03 20:11:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:22,523 INFO L471 AbstractCegarLoop]: Abstraction has 52767 states and 85368 transitions. [2025-03-03 20:11:22,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 52767 states and 85368 transitions. [2025-03-03 20:11:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2025-03-03 20:11:22,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:22,553 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:22,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:11:22,554 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:22,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:22,554 INFO L85 PathProgramCache]: Analyzing trace with hash 465514505, now seen corresponding path program 1 times [2025-03-03 20:11:22,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:22,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541895057] [2025-03-03 20:11:22,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:22,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:22,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-03-03 20:11:22,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-03-03 20:11:22,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:22,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 84 proven. 282 refuted. 0 times theorem prover too weak. 29646 trivial. 0 not checked. [2025-03-03 20:11:23,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:23,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541895057] [2025-03-03 20:11:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541895057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:11:23,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585189881] [2025-03-03 20:11:23,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:23,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:23,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:23,441 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:11:23,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:11:23,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-03-03 20:11:24,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-03-03 20:11:24,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:24,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:24,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 1776 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:11:24,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:11:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 11822 proven. 96 refuted. 0 times theorem prover too weak. 18094 trivial. 0 not checked. [2025-03-03 20:11:24,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:11:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 270 proven. 96 refuted. 0 times theorem prover too weak. 29646 trivial. 0 not checked. [2025-03-03 20:11:25,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585189881] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:11:25,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:11:25,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 20:11:25,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539649741] [2025-03-03 20:11:25,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:11:25,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:11:25,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:25,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:11:25,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:11:25,315 INFO L87 Difference]: Start difference. First operand 52767 states and 85368 transitions. Second operand has 8 states, 8 states have (on average 38.625) internal successors, (309), 8 states have internal predecessors, (309), 3 states have call successors, (249), 2 states have call predecessors, (249), 4 states have return successors, (251), 3 states have call predecessors, (251), 3 states have call successors, (251) [2025-03-03 20:11:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:26,947 INFO L93 Difference]: Finished difference Result 74400 states and 120805 transitions. [2025-03-03 20:11:26,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 20:11:26,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 38.625) internal successors, (309), 8 states have internal predecessors, (309), 3 states have call successors, (249), 2 states have call predecessors, (249), 4 states have return successors, (251), 3 states have call predecessors, (251), 3 states have call successors, (251) Word has length 792 [2025-03-03 20:11:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:27,064 INFO L225 Difference]: With dead ends: 74400 [2025-03-03 20:11:27,064 INFO L226 Difference]: Without dead ends: 21636 [2025-03-03 20:11:27,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1597 GetRequests, 1581 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:11:27,168 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 833 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:27,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1567 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:11:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21636 states. [2025-03-03 20:11:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21636 to 21489. [2025-03-03 20:11:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21489 states, 16599 states have (on average 1.5336466052171818) internal successors, (25457), 16648 states have internal predecessors, (25457), 4720 states have call successors, (4720), 169 states have call predecessors, (4720), 169 states have return successors, (4720), 4671 states have call predecessors, (4720), 4720 states have call successors, (4720) [2025-03-03 20:11:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21489 states to 21489 states and 34897 transitions. [2025-03-03 20:11:28,952 INFO L78 Accepts]: Start accepts. Automaton has 21489 states and 34897 transitions. Word has length 792 [2025-03-03 20:11:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:28,952 INFO L471 AbstractCegarLoop]: Abstraction has 21489 states and 34897 transitions. [2025-03-03 20:11:28,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.625) internal successors, (309), 8 states have internal predecessors, (309), 3 states have call successors, (249), 2 states have call predecessors, (249), 4 states have return successors, (251), 3 states have call predecessors, (251), 3 states have call successors, (251) [2025-03-03 20:11:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 21489 states and 34897 transitions. [2025-03-03 20:11:28,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2025-03-03 20:11:28,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:28,967 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:28,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 20:11:29,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 20:11:29,168 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:29,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash -15819164, now seen corresponding path program 1 times [2025-03-03 20:11:29,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:29,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083720237] [2025-03-03 20:11:29,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:29,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:29,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 797 statements into 1 equivalence classes. [2025-03-03 20:11:29,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 797 of 797 statements. [2025-03-03 20:11:29,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:29,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-03 20:11:29,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:29,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083720237] [2025-03-03 20:11:29,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083720237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:29,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:29,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:11:29,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129114974] [2025-03-03 20:11:29,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:29,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:11:29,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:29,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:11:29,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:29,738 INFO L87 Difference]: Start difference. First operand 21489 states and 34897 transitions. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:31,620 INFO L93 Difference]: Finished difference Result 61824 states and 100819 transitions. [2025-03-03 20:11:31,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:11:31,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 797 [2025-03-03 20:11:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:31,745 INFO L225 Difference]: With dead ends: 61824 [2025-03-03 20:11:31,745 INFO L226 Difference]: Without dead ends: 37458 [2025-03-03 20:11:31,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:31,793 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 755 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:31,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1982 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:11:31,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37458 states. [2025-03-03 20:11:33,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37458 to 37383. [2025-03-03 20:11:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37383 states, 30548 states have (on average 1.558138012308498) internal successors, (47598), 30669 states have internal predecessors, (47598), 6592 states have call successors, (6592), 242 states have call predecessors, (6592), 242 states have return successors, (6592), 6471 states have call predecessors, (6592), 6592 states have call successors, (6592) [2025-03-03 20:11:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37383 states to 37383 states and 60782 transitions. [2025-03-03 20:11:33,668 INFO L78 Accepts]: Start accepts. Automaton has 37383 states and 60782 transitions. Word has length 797 [2025-03-03 20:11:33,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:33,669 INFO L471 AbstractCegarLoop]: Abstraction has 37383 states and 60782 transitions. [2025-03-03 20:11:33,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:33,669 INFO L276 IsEmpty]: Start isEmpty. Operand 37383 states and 60782 transitions. [2025-03-03 20:11:33,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2025-03-03 20:11:33,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:33,684 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:33,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:11:33,684 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:33,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:33,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1182916101, now seen corresponding path program 1 times [2025-03-03 20:11:33,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:33,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447925358] [2025-03-03 20:11:33,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:33,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:33,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 797 statements into 1 equivalence classes. [2025-03-03 20:11:33,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 797 of 797 statements. [2025-03-03 20:11:33,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:33,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-03 20:11:34,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:34,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447925358] [2025-03-03 20:11:34,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447925358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:34,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:34,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:34,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433217570] [2025-03-03 20:11:34,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:34,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:34,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:34,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:34,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:34,125 INFO L87 Difference]: Start difference. First operand 37383 states and 60782 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:38,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:38,017 INFO L93 Difference]: Finished difference Result 128249 states and 206925 transitions. [2025-03-03 20:11:38,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:11:38,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 797 [2025-03-03 20:11:38,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:38,269 INFO L225 Difference]: With dead ends: 128249 [2025-03-03 20:11:38,269 INFO L226 Difference]: Without dead ends: 90923 [2025-03-03 20:11:38,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:38,357 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 729 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:38,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 2250 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:11:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90923 states. [2025-03-03 20:11:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90923 to 70075. [2025-03-03 20:11:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70075 states, 58488 states have (on average 1.562918889344823) internal successors, (91412), 58753 states have internal predecessors, (91412), 11128 states have call successors, (11128), 458 states have call predecessors, (11128), 458 states have return successors, (11128), 10863 states have call predecessors, (11128), 11128 states have call successors, (11128) [2025-03-03 20:11:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70075 states to 70075 states and 113668 transitions. [2025-03-03 20:11:42,253 INFO L78 Accepts]: Start accepts. Automaton has 70075 states and 113668 transitions. Word has length 797 [2025-03-03 20:11:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:42,253 INFO L471 AbstractCegarLoop]: Abstraction has 70075 states and 113668 transitions. [2025-03-03 20:11:42,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 70075 states and 113668 transitions. [2025-03-03 20:11:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2025-03-03 20:11:42,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:42,282 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:42,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 20:11:42,282 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:42,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash 942375972, now seen corresponding path program 1 times [2025-03-03 20:11:42,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:42,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992100622] [2025-03-03 20:11:42,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:42,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 797 statements into 1 equivalence classes. [2025-03-03 20:11:42,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 797 of 797 statements. [2025-03-03 20:11:42,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:42,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-03 20:11:42,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:42,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992100622] [2025-03-03 20:11:42,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992100622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:42,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:42,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:42,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197546320] [2025-03-03 20:11:42,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:42,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:42,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:42,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:42,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:42,803 INFO L87 Difference]: Start difference. First operand 70075 states and 113668 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:47,289 INFO L93 Difference]: Finished difference Result 167344 states and 270255 transitions. [2025-03-03 20:11:47,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:11:47,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 797 [2025-03-03 20:11:47,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:47,568 INFO L225 Difference]: With dead ends: 167344 [2025-03-03 20:11:47,569 INFO L226 Difference]: Without dead ends: 97326 [2025-03-03 20:11:47,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:47,700 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 617 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:47,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1998 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:11:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97326 states. [2025-03-03 20:11:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97326 to 79147. [2025-03-03 20:11:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79147 states, 67416 states have (on average 1.5745223685771923) internal successors, (106148), 67681 states have internal predecessors, (106148), 11128 states have call successors, (11128), 602 states have call predecessors, (11128), 602 states have return successors, (11128), 10863 states have call predecessors, (11128), 11128 states have call successors, (11128) [2025-03-03 20:11:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79147 states to 79147 states and 128404 transitions. [2025-03-03 20:11:51,426 INFO L78 Accepts]: Start accepts. Automaton has 79147 states and 128404 transitions. Word has length 797 [2025-03-03 20:11:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:51,426 INFO L471 AbstractCegarLoop]: Abstraction has 79147 states and 128404 transitions. [2025-03-03 20:11:51,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-03 20:11:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 79147 states and 128404 transitions. [2025-03-03 20:11:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2025-03-03 20:11:51,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:51,461 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:51,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 20:11:51,462 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:51,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:51,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1272141733, now seen corresponding path program 1 times [2025-03-03 20:11:51,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:51,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178805721] [2025-03-03 20:11:51,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:51,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:51,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 797 statements into 1 equivalence classes. [2025-03-03 20:11:51,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 797 of 797 statements. [2025-03-03 20:11:51,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:51,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 213 proven. 153 refuted. 0 times theorem prover too weak. 29646 trivial. 0 not checked. [2025-03-03 20:11:52,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:52,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178805721] [2025-03-03 20:11:52,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178805721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:11:52,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198152584] [2025-03-03 20:11:52,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:52,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:52,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:52,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:11:52,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 20:11:52,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 797 statements into 1 equivalence classes. [2025-03-03 20:11:52,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 797 of 797 statements. [2025-03-03 20:11:52,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:52,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:52,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 1797 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:11:52,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:11:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 12476 proven. 105 refuted. 0 times theorem prover too weak. 17431 trivial. 0 not checked. [2025-03-03 20:11:53,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:11:53,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 261 proven. 105 refuted. 0 times theorem prover too weak. 29646 trivial. 0 not checked. [2025-03-03 20:11:53,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198152584] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:11:53,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:11:53,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 20:11:53,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706103856] [2025-03-03 20:11:53,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:11:53,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:11:53,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:53,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:11:53,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:11:53,499 INFO L87 Difference]: Start difference. First operand 79147 states and 128404 transitions. Second operand has 8 states, 8 states have (on average 37.125) internal successors, (297), 8 states have internal predecessors, (297), 3 states have call successors, (209), 2 states have call predecessors, (209), 4 states have return successors, (211), 3 states have call predecessors, (211), 3 states have call successors, (211) [2025-03-03 20:11:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:56,902 INFO L93 Difference]: Finished difference Result 159201 states and 257641 transitions. [2025-03-03 20:11:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 20:11:56,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 37.125) internal successors, (297), 8 states have internal predecessors, (297), 3 states have call successors, (209), 2 states have call predecessors, (209), 4 states have return successors, (211), 3 states have call predecessors, (211), 3 states have call successors, (211) Word has length 797 [2025-03-03 20:11:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:57,114 INFO L225 Difference]: With dead ends: 159201 [2025-03-03 20:11:57,114 INFO L226 Difference]: Without dead ends: 80111 [2025-03-03 20:11:57,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1607 GetRequests, 1591 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:11:57,231 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 804 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:57,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1419 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:11:57,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80111 states.