./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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-84.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 12d3a43944bcf873edb66a7d9a5f702d0b9b38d53543038559519bc18ead71d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:01:55,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:01:55,330 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:55,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:01:55,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:01:55,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:01:55,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:01:55,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:01:55,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:01:55,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:01:55,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:01:55,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:01:55,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:01:55,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:01:55,364 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:01:55,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:01:55,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:01:55,365 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:01:55,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:01:55,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:01:55,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:01:55,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:01:55,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:01:55,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:01:55,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:01:55,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:01:55,366 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:01:55,366 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:01:55,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:01:55,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:01:55,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:01:55,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:01:55,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:01:55,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:01:55,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:01:55,366 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:01:55,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:01:55,366 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:01:55,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:01:55,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:01:55,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:01:55,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:01:55,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:01:55,366 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 -> 12d3a43944bcf873edb66a7d9a5f702d0b9b38d53543038559519bc18ead71d6 [2025-02-05 22:01:55,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:01:55,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:01:55,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:01:55,718 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:01:55,718 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:01:55,719 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-84.i [2025-02-05 22:01:56,914 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0235d597/71c3d30a4eeb4906b938eff1681b0d13/FLAGd05ee4bc5 [2025-02-05 22:01:57,193 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:01:57,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-84.i [2025-02-05 22:01:57,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0235d597/71c3d30a4eeb4906b938eff1681b0d13/FLAGd05ee4bc5 [2025-02-05 22:01:57,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0235d597/71c3d30a4eeb4906b938eff1681b0d13 [2025-02-05 22:01:57,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:01:57,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:01:57,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:01:57,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:01:57,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:01:57,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:01:57" (1/1) ... [2025-02-05 22:01:57,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aae8302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:57, skipping insertion in model container [2025-02-05 22:01:57,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:01:57" (1/1) ... [2025-02-05 22:01:57,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:01:57,359 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-84.i[916,929] [2025-02-05 22:01:57,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:01:57,543 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:01:57,550 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-84.i[916,929] [2025-02-05 22:01:57,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:01:57,623 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:01:57,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:57 WrapperNode [2025-02-05 22:01:57,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:01:57,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:01:57,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:01:57,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:01:57,629 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:57" (1/1) ... [2025-02-05 22:01:57,643 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:57" (1/1) ... [2025-02-05 22:01:57,699 INFO L138 Inliner]: procedures = 26, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 991 [2025-02-05 22:01:57,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:01:57,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:01:57,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:01:57,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:01:57,706 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:57" (1/1) ... [2025-02-05 22:01:57,707 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:57" (1/1) ... [2025-02-05 22:01:57,720 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:57" (1/1) ... [2025-02-05 22:01:57,753 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:01:57,756 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:57" (1/1) ... [2025-02-05 22:01:57,757 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:57" (1/1) ... [2025-02-05 22:01:57,784 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:57" (1/1) ... [2025-02-05 22:01:57,792 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:57" (1/1) ... [2025-02-05 22:01:57,801 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:57" (1/1) ... [2025-02-05 22:01:57,808 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:57" (1/1) ... [2025-02-05 22:01:57,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:01:57,819 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:01:57,819 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:01:57,819 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:01:57,820 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:57" (1/1) ... [2025-02-05 22:01:57,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:01:57,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:01:57,851 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:01:57,861 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:01:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:01:57,877 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:01:57,877 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:01:57,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:01:57,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:01:57,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:01:58,022 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:01:58,023 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:01:58,924 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: havoc property_#t~bitwise96#1;havoc property_#t~short97#1;havoc property_#t~bitwise98#1;havoc property_#t~short99#1; [2025-02-05 22:01:59,193 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-02-05 22:01:59,195 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:01:59,237 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:01:59,238 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:01:59,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:01:59 BoogieIcfgContainer [2025-02-05 22:01:59,238 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:01:59,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:01:59,240 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:01:59,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:01:59,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:01:57" (1/3) ... [2025-02-05 22:01:59,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252ef916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:01:59, skipping insertion in model container [2025-02-05 22:01:59,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:57" (2/3) ... [2025-02-05 22:01:59,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252ef916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:01:59, skipping insertion in model container [2025-02-05 22:01:59,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:01:59" (3/3) ... [2025-02-05 22:01:59,246 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-84.i [2025-02-05 22:01:59,256 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:01:59,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-84.i that has 2 procedures, 404 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:01:59,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:01:59,331 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;@65ff14bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:01:59,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:01:59,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 404 states, 276 states have (on average 1.5724637681159421) internal successors, (434), 277 states have internal predecessors, (434), 125 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2025-02-05 22:01:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2025-02-05 22:01:59,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:59,373 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:01:59,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:59,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:59,379 INFO L85 PathProgramCache]: Analyzing trace with hash -343081947, now seen corresponding path program 1 times [2025-02-05 22:01:59,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:59,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455447797] [2025-02-05 22:01:59,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:59,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:59,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 793 statements into 1 equivalence classes. [2025-02-05 22:01:59,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 793 of 793 statements. [2025-02-05 22:01:59,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:59,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 30752 trivial. 0 not checked. [2025-02-05 22:02:00,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:00,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455447797] [2025-02-05 22:02:00,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455447797] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:02:00,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600331783] [2025-02-05 22:02:00,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:00,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:02:00,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:02:00,036 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:00,037 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:00,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 793 statements into 1 equivalence classes. [2025-02-05 22:02:00,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 793 of 793 statements. [2025-02-05 22:02:00,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:00,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:00,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 1783 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:02:00,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:02:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 30752 trivial. 0 not checked. [2025-02-05 22:02:00,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:02:00,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600331783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:00,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:02:00,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:02:00,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440498850] [2025-02-05 22:02:00,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:00,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:02:00,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:00,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:02:00,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:02:00,571 INFO L87 Difference]: Start difference. First operand has 404 states, 276 states have (on average 1.5724637681159421) internal successors, (434), 277 states have internal predecessors, (434), 125 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) [2025-02-05 22:02:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:00,704 INFO L93 Difference]: Finished difference Result 801 states and 1486 transitions. [2025-02-05 22:02:00,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:02:00,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) Word has length 793 [2025-02-05 22:02:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:00,717 INFO L225 Difference]: With dead ends: 801 [2025-02-05 22:02:00,718 INFO L226 Difference]: Without dead ends: 400 [2025-02-05 22:02:00,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 794 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:02:00,727 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:00,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 650 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:02:00,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-02-05 22:02:00,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-02-05 22:02:00,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 273 states have (on average 1.5567765567765568) internal successors, (425), 273 states have internal predecessors, (425), 125 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2025-02-05 22:02:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 675 transitions. [2025-02-05 22:02:00,823 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 675 transitions. Word has length 793 [2025-02-05 22:02:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:00,824 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 675 transitions. [2025-02-05 22:02:00,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) [2025-02-05 22:02:00,825 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 675 transitions. [2025-02-05 22:02:00,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2025-02-05 22:02:00,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:00,842 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:00,851 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:01,043 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:01,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:01,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:01,045 INFO L85 PathProgramCache]: Analyzing trace with hash -839484670, now seen corresponding path program 1 times [2025-02-05 22:02:01,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:01,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612142430] [2025-02-05 22:02:01,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:01,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:01,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-02-05 22:02:01,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-02-05 22:02:01,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:01,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-02-05 22:02:01,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:01,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612142430] [2025-02-05 22:02:01,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612142430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:01,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:01,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:01,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010744359] [2025-02-05 22:02:01,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:01,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:01,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:01,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:01,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:01,682 INFO L87 Difference]: Start difference. First operand 400 states and 675 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:01,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:01,894 INFO L93 Difference]: Finished difference Result 1066 states and 1805 transitions. [2025-02-05 22:02:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:01,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 794 [2025-02-05 22:02:01,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:01,903 INFO L225 Difference]: With dead ends: 1066 [2025-02-05 22:02:01,903 INFO L226 Difference]: Without dead ends: 669 [2025-02-05 22:02:01,904 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:01,905 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 450 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:01,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1396 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:01,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-02-05 22:02:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 666. [2025-02-05 22:02:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 489 states have (on average 1.586912065439673) internal successors, (776), 490 states have internal predecessors, (776), 174 states have call successors, (174), 2 states have call predecessors, (174), 2 states have return successors, (174), 173 states have call predecessors, (174), 174 states have call successors, (174) [2025-02-05 22:02:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1124 transitions. [2025-02-05 22:02:01,956 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1124 transitions. Word has length 794 [2025-02-05 22:02:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:01,957 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1124 transitions. [2025-02-05 22:02:01,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1124 transitions. [2025-02-05 22:02:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2025-02-05 22:02:01,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:01,963 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:01,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:02:01,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:01,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:01,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1809775677, now seen corresponding path program 1 times [2025-02-05 22:02:01,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:01,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662416421] [2025-02-05 22:02:01,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:01,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:02,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-02-05 22:02:02,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-02-05 22:02:02,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:02,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-02-05 22:02:02,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:02,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662416421] [2025-02-05 22:02:02,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662416421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:02,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:02,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:02,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045750658] [2025-02-05 22:02:02,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:02,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:02,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:02,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:02,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:02,284 INFO L87 Difference]: Start difference. First operand 666 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:02,423 INFO L93 Difference]: Finished difference Result 1845 states and 3113 transitions. [2025-02-05 22:02:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:02,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 794 [2025-02-05 22:02:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:02,433 INFO L225 Difference]: With dead ends: 1845 [2025-02-05 22:02:02,434 INFO L226 Difference]: Without dead ends: 1182 [2025-02-05 22:02:02,436 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:02,437 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 467 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:02,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1276 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:02,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-02-05 22:02:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1179. [2025-02-05 22:02:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 874 states have (on average 1.5812356979405033) internal successors, (1382), 877 states have internal predecessors, (1382), 300 states have call successors, (300), 4 states have call predecessors, (300), 4 states have return successors, (300), 297 states have call predecessors, (300), 300 states have call successors, (300) [2025-02-05 22:02:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1982 transitions. [2025-02-05 22:02:02,541 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1982 transitions. Word has length 794 [2025-02-05 22:02:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:02,543 INFO L471 AbstractCegarLoop]: Abstraction has 1179 states and 1982 transitions. [2025-02-05 22:02:02,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1982 transitions. [2025-02-05 22:02:02,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2025-02-05 22:02:02,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:02,549 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:02,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:02:02,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:02,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:02,550 INFO L85 PathProgramCache]: Analyzing trace with hash -827430778, now seen corresponding path program 1 times [2025-02-05 22:02:02,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:02,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916972031] [2025-02-05 22:02:02,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:02,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:02,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-02-05 22:02:02,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-02-05 22:02:02,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:02,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-02-05 22:02:03,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:03,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916972031] [2025-02-05 22:02:03,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916972031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:03,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:03,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:03,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461795675] [2025-02-05 22:02:03,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:03,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:03,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:03,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:03,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:03,055 INFO L87 Difference]: Start difference. First operand 1179 states and 1982 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:03,219 INFO L93 Difference]: Finished difference Result 3363 states and 5650 transitions. [2025-02-05 22:02:03,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:03,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 794 [2025-02-05 22:02:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:03,233 INFO L225 Difference]: With dead ends: 3363 [2025-02-05 22:02:03,233 INFO L226 Difference]: Without dead ends: 2187 [2025-02-05 22:02:03,237 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,238 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 453 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:03,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1477 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:03,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2025-02-05 22:02:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2183. [2025-02-05 22:02:03,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 1626 states have (on average 1.5719557195571956) internal successors, (2556), 1633 states have internal predecessors, (2556), 548 states have call successors, (548), 8 states have call predecessors, (548), 8 states have return successors, (548), 541 states have call predecessors, (548), 548 states have call successors, (548) [2025-02-05 22:02:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3652 transitions. [2025-02-05 22:02:03,413 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3652 transitions. Word has length 794 [2025-02-05 22:02:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:03,414 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 3652 transitions. [2025-02-05 22:02:03,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:03,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3652 transitions. [2025-02-05 22:02:03,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2025-02-05 22:02:03,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:03,427 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:03,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:02:03,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:03,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:03,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1435507641, now seen corresponding path program 1 times [2025-02-05 22:02:03,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:03,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979363398] [2025-02-05 22:02:03,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:03,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:03,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-02-05 22:02:03,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-02-05 22:02:03,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:03,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-02-05 22:02:04,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:04,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979363398] [2025-02-05 22:02:04,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979363398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:04,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:04,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:02:04,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119013490] [2025-02-05 22:02:04,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:04,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:02:04,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:04,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:02:04,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:02:04,159 INFO L87 Difference]: Start difference. First operand 2183 states and 3652 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:04,280 INFO L93 Difference]: Finished difference Result 4443 states and 7445 transitions. [2025-02-05 22:02:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:02:04,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 794 [2025-02-05 22:02:04,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:04,292 INFO L225 Difference]: With dead ends: 4443 [2025-02-05 22:02:04,293 INFO L226 Difference]: Without dead ends: 2263 [2025-02-05 22:02:04,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:02:04,297 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 12 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:04,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1298 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:02:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2025-02-05 22:02:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2215. [2025-02-05 22:02:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 1658 states have (on average 1.5705669481302775) internal successors, (2604), 1665 states have internal predecessors, (2604), 548 states have call successors, (548), 8 states have call predecessors, (548), 8 states have return successors, (548), 541 states have call predecessors, (548), 548 states have call successors, (548) [2025-02-05 22:02:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 3700 transitions. [2025-02-05 22:02:04,391 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 3700 transitions. Word has length 794 [2025-02-05 22:02:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:04,392 INFO L471 AbstractCegarLoop]: Abstraction has 2215 states and 3700 transitions. [2025-02-05 22:02:04,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 3700 transitions. [2025-02-05 22:02:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-02-05 22:02:04,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:04,398 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:04,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:02:04,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:04,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:04,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2132862302, now seen corresponding path program 1 times [2025-02-05 22:02:04,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:04,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429620427] [2025-02-05 22:02:04,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:04,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:04,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-02-05 22:02:04,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-02-05 22:02:04,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:04,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-02-05 22:02:04,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:04,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429620427] [2025-02-05 22:02:04,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429620427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:04,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:04,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:02:04,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846056312] [2025-02-05 22:02:04,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:04,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:02:04,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:04,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:02:04,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:02:04,902 INFO L87 Difference]: Start difference. First operand 2215 states and 3700 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:05,044 INFO L93 Difference]: Finished difference Result 4507 states and 7541 transitions. [2025-02-05 22:02:05,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:02:05,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-02-05 22:02:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:05,060 INFO L225 Difference]: With dead ends: 4507 [2025-02-05 22:02:05,061 INFO L226 Difference]: Without dead ends: 2295 [2025-02-05 22:02:05,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:02:05,068 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 12 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:05,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1306 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2025-02-05 22:02:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2215. [2025-02-05 22:02:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 1658 states have (on average 1.5705669481302775) internal successors, (2604), 1665 states have internal predecessors, (2604), 548 states have call successors, (548), 8 states have call predecessors, (548), 8 states have return successors, (548), 541 states have call predecessors, (548), 548 states have call successors, (548) [2025-02-05 22:02:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 3700 transitions. [2025-02-05 22:02:05,169 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 3700 transitions. Word has length 795 [2025-02-05 22:02:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:05,170 INFO L471 AbstractCegarLoop]: Abstraction has 2215 states and 3700 transitions. [2025-02-05 22:02:05,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:05,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 3700 transitions. [2025-02-05 22:02:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-02-05 22:02:05,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:05,177 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:05,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:02:05,177 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:05,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:05,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1295644095, now seen corresponding path program 1 times [2025-02-05 22:02:05,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:05,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260652626] [2025-02-05 22:02:05,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:05,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:05,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-02-05 22:02:05,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-02-05 22:02:05,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:05,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:06,007 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-02-05 22:02:06,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:06,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260652626] [2025-02-05 22:02:06,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260652626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:06,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:06,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 22:02:06,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953529449] [2025-02-05 22:02:06,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:06,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 22:02:06,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:06,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 22:02:06,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 22:02:06,010 INFO L87 Difference]: Start difference. First operand 2215 states and 3700 transitions. Second operand has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:07,670 INFO L93 Difference]: Finished difference Result 9911 states and 16458 transitions. [2025-02-05 22:02:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 22:02:07,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-02-05 22:02:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:07,708 INFO L225 Difference]: With dead ends: 9911 [2025-02-05 22:02:07,708 INFO L226 Difference]: Without dead ends: 7699 [2025-02-05 22:02:07,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:02:07,721 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 3402 mSDsluCounter, 3050 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3402 SdHoareTripleChecker+Valid, 3904 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:07,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3402 Valid, 3904 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 22:02:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7699 states. [2025-02-05 22:02:07,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7699 to 6121. [2025-02-05 22:02:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6121 states, 5132 states have (on average 1.627435697583788) internal successors, (8352), 5155 states have internal predecessors, (8352), 960 states have call successors, (960), 28 states have call predecessors, (960), 28 states have return successors, (960), 937 states have call predecessors, (960), 960 states have call successors, (960) [2025-02-05 22:02:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 10272 transitions. [2025-02-05 22:02:08,031 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 10272 transitions. Word has length 795 [2025-02-05 22:02:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:08,033 INFO L471 AbstractCegarLoop]: Abstraction has 6121 states and 10272 transitions. [2025-02-05 22:02:08,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 10272 transitions. [2025-02-05 22:02:08,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-02-05 22:02:08,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:08,044 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:08,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:02:08,044 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:08,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:08,045 INFO L85 PathProgramCache]: Analyzing trace with hash 888032832, now seen corresponding path program 1 times [2025-02-05 22:02:08,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:08,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694356472] [2025-02-05 22:02:08,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:08,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:08,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-02-05 22:02:08,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-02-05 22:02:08,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:08,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-02-05 22:02:08,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:08,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694356472] [2025-02-05 22:02:08,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694356472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:08,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:08,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:02:08,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963508749] [2025-02-05 22:02:08,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:08,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:02:08,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:08,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:02:08,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:02:08,536 INFO L87 Difference]: Start difference. First operand 6121 states and 10272 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:09,816 INFO L93 Difference]: Finished difference Result 23475 states and 39349 transitions. [2025-02-05 22:02:09,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:02:09,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-02-05 22:02:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:09,889 INFO L225 Difference]: With dead ends: 23475 [2025-02-05 22:02:09,890 INFO L226 Difference]: Without dead ends: 17357 [2025-02-05 22:02:09,906 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:09,906 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 1201 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:09,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 1979 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 22:02:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17357 states. [2025-02-05 22:02:10,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17357 to 6741. [2025-02-05 22:02:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6741 states, 5752 states have (on average 1.6289986091794157) internal successors, (9370), 5775 states have internal predecessors, (9370), 960 states have call successors, (960), 28 states have call predecessors, (960), 28 states have return successors, (960), 937 states have call predecessors, (960), 960 states have call successors, (960) [2025-02-05 22:02:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6741 states to 6741 states and 11290 transitions. [2025-02-05 22:02:10,427 INFO L78 Accepts]: Start accepts. Automaton has 6741 states and 11290 transitions. Word has length 795 [2025-02-05 22:02:10,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:10,428 INFO L471 AbstractCegarLoop]: Abstraction has 6741 states and 11290 transitions. [2025-02-05 22:02:10,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 6741 states and 11290 transitions. [2025-02-05 22:02:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-02-05 22:02:10,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:10,446 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:10,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:02:10,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:10,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:10,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1068704096, now seen corresponding path program 1 times [2025-02-05 22:02:10,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:10,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888716096] [2025-02-05 22:02:10,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:10,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:10,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-02-05 22:02:10,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-02-05 22:02:10,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:10,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-02-05 22:02:10,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:10,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888716096] [2025-02-05 22:02:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888716096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:10,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:10,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:10,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55351543] [2025-02-05 22:02:10,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:10,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:10,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:10,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:10,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:10,768 INFO L87 Difference]: Start difference. First operand 6741 states and 11290 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:11,118 INFO L93 Difference]: Finished difference Result 20217 states and 33864 transitions. [2025-02-05 22:02:11,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:11,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-02-05 22:02:11,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:11,166 INFO L225 Difference]: With dead ends: 20217 [2025-02-05 22:02:11,166 INFO L226 Difference]: Without dead ends: 13479 [2025-02-05 22:02:11,186 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:11,188 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 454 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:11,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1286 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:11,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13479 states. [2025-02-05 22:02:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13479 to 13477. [2025-02-05 22:02:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13477 states, 11500 states have (on average 1.6250434782608696) internal successors, (18688), 11546 states have internal predecessors, (18688), 1920 states have call successors, (1920), 56 states have call predecessors, (1920), 56 states have return successors, (1920), 1874 states have call predecessors, (1920), 1920 states have call successors, (1920) [2025-02-05 22:02:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13477 states to 13477 states and 22528 transitions. [2025-02-05 22:02:11,754 INFO L78 Accepts]: Start accepts. Automaton has 13477 states and 22528 transitions. Word has length 795 [2025-02-05 22:02:11,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:11,755 INFO L471 AbstractCegarLoop]: Abstraction has 13477 states and 22528 transitions. [2025-02-05 22:02:11,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 13477 states and 22528 transitions. [2025-02-05 22:02:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-02-05 22:02:11,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:11,775 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:11,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:02:11,776 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:11,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1082236897, now seen corresponding path program 1 times [2025-02-05 22:02:11,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:11,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177257322] [2025-02-05 22:02:11,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:11,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:11,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-02-05 22:02:11,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-02-05 22:02:11,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:11,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:12,301 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-02-05 22:02:12,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:12,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177257322] [2025-02-05 22:02:12,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177257322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:12,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:12,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 22:02:12,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578775014] [2025-02-05 22:02:12,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:12,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 22:02:12,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:12,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 22:02:12,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 22:02:12,303 INFO L87 Difference]: Start difference. First operand 13477 states and 22528 transitions. Second operand has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 2 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) [2025-02-05 22:02:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:15,757 INFO L93 Difference]: Finished difference Result 43594 states and 72579 transitions. [2025-02-05 22:02:15,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:02:15,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 2 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) Word has length 795 [2025-02-05 22:02:15,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:15,862 INFO L225 Difference]: With dead ends: 43594 [2025-02-05 22:02:15,863 INFO L226 Difference]: Without dead ends: 30120 [2025-02-05 22:02:15,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:02:15,905 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 3337 mSDsluCounter, 2541 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 1249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3337 SdHoareTripleChecker+Valid, 3756 SdHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1249 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:15,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3337 Valid, 3756 Invalid, 2891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1249 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 22:02:15,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30120 states. [2025-02-05 22:02:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30120 to 27184. [2025-02-05 22:02:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27184 states, 23106 states have (on average 1.6154245650480394) internal successors, (37326), 23199 states have internal predecessors, (37326), 3947 states have call successors, (3947), 130 states have call predecessors, (3947), 130 states have return successors, (3947), 3854 states have call predecessors, (3947), 3947 states have call successors, (3947) [2025-02-05 22:02:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27184 states to 27184 states and 45220 transitions. [2025-02-05 22:02:17,012 INFO L78 Accepts]: Start accepts. Automaton has 27184 states and 45220 transitions. Word has length 795 [2025-02-05 22:02:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:17,013 INFO L471 AbstractCegarLoop]: Abstraction has 27184 states and 45220 transitions. [2025-02-05 22:02:17,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 2 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) [2025-02-05 22:02:17,014 INFO L276 IsEmpty]: Start isEmpty. Operand 27184 states and 45220 transitions. [2025-02-05 22:02:17,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-02-05 22:02:17,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:17,049 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:17,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:02:17,049 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:17,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:17,050 INFO L85 PathProgramCache]: Analyzing trace with hash -725610624, now seen corresponding path program 1 times [2025-02-05 22:02:17,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:17,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551113644] [2025-02-05 22:02:17,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:17,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:17,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-02-05 22:02:17,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-02-05 22:02:17,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:17,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-02-05 22:02:17,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:17,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551113644] [2025-02-05 22:02:17,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551113644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:17,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:17,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 22:02:17,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006225509] [2025-02-05 22:02:17,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:17,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 22:02:17,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:17,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 22:02:17,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 22:02:17,578 INFO L87 Difference]: Start difference. First operand 27184 states and 45220 transitions. Second operand has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:21,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:21,341 INFO L93 Difference]: Finished difference Result 76634 states and 127187 transitions. [2025-02-05 22:02:21,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 22:02:21,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-02-05 22:02:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:21,547 INFO L225 Difference]: With dead ends: 76634 [2025-02-05 22:02:21,547 INFO L226 Difference]: Without dead ends: 49552 [2025-02-05 22:02:21,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-02-05 22:02:21,609 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 5241 mSDsluCounter, 4254 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 888 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5241 SdHoareTripleChecker+Valid, 5107 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 888 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:21,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5241 Valid, 5107 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [888 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 22:02:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49552 states. [2025-02-05 22:02:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49552 to 32136. [2025-02-05 22:02:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32136 states, 27529 states have (on average 1.6192742199135457) internal successors, (44577), 27638 states have internal predecessors, (44577), 4443 states have call successors, (4443), 163 states have call predecessors, (4443), 163 states have return successors, (4443), 4334 states have call predecessors, (4443), 4443 states have call successors, (4443) [2025-02-05 22:02:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32136 states to 32136 states and 53463 transitions. [2025-02-05 22:02:23,285 INFO L78 Accepts]: Start accepts. Automaton has 32136 states and 53463 transitions. Word has length 795 [2025-02-05 22:02:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:23,288 INFO L471 AbstractCegarLoop]: Abstraction has 32136 states and 53463 transitions. [2025-02-05 22:02:23,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 32136 states and 53463 transitions. [2025-02-05 22:02:23,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-02-05 22:02:23,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:23,320 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:23,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:02:23,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:23,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:23,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1458066303, now seen corresponding path program 1 times [2025-02-05 22:02:23,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:23,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801785031] [2025-02-05 22:02:23,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:23,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:23,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-02-05 22:02:23,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-02-05 22:02:23,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:23,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-02-05 22:02:23,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:23,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801785031] [2025-02-05 22:02:23,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801785031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:23,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:23,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:23,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247539013] [2025-02-05 22:02:23,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:23,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:23,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:23,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:23,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:23,788 INFO L87 Difference]: Start difference. First operand 32136 states and 53463 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:25,761 INFO L93 Difference]: Finished difference Result 96196 states and 160065 transitions. [2025-02-05 22:02:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:25,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-02-05 22:02:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:25,928 INFO L225 Difference]: With dead ends: 96196 [2025-02-05 22:02:25,929 INFO L226 Difference]: Without dead ends: 64166 [2025-02-05 22:02:25,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:25,982 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 438 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:25,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1290 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:26,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64166 states. [2025-02-05 22:02:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64166 to 63268. [2025-02-05 22:02:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63268 states, 54117 states have (on average 1.6150377884952973) internal successors, (87401), 54334 states have internal predecessors, (87401), 8827 states have call successors, (8827), 323 states have call predecessors, (8827), 323 states have return successors, (8827), 8610 states have call predecessors, (8827), 8827 states have call successors, (8827) [2025-02-05 22:02:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63268 states to 63268 states and 105055 transitions. [2025-02-05 22:02:29,182 INFO L78 Accepts]: Start accepts. Automaton has 63268 states and 105055 transitions. Word has length 795 [2025-02-05 22:02:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:29,183 INFO L471 AbstractCegarLoop]: Abstraction has 63268 states and 105055 transitions. [2025-02-05 22:02:29,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:29,184 INFO L276 IsEmpty]: Start isEmpty. Operand 63268 states and 105055 transitions. [2025-02-05 22:02:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-02-05 22:02:29,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:29,691 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:29,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 22:02:29,692 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:29,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:29,692 INFO L85 PathProgramCache]: Analyzing trace with hash 224363231, now seen corresponding path program 1 times [2025-02-05 22:02:29,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:29,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717471824] [2025-02-05 22:02:29,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:29,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:29,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-02-05 22:02:29,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-02-05 22:02:29,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:29,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:30,024 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-02-05 22:02:30,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:30,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717471824] [2025-02-05 22:02:30,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717471824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:30,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:30,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:30,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197395139] [2025-02-05 22:02:30,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:30,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:30,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:30,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:30,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:30,027 INFO L87 Difference]: Start difference. First operand 63268 states and 105055 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:32,439 INFO L93 Difference]: Finished difference Result 126430 states and 209948 transitions. [2025-02-05 22:02:32,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:32,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-02-05 22:02:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:32,629 INFO L225 Difference]: With dead ends: 126430 [2025-02-05 22:02:32,629 INFO L226 Difference]: Without dead ends: 63268 [2025-02-05 22:02:32,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:32,736 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 672 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:32,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 646 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:02:32,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63268 states. [2025-02-05 22:02:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63268 to 63268. [2025-02-05 22:02:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63268 states, 54117 states have (on average 1.6108986085703199) internal successors, (87177), 54334 states have internal predecessors, (87177), 8827 states have call successors, (8827), 323 states have call predecessors, (8827), 323 states have return successors, (8827), 8610 states have call predecessors, (8827), 8827 states have call successors, (8827) [2025-02-05 22:02:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63268 states to 63268 states and 104831 transitions. [2025-02-05 22:02:35,989 INFO L78 Accepts]: Start accepts. Automaton has 63268 states and 104831 transitions. Word has length 795 [2025-02-05 22:02:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:35,989 INFO L471 AbstractCegarLoop]: Abstraction has 63268 states and 104831 transitions. [2025-02-05 22:02:35,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 63268 states and 104831 transitions. [2025-02-05 22:02:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-02-05 22:02:36,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:36,041 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:36,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 22:02:36,041 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:36,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash 353445950, now seen corresponding path program 1 times [2025-02-05 22:02:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:36,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143625840] [2025-02-05 22:02:36,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:36,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:36,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-02-05 22:02:36,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-02-05 22:02:36,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:36,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-02-05 22:02:36,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:36,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143625840] [2025-02-05 22:02:36,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143625840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:36,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:36,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:02:36,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128495646] [2025-02-05 22:02:36,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:36,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:02:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:36,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:02:36,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:02:36,522 INFO L87 Difference]: Start difference. First operand 63268 states and 104831 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-05 22:02:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:42,202 INFO L93 Difference]: Finished difference Result 241210 states and 400390 transitions. [2025-02-05 22:02:42,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:02:42,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-02-05 22:02:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:42,810 INFO L225 Difference]: With dead ends: 241210 [2025-02-05 22:02:42,810 INFO L226 Difference]: Without dead ends: 178048 [2025-02-05 22:02:42,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:02:42,921 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 997 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:42,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 2573 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:02:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178048 states.