./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-86.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e41e90a8ded7ff3062d090d36a7ca1e3310919bbe5f722b4fd1b9d4da48b6059 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:01:57,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:01:57,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:01:57,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:01:57,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:01:57,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:01:57,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:01:57,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:01:57,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:01:57,427 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:01:57,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:01:57,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:01:57,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:01:57,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:01:57,428 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:01:57,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:01:57,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:01:57,429 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:01:57,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:01:57,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:01:57,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:01:57,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:01:57,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:01:57,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:01:57,429 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:01:57,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:01:57,429 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:01:57,429 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:01:57,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:01:57,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:01:57,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:01:57,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:01:57,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:01:57,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:01:57,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:01:57,430 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:01:57,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:01:57,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:01:57,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:01:57,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:01:57,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:01:57,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:01:57,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:01:57,431 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-jdk21/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 -> e41e90a8ded7ff3062d090d36a7ca1e3310919bbe5f722b4fd1b9d4da48b6059 [2025-02-05 22:01:57,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:01:57,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:01:57,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:01:57,690 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:01:57,690 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:01:57,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-86.i [2025-02-05 22:01:58,917 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61d8e8128/62850fc301d94b61aedc7bf9540858d4/FLAG458b85fd6 [2025-02-05 22:01:59,191 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:01:59,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-86.i [2025-02-05 22:01:59,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61d8e8128/62850fc301d94b61aedc7bf9540858d4/FLAG458b85fd6 [2025-02-05 22:01:59,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61d8e8128/62850fc301d94b61aedc7bf9540858d4 [2025-02-05 22:01:59,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:01:59,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:01:59,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:01:59,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:01:59,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:01:59,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:01:59" (1/1) ... [2025-02-05 22:01:59,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:59, skipping insertion in model container [2025-02-05 22:01:59,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:01:59" (1/1) ... [2025-02-05 22:01:59,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:01:59,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-86.i[916,929] [2025-02-05 22:01:59,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:01:59,829 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:01:59,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-86.i[916,929] [2025-02-05 22:01:59,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:01:59,906 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:01:59,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:59 WrapperNode [2025-02-05 22:01:59,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:01:59,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:01:59,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:01:59,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:01:59,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:59" (1/1) ... [2025-02-05 22:01:59,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:59" (1/1) ... [2025-02-05 22:01:59,990 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 777 [2025-02-05 22:01:59,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:01:59,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:01:59,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:01:59,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:01:59,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:59" (1/1) ... [2025-02-05 22:01:59,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:59" (1/1) ... [2025-02-05 22:02:00,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:59" (1/1) ... [2025-02-05 22:02:00,042 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-02-05 22:02:00,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:59" (1/1) ... [2025-02-05 22:02:00,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:59" (1/1) ... [2025-02-05 22:02:00,066 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:59" (1/1) ... [2025-02-05 22:02:00,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:59" (1/1) ... [2025-02-05 22:02:00,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:59" (1/1) ... [2025-02-05 22:02:00,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:59" (1/1) ... [2025-02-05 22:02:00,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:02:00,094 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:02:00,095 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:02:00,095 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:02:00,096 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:59" (1/1) ... [2025-02-05 22:02:00,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:02:00,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:02:00,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:02:00,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:02:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:02:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:02:00,147 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:02:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:02:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:02:00,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:02:00,271 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:02:00,273 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:02:01,267 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-02-05 22:02:01,267 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:02:01,294 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:02:01,296 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 22:02:01,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:02:01 BoogieIcfgContainer [2025-02-05 22:02:01,296 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:02:01,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:02:01,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:02:01,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:02:01,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:01:59" (1/3) ... [2025-02-05 22:02:01,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f6fc2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:02:01, skipping insertion in model container [2025-02-05 22:02:01,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:59" (2/3) ... [2025-02-05 22:02:01,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f6fc2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:02:01, skipping insertion in model container [2025-02-05 22:02:01,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:02:01" (3/3) ... [2025-02-05 22:02:01,304 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-86.i [2025-02-05 22:02:01,315 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:02:01,318 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-86.i that has 2 procedures, 322 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:02:01,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:02:01,389 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;@17b50d80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:02:01,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:02:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 322 states, 239 states have (on average 1.6443514644351465) internal successors, (393), 240 states have internal predecessors, (393), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-05 22:02:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-05 22:02:01,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:01,418 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:01,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:01,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:01,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1376461097, now seen corresponding path program 1 times [2025-02-05 22:02:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:01,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775523172] [2025-02-05 22:02:01,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:01,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:01,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-05 22:02:01,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-05 22:02:01,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:01,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-02-05 22:02:01,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:01,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775523172] [2025-02-05 22:02:01,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775523172] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:02:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939175619] [2025-02-05 22:02:01,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:01,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:02:01,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:02:01,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:02:01,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:02:02,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-05 22:02:02,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-05 22:02:02,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:02,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:02,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:02:02,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:02:02,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-02-05 22:02:02,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:02:02,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939175619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:02,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:02:02,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:02:02,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166322057] [2025-02-05 22:02:02,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:02,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:02:02,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:02,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:02:02,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:02:02,329 INFO L87 Difference]: Start difference. First operand has 322 states, 239 states have (on average 1.6443514644351465) internal successors, (393), 240 states have internal predecessors, (393), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-02-05 22:02:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:02,401 INFO L93 Difference]: Finished difference Result 633 states and 1173 transitions. [2025-02-05 22:02:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:02:02,404 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) Word has length 538 [2025-02-05 22:02:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:02,414 INFO L225 Difference]: With dead ends: 633 [2025-02-05 22:02:02,414 INFO L226 Difference]: Without dead ends: 314 [2025-02-05 22:02:02,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 539 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-02-05 22:02:02,423 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:02,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:02:02,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-05 22:02:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-02-05 22:02:02,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 232 states have (on average 1.6206896551724137) internal successors, (376), 232 states have internal predecessors, (376), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-05 22:02:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 536 transitions. [2025-02-05 22:02:02,501 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 536 transitions. Word has length 538 [2025-02-05 22:02:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:02,503 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 536 transitions. [2025-02-05 22:02:02,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-02-05 22:02:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 536 transitions. [2025-02-05 22:02:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-05 22:02:02,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:02,514 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:02,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 22:02:02,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:02:02,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:02,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:02,720 INFO L85 PathProgramCache]: Analyzing trace with hash 688240448, now seen corresponding path program 1 times [2025-02-05 22:02:02,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:02,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300814329] [2025-02-05 22:02:02,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:02,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:02,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-05 22:02:02,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-05 22:02:02,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:02,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:03,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:03,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300814329] [2025-02-05 22:02:03,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300814329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:03,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:03,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:03,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125499476] [2025-02-05 22:02:03,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:03,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:03,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:03,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:03,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:03,377 INFO L87 Difference]: Start difference. First operand 314 states and 536 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:03,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:03,469 INFO L93 Difference]: Finished difference Result 820 states and 1397 transitions. [2025-02-05 22:02:03,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:03,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 538 [2025-02-05 22:02:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:03,478 INFO L225 Difference]: With dead ends: 820 [2025-02-05 22:02:03,480 INFO L226 Difference]: Without dead ends: 509 [2025-02-05 22:02:03,482 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-02-05 22:02:03,482 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 526 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:03,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1162 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:02:03,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-02-05 22:02:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 313. [2025-02-05 22:02:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 231 states have (on average 1.6147186147186148) internal successors, (373), 231 states have internal predecessors, (373), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-05 22:02:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 533 transitions. [2025-02-05 22:02:03,529 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 533 transitions. Word has length 538 [2025-02-05 22:02:03,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:03,531 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 533 transitions. [2025-02-05 22:02:03,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:03,531 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 533 transitions. [2025-02-05 22:02:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-05 22:02:03,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:03,539 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:03,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:02:03,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:03,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:03,540 INFO L85 PathProgramCache]: Analyzing trace with hash 18538593, now seen corresponding path program 1 times [2025-02-05 22:02:03,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:03,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452908440] [2025-02-05 22:02:03,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:03,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:03,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-05 22:02:03,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-05 22:02:03,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:03,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:04,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:04,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:04,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452908440] [2025-02-05 22:02:04,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452908440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:04,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:04,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:02:04,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541339402] [2025-02-05 22:02:04,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:04,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:02:04,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:04,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:02:04,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:02:04,036 INFO L87 Difference]: Start difference. First operand 313 states and 533 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:04,319 INFO L93 Difference]: Finished difference Result 826 states and 1414 transitions. [2025-02-05 22:02:04,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:02:04,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 538 [2025-02-05 22:02:04,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:04,323 INFO L225 Difference]: With dead ends: 826 [2025-02-05 22:02:04,323 INFO L226 Difference]: Without dead ends: 516 [2025-02-05 22:02:04,324 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-02-05 22:02:04,325 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 327 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:04,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1299 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:02:04,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-02-05 22:02:04,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 513. [2025-02-05 22:02:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 397 states have (on average 1.6448362720403022) internal successors, (653), 398 states have internal predecessors, (653), 113 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (113), 112 states have call predecessors, (113), 113 states have call successors, (113) [2025-02-05 22:02:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 879 transitions. [2025-02-05 22:02:04,365 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 879 transitions. Word has length 538 [2025-02-05 22:02:04,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:04,365 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 879 transitions. [2025-02-05 22:02:04,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 879 transitions. [2025-02-05 22:02:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-05 22:02:04,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:04,376 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:04,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:02:04,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:04,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash 298888482, now seen corresponding path program 1 times [2025-02-05 22:02:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:04,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853744950] [2025-02-05 22:02:04,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:04,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:04,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-05 22:02:04,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-05 22:02:04,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:04,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:04,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:04,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853744950] [2025-02-05 22:02:04,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853744950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:04,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:04,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:04,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208610242] [2025-02-05 22:02:04,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:04,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:04,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:04,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:04,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:04,656 INFO L87 Difference]: Start difference. First operand 513 states and 879 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:04,751 INFO L93 Difference]: Finished difference Result 1470 states and 2515 transitions. [2025-02-05 22:02:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:04,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 538 [2025-02-05 22:02:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:04,759 INFO L225 Difference]: With dead ends: 1470 [2025-02-05 22:02:04,759 INFO L226 Difference]: Without dead ends: 960 [2025-02-05 22:02:04,761 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-02-05 22:02:04,761 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 432 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:04,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1426 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:04,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-02-05 22:02:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 587. [2025-02-05 22:02:04,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 471 states have (on average 1.6518046709129512) internal successors, (778), 472 states have internal predecessors, (778), 113 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (113), 112 states have call predecessors, (113), 113 states have call successors, (113) [2025-02-05 22:02:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1004 transitions. [2025-02-05 22:02:04,823 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1004 transitions. Word has length 538 [2025-02-05 22:02:04,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:04,825 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 1004 transitions. [2025-02-05 22:02:04,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:04,825 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1004 transitions. [2025-02-05 22:02:04,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-02-05 22:02:04,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:04,833 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:04,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:02:04,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:04,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:04,834 INFO L85 PathProgramCache]: Analyzing trace with hash -413089432, now seen corresponding path program 1 times [2025-02-05 22:02:04,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:04,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955345279] [2025-02-05 22:02:04,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:04,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:04,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-02-05 22:02:04,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-02-05 22:02:04,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:04,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:05,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:05,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955345279] [2025-02-05 22:02:05,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955345279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:05,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:05,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:05,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602084117] [2025-02-05 22:02:05,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:05,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:05,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:05,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:05,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:05,046 INFO L87 Difference]: Start difference. First operand 587 states and 1004 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:05,126 INFO L93 Difference]: Finished difference Result 1557 states and 2661 transitions. [2025-02-05 22:02:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:05,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 539 [2025-02-05 22:02:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:05,134 INFO L225 Difference]: With dead ends: 1557 [2025-02-05 22:02:05,135 INFO L226 Difference]: Without dead ends: 973 [2025-02-05 22:02:05,136 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-02-05 22:02:05,138 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 320 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:05,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1159 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:02:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2025-02-05 22:02:05,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 970. [2025-02-05 22:02:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 765 states have (on average 1.6366013071895424) internal successors, (1252), 768 states have internal predecessors, (1252), 200 states have call successors, (200), 4 states have call predecessors, (200), 4 states have return successors, (200), 197 states have call predecessors, (200), 200 states have call successors, (200) [2025-02-05 22:02:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1652 transitions. [2025-02-05 22:02:05,217 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1652 transitions. Word has length 539 [2025-02-05 22:02:05,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:05,218 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1652 transitions. [2025-02-05 22:02:05,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1652 transitions. [2025-02-05 22:02:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-02-05 22:02:05,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:05,222 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:05,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:02:05,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:05,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:05,223 INFO L85 PathProgramCache]: Analyzing trace with hash 217369193, now seen corresponding path program 1 times [2025-02-05 22:02:05,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:05,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328463720] [2025-02-05 22:02:05,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:05,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:05,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-02-05 22:02:05,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-02-05 22:02:05,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:05,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:05,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:05,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328463720] [2025-02-05 22:02:05,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328463720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:05,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:05,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:05,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424470443] [2025-02-05 22:02:05,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:05,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:05,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:05,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:05,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:05,419 INFO L87 Difference]: Start difference. First operand 970 states and 1652 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:05,539 INFO L93 Difference]: Finished difference Result 2687 states and 4588 transitions. [2025-02-05 22:02:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:05,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 539 [2025-02-05 22:02:05,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:05,551 INFO L225 Difference]: With dead ends: 2687 [2025-02-05 22:02:05,551 INFO L226 Difference]: Without dead ends: 1720 [2025-02-05 22:02:05,554 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-02-05 22:02:05,555 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 296 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:05,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1041 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2025-02-05 22:02:05,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1714. [2025-02-05 22:02:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1445 states have (on average 1.6498269896193771) internal successors, (2384), 1452 states have internal predecessors, (2384), 260 states have call successors, (260), 8 states have call predecessors, (260), 8 states have return successors, (260), 253 states have call predecessors, (260), 260 states have call successors, (260) [2025-02-05 22:02:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2904 transitions. [2025-02-05 22:02:05,623 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2904 transitions. Word has length 539 [2025-02-05 22:02:05,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:05,624 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2904 transitions. [2025-02-05 22:02:05,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:05,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2904 transitions. [2025-02-05 22:02:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-02-05 22:02:05,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:05,630 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:05,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:02:05,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:05,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:05,631 INFO L85 PathProgramCache]: Analyzing trace with hash -775366605, now seen corresponding path program 1 times [2025-02-05 22:02:05,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:05,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051373519] [2025-02-05 22:02:05,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:05,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:05,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-02-05 22:02:05,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-02-05 22:02:05,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:05,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:05,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:05,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051373519] [2025-02-05 22:02:05,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051373519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:05,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:05,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:05,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529335165] [2025-02-05 22:02:05,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:05,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:05,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:05,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:05,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:05,826 INFO L87 Difference]: Start difference. First operand 1714 states and 2904 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:05,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:05,982 INFO L93 Difference]: Finished difference Result 5136 states and 8706 transitions. [2025-02-05 22:02:05,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:05,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 540 [2025-02-05 22:02:05,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:05,999 INFO L225 Difference]: With dead ends: 5136 [2025-02-05 22:02:05,999 INFO L226 Difference]: Without dead ends: 3425 [2025-02-05 22:02:06,004 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-02-05 22:02:06,005 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 523 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:06,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1110 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2025-02-05 22:02:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 3423. [2025-02-05 22:02:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3423 states, 2886 states have (on average 1.6382536382536383) internal successors, (4728), 2900 states have internal predecessors, (4728), 520 states have call successors, (520), 16 states have call predecessors, (520), 16 states have return successors, (520), 506 states have call predecessors, (520), 520 states have call successors, (520) [2025-02-05 22:02:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3423 states and 5768 transitions. [2025-02-05 22:02:06,150 INFO L78 Accepts]: Start accepts. Automaton has 3423 states and 5768 transitions. Word has length 540 [2025-02-05 22:02:06,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:06,151 INFO L471 AbstractCegarLoop]: Abstraction has 3423 states and 5768 transitions. [2025-02-05 22:02:06,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3423 states and 5768 transitions. [2025-02-05 22:02:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-02-05 22:02:06,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:06,157 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:06,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:02:06,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:06,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:06,158 INFO L85 PathProgramCache]: Analyzing trace with hash 365949076, now seen corresponding path program 1 times [2025-02-05 22:02:06,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:06,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813743840] [2025-02-05 22:02:06,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:06,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:06,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-02-05 22:02:06,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-02-05 22:02:06,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:06,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:06,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:06,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813743840] [2025-02-05 22:02:06,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813743840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:06,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:06,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:02:06,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488319917] [2025-02-05 22:02:06,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:06,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:02:06,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:06,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:02:06,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:02:06,581 INFO L87 Difference]: Start difference. First operand 3423 states and 5768 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:07,103 INFO L93 Difference]: Finished difference Result 8971 states and 15157 transitions. [2025-02-05 22:02:07,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:02:07,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 540 [2025-02-05 22:02:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:07,130 INFO L225 Difference]: With dead ends: 8971 [2025-02-05 22:02:07,131 INFO L226 Difference]: Without dead ends: 5551 [2025-02-05 22:02:07,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:02:07,138 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 609 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:07,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1881 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:02:07,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5551 states. [2025-02-05 22:02:07,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5551 to 5261. [2025-02-05 22:02:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 4642 states have (on average 1.664584230934942) internal successors, (7727), 4656 states have internal predecessors, (7727), 600 states have call successors, (600), 18 states have call predecessors, (600), 18 states have return successors, (600), 586 states have call predecessors, (600), 600 states have call successors, (600) [2025-02-05 22:02:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 8927 transitions. [2025-02-05 22:02:07,362 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 8927 transitions. Word has length 540 [2025-02-05 22:02:07,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:07,363 INFO L471 AbstractCegarLoop]: Abstraction has 5261 states and 8927 transitions. [2025-02-05 22:02:07,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:07,363 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 8927 transitions. [2025-02-05 22:02:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-02-05 22:02:07,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:07,370 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:07,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:02:07,371 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:07,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash -139609549, now seen corresponding path program 1 times [2025-02-05 22:02:07,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:07,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121754678] [2025-02-05 22:02:07,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:07,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:07,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-02-05 22:02:07,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-02-05 22:02:07,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:07,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:07,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:07,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121754678] [2025-02-05 22:02:07,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121754678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:07,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:07,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:02:07,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638714505] [2025-02-05 22:02:07,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:07,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:02:07,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:07,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:02:07,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:02:07,823 INFO L87 Difference]: Start difference. First operand 5261 states and 8927 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:08,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:08,741 INFO L93 Difference]: Finished difference Result 16689 states and 28299 transitions. [2025-02-05 22:02:08,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:02:08,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 540 [2025-02-05 22:02:08,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:08,797 INFO L225 Difference]: With dead ends: 16689 [2025-02-05 22:02:08,797 INFO L226 Difference]: Without dead ends: 12497 [2025-02-05 22:02:08,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-05 22:02:08,813 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 730 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:08,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 2281 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 22:02:08,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2025-02-05 22:02:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 10457. [2025-02-05 22:02:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10457 states, 9301 states have (on average 1.667347597032577) internal successors, (15508), 9329 states have internal predecessors, (15508), 1120 states have call successors, (1120), 35 states have call predecessors, (1120), 35 states have return successors, (1120), 1092 states have call predecessors, (1120), 1120 states have call successors, (1120) [2025-02-05 22:02:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10457 states to 10457 states and 17748 transitions. [2025-02-05 22:02:09,288 INFO L78 Accepts]: Start accepts. Automaton has 10457 states and 17748 transitions. Word has length 540 [2025-02-05 22:02:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:09,289 INFO L471 AbstractCegarLoop]: Abstraction has 10457 states and 17748 transitions. [2025-02-05 22:02:09,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:09,290 INFO L276 IsEmpty]: Start isEmpty. Operand 10457 states and 17748 transitions. [2025-02-05 22:02:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-05 22:02:09,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:09,298 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:09,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:02:09,298 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:09,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:09,298 INFO L85 PathProgramCache]: Analyzing trace with hash 852166336, now seen corresponding path program 1 times [2025-02-05 22:02:09,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:09,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299656761] [2025-02-05 22:02:09,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:09,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:09,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-05 22:02:09,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-05 22:02:09,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:09,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:09,904 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:09,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:09,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299656761] [2025-02-05 22:02:09,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299656761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:09,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:09,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:02:09,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277149095] [2025-02-05 22:02:09,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:09,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:02:09,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:09,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:02:09,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:02:09,906 INFO L87 Difference]: Start difference. First operand 10457 states and 17748 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:11,254 INFO L93 Difference]: Finished difference Result 21329 states and 35875 transitions. [2025-02-05 22:02:11,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:02:11,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 541 [2025-02-05 22:02:11,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:11,293 INFO L225 Difference]: With dead ends: 21329 [2025-02-05 22:02:11,293 INFO L226 Difference]: Without dead ends: 13155 [2025-02-05 22:02:11,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:02:11,311 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 1109 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 676 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 676 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:11,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 2084 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [676 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 22:02:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13155 states. [2025-02-05 22:02:11,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13155 to 10437. [2025-02-05 22:02:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10437 states, 9256 states have (on average 1.6502808988764044) internal successors, (15275), 9284 states have internal predecessors, (15275), 1136 states have call successors, (1136), 44 states have call predecessors, (1136), 44 states have return successors, (1136), 1108 states have call predecessors, (1136), 1136 states have call successors, (1136) [2025-02-05 22:02:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10437 states to 10437 states and 17547 transitions. [2025-02-05 22:02:11,840 INFO L78 Accepts]: Start accepts. Automaton has 10437 states and 17547 transitions. Word has length 541 [2025-02-05 22:02:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:11,841 INFO L471 AbstractCegarLoop]: Abstraction has 10437 states and 17547 transitions. [2025-02-05 22:02:11,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 10437 states and 17547 transitions. [2025-02-05 22:02:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-05 22:02:11,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:11,851 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:11,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:02:11,852 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:11,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:11,852 INFO L85 PathProgramCache]: Analyzing trace with hash 785159583, now seen corresponding path program 1 times [2025-02-05 22:02:11,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:11,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838176637] [2025-02-05 22:02:11,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:11,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:11,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-05 22:02:11,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-05 22:02:11,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:11,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:12,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:12,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838176637] [2025-02-05 22:02:12,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838176637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:12,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:12,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:02:12,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904750072] [2025-02-05 22:02:12,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:12,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:02:12,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:12,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:02:12,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:02:12,411 INFO L87 Difference]: Start difference. First operand 10437 states and 17547 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:13,824 INFO L93 Difference]: Finished difference Result 27633 states and 46194 transitions. [2025-02-05 22:02:13,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:02:13,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 541 [2025-02-05 22:02:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:13,885 INFO L225 Difference]: With dead ends: 27633 [2025-02-05 22:02:13,886 INFO L226 Difference]: Without dead ends: 19331 [2025-02-05 22:02:13,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:02:13,911 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1206 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:13,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 1711 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 22:02:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19331 states. [2025-02-05 22:02:14,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19331 to 15417. [2025-02-05 22:02:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15417 states, 13723 states have (on average 1.646724477155141) internal successors, (22598), 13767 states have internal predecessors, (22598), 1628 states have call successors, (1628), 65 states have call predecessors, (1628), 65 states have return successors, (1628), 1584 states have call predecessors, (1628), 1628 states have call successors, (1628) [2025-02-05 22:02:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15417 states to 15417 states and 25854 transitions. [2025-02-05 22:02:14,459 INFO L78 Accepts]: Start accepts. Automaton has 15417 states and 25854 transitions. Word has length 541 [2025-02-05 22:02:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:14,460 INFO L471 AbstractCegarLoop]: Abstraction has 15417 states and 25854 transitions. [2025-02-05 22:02:14,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 15417 states and 25854 transitions. [2025-02-05 22:02:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-05 22:02:14,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:14,471 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:14,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:02:14,471 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:14,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash 376335358, now seen corresponding path program 1 times [2025-02-05 22:02:14,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:14,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078800304] [2025-02-05 22:02:14,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:14,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:14,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-05 22:02:14,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-05 22:02:14,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:14,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:14,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:14,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078800304] [2025-02-05 22:02:14,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078800304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:14,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:14,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:02:14,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817592979] [2025-02-05 22:02:14,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:14,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:02:14,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:14,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:02:14,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:02:14,883 INFO L87 Difference]: Start difference. First operand 15417 states and 25854 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:15,544 INFO L93 Difference]: Finished difference Result 24865 states and 41663 transitions. [2025-02-05 22:02:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:02:15,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 541 [2025-02-05 22:02:15,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:15,603 INFO L225 Difference]: With dead ends: 24865 [2025-02-05 22:02:15,603 INFO L226 Difference]: Without dead ends: 18647 [2025-02-05 22:02:15,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-02-05 22:02:15,621 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 336 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:15,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1284 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:02:15,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18647 states. [2025-02-05 22:02:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18647 to 15423. [2025-02-05 22:02:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15423 states, 13729 states have (on average 1.6464418384441692) internal successors, (22604), 13773 states have internal predecessors, (22604), 1628 states have call successors, (1628), 65 states have call predecessors, (1628), 65 states have return successors, (1628), 1584 states have call predecessors, (1628), 1628 states have call successors, (1628) [2025-02-05 22:02:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15423 states to 15423 states and 25860 transitions. [2025-02-05 22:02:16,294 INFO L78 Accepts]: Start accepts. Automaton has 15423 states and 25860 transitions. Word has length 541 [2025-02-05 22:02:16,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:16,295 INFO L471 AbstractCegarLoop]: Abstraction has 15423 states and 25860 transitions. [2025-02-05 22:02:16,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 15423 states and 25860 transitions. [2025-02-05 22:02:16,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-05 22:02:16,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:16,306 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:16,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 22:02:16,306 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:16,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:16,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1192032875, now seen corresponding path program 1 times [2025-02-05 22:02:16,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:16,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17457337] [2025-02-05 22:02:16,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:16,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:16,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-05 22:02:16,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-05 22:02:16,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:16,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:16,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:16,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17457337] [2025-02-05 22:02:16,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17457337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:16,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:16,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:02:16,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984915110] [2025-02-05 22:02:16,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:16,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:02:16,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:16,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:02:16,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:02:16,730 INFO L87 Difference]: Start difference. First operand 15423 states and 25860 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:17,354 INFO L93 Difference]: Finished difference Result 27499 states and 45993 transitions. [2025-02-05 22:02:17,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:02:17,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 541 [2025-02-05 22:02:17,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:17,418 INFO L225 Difference]: With dead ends: 27499 [2025-02-05 22:02:17,418 INFO L226 Difference]: Without dead ends: 21821 [2025-02-05 22:02:17,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-02-05 22:02:17,439 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 338 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:17,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1243 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:02:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21821 states. [2025-02-05 22:02:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21821 to 12033. [2025-02-05 22:02:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12033 states, 10633 states have (on average 1.640270854885733) internal successors, (17441), 10665 states have internal predecessors, (17441), 1340 states have call successors, (1340), 59 states have call predecessors, (1340), 59 states have return successors, (1340), 1308 states have call predecessors, (1340), 1340 states have call successors, (1340) [2025-02-05 22:02:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12033 states to 12033 states and 20121 transitions. [2025-02-05 22:02:17,932 INFO L78 Accepts]: Start accepts. Automaton has 12033 states and 20121 transitions. Word has length 541 [2025-02-05 22:02:17,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:17,933 INFO L471 AbstractCegarLoop]: Abstraction has 12033 states and 20121 transitions. [2025-02-05 22:02:17,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:17,933 INFO L276 IsEmpty]: Start isEmpty. Operand 12033 states and 20121 transitions. [2025-02-05 22:02:17,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-05 22:02:17,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:17,942 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:17,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 22:02:17,943 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:17,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:17,943 INFO L85 PathProgramCache]: Analyzing trace with hash 525807354, now seen corresponding path program 1 times [2025-02-05 22:02:17,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:17,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776612423] [2025-02-05 22:02:17,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:17,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:17,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-05 22:02:17,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-05 22:02:17,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:17,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:18,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:18,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776612423] [2025-02-05 22:02:18,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776612423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:18,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:18,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:18,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116722479] [2025-02-05 22:02:18,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:18,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:18,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:18,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:18,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:18,077 INFO L87 Difference]: Start difference. First operand 12033 states and 20121 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:18,607 INFO L93 Difference]: Finished difference Result 34809 states and 58285 transitions. [2025-02-05 22:02:18,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:18,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 541 [2025-02-05 22:02:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:18,663 INFO L225 Difference]: With dead ends: 34809 [2025-02-05 22:02:18,663 INFO L226 Difference]: Without dead ends: 23435 [2025-02-05 22:02:18,677 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-02-05 22:02:18,678 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 506 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:18,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1249 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:18,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23435 states. [2025-02-05 22:02:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23435 to 23381. [2025-02-05 22:02:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23381 states, 20667 states have (on average 1.636328446315382) internal successors, (33818), 20731 states have internal predecessors, (33818), 2600 states have call successors, (2600), 113 states have call predecessors, (2600), 113 states have return successors, (2600), 2536 states have call predecessors, (2600), 2600 states have call successors, (2600) [2025-02-05 22:02:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23381 states to 23381 states and 39018 transitions. [2025-02-05 22:02:19,464 INFO L78 Accepts]: Start accepts. Automaton has 23381 states and 39018 transitions. Word has length 541 [2025-02-05 22:02:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:19,465 INFO L471 AbstractCegarLoop]: Abstraction has 23381 states and 39018 transitions. [2025-02-05 22:02:19,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 23381 states and 39018 transitions. [2025-02-05 22:02:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-05 22:02:19,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:19,482 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:19,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 22:02:19,483 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:19,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:19,483 INFO L85 PathProgramCache]: Analyzing trace with hash -209900288, now seen corresponding path program 1 times [2025-02-05 22:02:19,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:19,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321065490] [2025-02-05 22:02:19,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:19,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-05 22:02:19,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-05 22:02:19,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:19,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:20,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:20,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321065490] [2025-02-05 22:02:20,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321065490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:20,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:20,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:02:20,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127243662] [2025-02-05 22:02:20,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:20,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:02:20,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:20,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:02:20,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:02:20,177 INFO L87 Difference]: Start difference. First operand 23381 states and 39018 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:21,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:21,362 INFO L93 Difference]: Finished difference Result 59437 states and 99078 transitions. [2025-02-05 22:02:21,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:21,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 541 [2025-02-05 22:02:21,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:21,471 INFO L225 Difference]: With dead ends: 59437 [2025-02-05 22:02:21,471 INFO L226 Difference]: Without dead ends: 43135 [2025-02-05 22:02:21,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-02-05 22:02:21,507 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 257 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:21,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1507 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:02:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43135 states. [2025-02-05 22:02:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43135 to 43097. [2025-02-05 22:02:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43097 states, 38871 states have (on average 1.642252579043503) internal successors, (63836), 39007 states have internal predecessors, (63836), 4040 states have call successors, (4040), 185 states have call predecessors, (4040), 185 states have return successors, (4040), 3904 states have call predecessors, (4040), 4040 states have call successors, (4040) [2025-02-05 22:02:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43097 states to 43097 states and 71916 transitions. [2025-02-05 22:02:22,802 INFO L78 Accepts]: Start accepts. Automaton has 43097 states and 71916 transitions. Word has length 541 [2025-02-05 22:02:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:22,803 INFO L471 AbstractCegarLoop]: Abstraction has 43097 states and 71916 transitions. [2025-02-05 22:02:22,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:22,804 INFO L276 IsEmpty]: Start isEmpty. Operand 43097 states and 71916 transitions. [2025-02-05 22:02:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-02-05 22:02:22,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:22,827 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:22,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 22:02:22,827 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:22,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:22,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1825032672, now seen corresponding path program 1 times [2025-02-05 22:02:22,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:22,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121027511] [2025-02-05 22:02:22,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:22,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:22,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-02-05 22:02:22,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-02-05 22:02:22,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:22,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:23,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:23,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121027511] [2025-02-05 22:02:23,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121027511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:23,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:23,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:02:23,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473805652] [2025-02-05 22:02:23,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:23,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:02:23,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:23,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:02:23,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:02:23,237 INFO L87 Difference]: Start difference. First operand 43097 states and 71916 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:26,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:26,283 INFO L93 Difference]: Finished difference Result 125931 states and 209999 transitions. [2025-02-05 22:02:26,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:02:26,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 542 [2025-02-05 22:02:26,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:26,543 INFO L225 Difference]: With dead ends: 125931 [2025-02-05 22:02:26,543 INFO L226 Difference]: Without dead ends: 88605 [2025-02-05 22:02:26,622 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-02-05 22:02:26,623 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 662 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:26,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1844 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:02:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88605 states. [2025-02-05 22:02:28,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88605 to 45833. [2025-02-05 22:02:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45833 states, 41607 states have (on average 1.6369360924844376) internal successors, (68108), 41743 states have internal predecessors, (68108), 4040 states have call successors, (4040), 185 states have call predecessors, (4040), 185 states have return successors, (4040), 3904 states have call predecessors, (4040), 4040 states have call successors, (4040) [2025-02-05 22:02:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45833 states to 45833 states and 76188 transitions. [2025-02-05 22:02:28,869 INFO L78 Accepts]: Start accepts. Automaton has 45833 states and 76188 transitions. Word has length 542 [2025-02-05 22:02:28,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:28,870 INFO L471 AbstractCegarLoop]: Abstraction has 45833 states and 76188 transitions. [2025-02-05 22:02:28,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:28,870 INFO L276 IsEmpty]: Start isEmpty. Operand 45833 states and 76188 transitions. [2025-02-05 22:02:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-02-05 22:02:28,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:28,890 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:28,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 22:02:28,891 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:28,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash -462206178, now seen corresponding path program 1 times [2025-02-05 22:02:28,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379153902] [2025-02-05 22:02:28,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:28,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:28,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-02-05 22:02:28,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-02-05 22:02:28,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:28,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:29,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:29,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379153902] [2025-02-05 22:02:29,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379153902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:29,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:29,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:02:29,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480663196] [2025-02-05 22:02:29,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:29,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:02:29,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:29,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:02:29,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:02:29,041 INFO L87 Difference]: Start difference. First operand 45833 states and 76188 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:31,614 INFO L93 Difference]: Finished difference Result 129035 states and 214123 transitions. [2025-02-05 22:02:31,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:02:31,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 542 [2025-02-05 22:02:31,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:31,821 INFO L225 Difference]: With dead ends: 129035 [2025-02-05 22:02:31,821 INFO L226 Difference]: Without dead ends: 86373 [2025-02-05 22:02:31,892 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-02-05 22:02:31,893 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 689 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:31,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1451 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:02:31,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86373 states. [2025-02-05 22:02:33,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86373 to 16875. [2025-02-05 22:02:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16875 states, 15265 states have (on average 1.6335407795610875) internal successors, (24936), 15309 states have internal predecessors, (24936), 1532 states have call successors, (1532), 77 states have call predecessors, (1532), 77 states have return successors, (1532), 1488 states have call predecessors, (1532), 1532 states have call successors, (1532) [2025-02-05 22:02:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16875 states to 16875 states and 28000 transitions. [2025-02-05 22:02:33,163 INFO L78 Accepts]: Start accepts. Automaton has 16875 states and 28000 transitions. Word has length 542 [2025-02-05 22:02:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:33,164 INFO L471 AbstractCegarLoop]: Abstraction has 16875 states and 28000 transitions. [2025-02-05 22:02:33,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 16875 states and 28000 transitions. [2025-02-05 22:02:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-02-05 22:02:33,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:33,172 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:33,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 22:02:33,172 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:33,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash -945386927, now seen corresponding path program 1 times [2025-02-05 22:02:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:33,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15548014] [2025-02-05 22:02:33,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:33,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:33,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-02-05 22:02:33,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-02-05 22:02:33,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:33,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:33,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:33,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15548014] [2025-02-05 22:02:33,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15548014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:33,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:33,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:02:33,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637316900] [2025-02-05 22:02:33,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:33,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:02:33,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:33,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:02:33,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:02:33,717 INFO L87 Difference]: Start difference. First operand 16875 states and 28000 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:35,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:35,751 INFO L93 Difference]: Finished difference Result 49041 states and 81186 transitions. [2025-02-05 22:02:35,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:02:35,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 542 [2025-02-05 22:02:35,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:35,834 INFO L225 Difference]: With dead ends: 49041 [2025-02-05 22:02:35,835 INFO L226 Difference]: Without dead ends: 35297 [2025-02-05 22:02:35,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:02:35,865 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 1349 mSDsluCounter, 2231 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 2970 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:35,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 2970 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:02:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35297 states. [2025-02-05 22:02:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35297 to 17143. [2025-02-05 22:02:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17143 states, 15533 states have (on average 1.633940642503058) internal successors, (25380), 15577 states have internal predecessors, (25380), 1532 states have call successors, (1532), 77 states have call predecessors, (1532), 77 states have return successors, (1532), 1488 states have call predecessors, (1532), 1532 states have call successors, (1532) [2025-02-05 22:02:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17143 states to 17143 states and 28444 transitions. [2025-02-05 22:02:36,829 INFO L78 Accepts]: Start accepts. Automaton has 17143 states and 28444 transitions. Word has length 542 [2025-02-05 22:02:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:36,829 INFO L471 AbstractCegarLoop]: Abstraction has 17143 states and 28444 transitions. [2025-02-05 22:02:36,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 17143 states and 28444 transitions. [2025-02-05 22:02:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-02-05 22:02:36,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:36,837 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:36,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 22:02:36,837 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:36,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:36,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2112083246, now seen corresponding path program 1 times [2025-02-05 22:02:36,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:36,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750800749] [2025-02-05 22:02:36,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:36,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:36,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-02-05 22:02:36,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-02-05 22:02:36,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:36,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:37,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:37,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750800749] [2025-02-05 22:02:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750800749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:37,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:37,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:02:37,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360393969] [2025-02-05 22:02:37,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:37,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:02:37,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:37,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:02:37,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:02:37,102 INFO L87 Difference]: Start difference. First operand 17143 states and 28444 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:38,988 INFO L93 Difference]: Finished difference Result 47987 states and 79520 transitions. [2025-02-05 22:02:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:02:38,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 542 [2025-02-05 22:02:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:39,055 INFO L225 Difference]: With dead ends: 47987 [2025-02-05 22:02:39,055 INFO L226 Difference]: Without dead ends: 34335 [2025-02-05 22:02:39,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:02:39,080 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 940 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 2836 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:39,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 2836 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:02:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34335 states. [2025-02-05 22:02:40,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34335 to 17275. [2025-02-05 22:02:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17275 states, 15665 states have (on average 1.6308969039259495) internal successors, (25548), 15709 states have internal predecessors, (25548), 1532 states have call successors, (1532), 77 states have call predecessors, (1532), 77 states have return successors, (1532), 1488 states have call predecessors, (1532), 1532 states have call successors, (1532) [2025-02-05 22:02:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17275 states to 17275 states and 28612 transitions. [2025-02-05 22:02:40,343 INFO L78 Accepts]: Start accepts. Automaton has 17275 states and 28612 transitions. Word has length 542 [2025-02-05 22:02:40,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:40,344 INFO L471 AbstractCegarLoop]: Abstraction has 17275 states and 28612 transitions. [2025-02-05 22:02:40,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 22:02:40,344 INFO L276 IsEmpty]: Start isEmpty. Operand 17275 states and 28612 transitions. [2025-02-05 22:02:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-02-05 22:02:40,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:40,352 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:40,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 22:02:40,352 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:40,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:40,353 INFO L85 PathProgramCache]: Analyzing trace with hash -841918524, now seen corresponding path program 1 times [2025-02-05 22:02:40,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:40,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827522440] [2025-02-05 22:02:40,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:40,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:40,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-02-05 22:02:40,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-02-05 22:02:40,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:40,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 22:02:43,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:43,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827522440] [2025-02-05 22:02:43,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827522440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:43,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:43,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 22:02:43,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819481303] [2025-02-05 22:02:43,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:43,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 22:02:43,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:43,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 22:02:43,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-02-05 22:02:43,409 INFO L87 Difference]: Start difference. First operand 17275 states and 28612 transitions. Second operand has 18 states, 18 states have (on average 8.11111111111111) internal successors, (146), 18 states have internal predecessors, (146), 3 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) [2025-02-05 22:03:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:01,010 INFO L93 Difference]: Finished difference Result 125035 states and 205470 transitions. [2025-02-05 22:03:01,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 22:03:01,011 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.11111111111111) internal successors, (146), 18 states have internal predecessors, (146), 3 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) Word has length 543 [2025-02-05 22:03:01,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:01,227 INFO L225 Difference]: With dead ends: 125035 [2025-02-05 22:03:01,227 INFO L226 Difference]: Without dead ends: 112375 [2025-02-05 22:03:01,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=389, Invalid=871, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 22:03:01,262 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 15642 mSDsluCounter, 5262 mSDsCounter, 0 mSdLazyCounter, 6023 mSolverCounterSat, 3478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15642 SdHoareTripleChecker+Valid, 5958 SdHoareTripleChecker+Invalid, 9501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3478 IncrementalHoareTripleChecker+Valid, 6023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:01,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15642 Valid, 5958 Invalid, 9501 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3478 Valid, 6023 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2025-02-05 22:03:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112375 states. [2025-02-05 22:03:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112375 to 60489. [2025-02-05 22:03:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60489 states, 54102 states have (on average 1.6105134745480758) internal successors, (87132), 54334 states have internal predecessors, (87132), 6080 states have call successors, (6080), 306 states have call predecessors, (6080), 306 states have return successors, (6080), 5848 states have call predecessors, (6080), 6080 states have call successors, (6080) [2025-02-05 22:03:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60489 states to 60489 states and 99292 transitions. [2025-02-05 22:03:06,088 INFO L78 Accepts]: Start accepts. Automaton has 60489 states and 99292 transitions. Word has length 543 [2025-02-05 22:03:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:06,089 INFO L471 AbstractCegarLoop]: Abstraction has 60489 states and 99292 transitions. [2025-02-05 22:03:06,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.11111111111111) internal successors, (146), 18 states have internal predecessors, (146), 3 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) [2025-02-05 22:03:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 60489 states and 99292 transitions. [2025-02-05 22:03:06,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-02-05 22:03:06,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:06,116 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:03:06,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 22:03:06,116 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:06,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:06,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1778600924, now seen corresponding path program 1 times [2025-02-05 22:03:06,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:06,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197162979] [2025-02-05 22:03:06,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:06,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:06,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-02-05 22:03:06,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-02-05 22:03:06,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:06,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat