./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b22327eee78d50d1e1892e34431f5123d0f1cfe06d349ebd74106592553c44aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:37:14,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:37:14,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:37:14,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:37:14,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:37:14,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:37:14,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:37:14,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:37:14,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:37:14,832 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:37:14,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:37:14,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:37:14,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:37:14,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:37:14,833 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:37:14,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:37:14,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:37:14,834 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:37:14,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:37:14,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:37:14,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:37:14,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:37:14,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:37:14,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:37:14,834 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:37:14,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:37:14,834 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:37:14,834 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:37:14,834 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:37:14,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:37:14,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:37:14,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:37:14,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:37:14,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:37:14,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:37:14,835 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:37:14,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:37:14,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:37:14,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:37:14,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:37:14,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:37:14,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:37:14,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:37:14,836 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b22327eee78d50d1e1892e34431f5123d0f1cfe06d349ebd74106592553c44aa [2025-03-04 00:37:15,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:37:15,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:37:15,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:37:15,067 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:37:15,067 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:37:15,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-86.i [2025-03-04 00:37:16,203 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef54bbd3/caf3e27afda2470e95e084efe8e5f7da/FLAGfb3feebf9 [2025-03-04 00:37:16,463 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:37:16,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-86.i [2025-03-04 00:37:16,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef54bbd3/caf3e27afda2470e95e084efe8e5f7da/FLAGfb3feebf9 [2025-03-04 00:37:16,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef54bbd3/caf3e27afda2470e95e084efe8e5f7da [2025-03-04 00:37:16,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:37:16,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:37:16,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:37:16,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:37:16,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:37:16,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:37:16" (1/1) ... [2025-03-04 00:37:16,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d36637b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:16, skipping insertion in model container [2025-03-04 00:37:16,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:37:16" (1/1) ... [2025-03-04 00:37:16,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:37:16,908 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-86.i[916,929] [2025-03-04 00:37:17,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:37:17,079 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:37:17,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-86.i[916,929] [2025-03-04 00:37:17,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:37:17,200 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:37:17,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:17 WrapperNode [2025-03-04 00:37:17,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:37:17,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:37:17,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:37:17,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:37:17,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:17" (1/1) ... [2025-03-04 00:37:17,232 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:17" (1/1) ... [2025-03-04 00:37:17,313 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 711 [2025-03-04 00:37:17,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:37:17,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:37:17,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:37:17,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:37:17,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:17" (1/1) ... [2025-03-04 00:37:17,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:17" (1/1) ... [2025-03-04 00:37:17,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:17" (1/1) ... [2025-03-04 00:37:17,419 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:37:17,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:17" (1/1) ... [2025-03-04 00:37:17,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:17" (1/1) ... [2025-03-04 00:37:17,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:17" (1/1) ... [2025-03-04 00:37:17,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:17" (1/1) ... [2025-03-04 00:37:17,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:17" (1/1) ... [2025-03-04 00:37:17,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:17" (1/1) ... [2025-03-04 00:37:17,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:37:17,474 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:37:17,474 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:37:17,474 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:37:17,476 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:17" (1/1) ... [2025-03-04 00:37:17,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:37:17,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:17,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:37:17,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:37:17,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:37:17,520 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:37:17,520 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:37:17,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:37:17,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:37:17,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:37:17,625 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:37:17,627 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:37:18,570 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L637: havoc property_#t~ite50#1;havoc property_#t~bitwise49#1;havoc property_#t~short51#1;havoc property_#t~ite54#1;havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short55#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short58#1;havoc property_#t~bitwise59#1;havoc property_#t~short60#1;havoc property_#t~ite62#1;havoc property_#t~bitwise61#1;havoc property_#t~short63#1; [2025-03-04 00:37:18,674 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-03-04 00:37:18,674 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:37:18,701 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:37:18,703 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:37:18,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:37:18 BoogieIcfgContainer [2025-03-04 00:37:18,703 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:37:18,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:37:18,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:37:18,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:37:18,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:37:16" (1/3) ... [2025-03-04 00:37:18,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a091715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:37:18, skipping insertion in model container [2025-03-04 00:37:18,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:17" (2/3) ... [2025-03-04 00:37:18,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a091715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:37:18, skipping insertion in model container [2025-03-04 00:37:18,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:37:18" (3/3) ... [2025-03-04 00:37:18,709 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-86.i [2025-03-04 00:37:18,719 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:37:18,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-86.i that has 2 procedures, 284 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:37:18,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:37:18,789 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;@6256254c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:37:18,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:37:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 284 states, 214 states have (on average 1.5560747663551402) internal successors, (333), 215 states have internal predecessors, (333), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 00:37:18,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-04 00:37:18,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:18,818 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:18,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:18,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:18,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2130875978, now seen corresponding path program 1 times [2025-03-04 00:37:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:18,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012270764] [2025-03-04 00:37:18,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:18,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:18,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-04 00:37:18,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-04 00:37:18,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:18,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-03-04 00:37:19,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:19,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012270764] [2025-03-04 00:37:19,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012270764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:19,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428000048] [2025-03-04 00:37:19,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:19,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:19,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:19,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:37:19,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:37:19,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-04 00:37:19,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-04 00:37:19,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:19,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:19,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:37:19,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-03-04 00:37:19,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:37:19,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428000048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:19,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:37:19,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:37:19,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318109662] [2025-03-04 00:37:19,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:19,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:37:19,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:19,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:37:19,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:37:19,778 INFO L87 Difference]: Start difference. First operand has 284 states, 214 states have (on average 1.5560747663551402) internal successors, (333), 215 states have internal predecessors, (333), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-04 00:37:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:19,846 INFO L93 Difference]: Finished difference Result 562 states and 996 transitions. [2025-03-04 00:37:19,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:37:19,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 466 [2025-03-04 00:37:19,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:19,858 INFO L225 Difference]: With dead ends: 562 [2025-03-04 00:37:19,858 INFO L226 Difference]: Without dead ends: 281 [2025-03-04 00:37:19,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:37:19,869 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:19,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:37:19,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-04 00:37:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-03-04 00:37:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 212 states have (on average 1.528301886792453) internal successors, (324), 212 states have internal predecessors, (324), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 00:37:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 458 transitions. [2025-03-04 00:37:19,938 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 458 transitions. Word has length 466 [2025-03-04 00:37:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:19,943 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 458 transitions. [2025-03-04 00:37:19,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-04 00:37:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 458 transitions. [2025-03-04 00:37:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-04 00:37:19,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:19,952 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:19,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:37:20,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:37:20,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:20,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1289809167, now seen corresponding path program 1 times [2025-03-04 00:37:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:20,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558661952] [2025-03-04 00:37:20,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:20,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:20,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-04 00:37:20,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-04 00:37:20,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:20,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:20,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:20,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558661952] [2025-03-04 00:37:20,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558661952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:20,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:20,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:37:20,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783435668] [2025-03-04 00:37:20,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:20,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:37:20,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:20,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:37:20,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:20,727 INFO L87 Difference]: Start difference. First operand 281 states and 458 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:20,902 INFO L93 Difference]: Finished difference Result 819 states and 1334 transitions. [2025-03-04 00:37:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:20,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 468 [2025-03-04 00:37:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:20,908 INFO L225 Difference]: With dead ends: 819 [2025-03-04 00:37:20,908 INFO L226 Difference]: Without dead ends: 541 [2025-03-04 00:37:20,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:20,910 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 400 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:20,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1049 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:20,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-04 00:37:20,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 354. [2025-03-04 00:37:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 285 states have (on average 1.5719298245614035) internal successors, (448), 285 states have internal predecessors, (448), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 00:37:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 582 transitions. [2025-03-04 00:37:20,962 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 582 transitions. Word has length 468 [2025-03-04 00:37:20,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:20,966 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 582 transitions. [2025-03-04 00:37:20,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:20,966 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 582 transitions. [2025-03-04 00:37:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-04 00:37:20,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:20,973 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:20,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:37:20,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:20,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:20,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1067000943, now seen corresponding path program 1 times [2025-03-04 00:37:20,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:20,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718930570] [2025-03-04 00:37:20,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:20,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:21,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-04 00:37:21,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-04 00:37:21,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:21,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:21,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:21,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718930570] [2025-03-04 00:37:21,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718930570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:21,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:21,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:37:21,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700258999] [2025-03-04 00:37:21,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:21,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:37:21,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:21,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:37:21,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:21,428 INFO L87 Difference]: Start difference. First operand 354 states and 582 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:21,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:21,557 INFO L93 Difference]: Finished difference Result 1040 states and 1712 transitions. [2025-03-04 00:37:21,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:21,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 468 [2025-03-04 00:37:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:21,566 INFO L225 Difference]: With dead ends: 1040 [2025-03-04 00:37:21,568 INFO L226 Difference]: Without dead ends: 689 [2025-03-04 00:37:21,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:21,571 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 410 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:21,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1180 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:21,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-03-04 00:37:21,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 687. [2025-03-04 00:37:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 550 states have (on average 1.5581818181818181) internal successors, (857), 550 states have internal predecessors, (857), 134 states have call successors, (134), 2 states have call predecessors, (134), 2 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-04 00:37:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1125 transitions. [2025-03-04 00:37:21,631 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1125 transitions. Word has length 468 [2025-03-04 00:37:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:21,634 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1125 transitions. [2025-03-04 00:37:21,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1125 transitions. [2025-03-04 00:37:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-04 00:37:21,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:21,641 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:21,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:37:21,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:21,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:21,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1313314030, now seen corresponding path program 1 times [2025-03-04 00:37:21,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:21,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380005161] [2025-03-04 00:37:21,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:21,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:21,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-04 00:37:21,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-04 00:37:21,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:21,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:22,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:22,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380005161] [2025-03-04 00:37:22,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380005161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:22,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:22,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:22,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010046251] [2025-03-04 00:37:22,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:22,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:22,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:22,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:22,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:22,468 INFO L87 Difference]: Start difference. First operand 687 states and 1125 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:22,879 INFO L93 Difference]: Finished difference Result 1909 states and 3132 transitions. [2025-03-04 00:37:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:22,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 468 [2025-03-04 00:37:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:22,887 INFO L225 Difference]: With dead ends: 1909 [2025-03-04 00:37:22,888 INFO L226 Difference]: Without dead ends: 1225 [2025-03-04 00:37:22,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:22,893 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 327 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:22,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1301 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:37:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-04 00:37:22,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 810. [2025-03-04 00:37:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 605 states have (on average 1.51900826446281) internal successors, (919), 605 states have internal predecessors, (919), 201 states have call successors, (201), 3 states have call predecessors, (201), 3 states have return successors, (201), 201 states have call predecessors, (201), 201 states have call successors, (201) [2025-03-04 00:37:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1321 transitions. [2025-03-04 00:37:22,987 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1321 transitions. Word has length 468 [2025-03-04 00:37:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:22,989 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1321 transitions. [2025-03-04 00:37:22,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1321 transitions. [2025-03-04 00:37:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-04 00:37:22,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:22,994 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:22,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:37:22,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:22,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:22,995 INFO L85 PathProgramCache]: Analyzing trace with hash -425794569, now seen corresponding path program 1 times [2025-03-04 00:37:22,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:22,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56696554] [2025-03-04 00:37:22,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:22,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:23,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-04 00:37:23,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-04 00:37:23,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:23,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:23,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:23,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56696554] [2025-03-04 00:37:23,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56696554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:23,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:23,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:23,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068867032] [2025-03-04 00:37:23,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:23,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:23,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:23,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:23,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:23,906 INFO L87 Difference]: Start difference. First operand 810 states and 1321 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:24,204 INFO L93 Difference]: Finished difference Result 2193 states and 3565 transitions. [2025-03-04 00:37:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:24,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 468 [2025-03-04 00:37:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:24,214 INFO L225 Difference]: With dead ends: 2193 [2025-03-04 00:37:24,214 INFO L226 Difference]: Without dead ends: 1509 [2025-03-04 00:37:24,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:24,218 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 544 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:24,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1242 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:37:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-03-04 00:37:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1312. [2025-03-04 00:37:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1072 states have (on average 1.5634328358208955) internal successors, (1676), 1074 states have internal predecessors, (1676), 233 states have call successors, (233), 6 states have call predecessors, (233), 6 states have return successors, (233), 231 states have call predecessors, (233), 233 states have call successors, (233) [2025-03-04 00:37:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2142 transitions. [2025-03-04 00:37:24,331 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2142 transitions. Word has length 468 [2025-03-04 00:37:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:24,331 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 2142 transitions. [2025-03-04 00:37:24,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2142 transitions. [2025-03-04 00:37:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-04 00:37:24,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:24,338 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:24,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:37:24,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:24,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash -634492872, now seen corresponding path program 1 times [2025-03-04 00:37:24,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:24,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120525530] [2025-03-04 00:37:24,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:24,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:24,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-04 00:37:24,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-04 00:37:24,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:24,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:24,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:24,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120525530] [2025-03-04 00:37:24,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120525530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:24,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:24,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:24,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519118944] [2025-03-04 00:37:24,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:24,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:24,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:24,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:24,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:24,914 INFO L87 Difference]: Start difference. First operand 1312 states and 2142 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:25,342 INFO L93 Difference]: Finished difference Result 3878 states and 6317 transitions. [2025-03-04 00:37:25,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:25,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 468 [2025-03-04 00:37:25,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:25,357 INFO L225 Difference]: With dead ends: 3878 [2025-03-04 00:37:25,357 INFO L226 Difference]: Without dead ends: 2698 [2025-03-04 00:37:25,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:25,361 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 523 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:25,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1390 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:37:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2025-03-04 00:37:25,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2490. [2025-03-04 00:37:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2080 states have (on average 1.575) internal successors, (3276), 2084 states have internal predecessors, (3276), 399 states have call successors, (399), 10 states have call predecessors, (399), 10 states have return successors, (399), 395 states have call predecessors, (399), 399 states have call successors, (399) [2025-03-04 00:37:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4074 transitions. [2025-03-04 00:37:25,584 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4074 transitions. Word has length 468 [2025-03-04 00:37:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:25,586 INFO L471 AbstractCegarLoop]: Abstraction has 2490 states and 4074 transitions. [2025-03-04 00:37:25,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4074 transitions. [2025-03-04 00:37:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-04 00:37:25,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:25,597 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:25,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:37:25,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:25,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:25,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1478964743, now seen corresponding path program 1 times [2025-03-04 00:37:25,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:25,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045007626] [2025-03-04 00:37:25,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:25,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:25,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-04 00:37:25,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-04 00:37:25,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:25,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:26,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:26,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045007626] [2025-03-04 00:37:26,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045007626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:26,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:26,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:26,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344820758] [2025-03-04 00:37:26,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:26,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:26,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:26,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:26,581 INFO L87 Difference]: Start difference. First operand 2490 states and 4074 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:26,849 INFO L93 Difference]: Finished difference Result 6966 states and 11424 transitions. [2025-03-04 00:37:26,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:26,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 468 [2025-03-04 00:37:26,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:26,871 INFO L225 Difference]: With dead ends: 6966 [2025-03-04 00:37:26,871 INFO L226 Difference]: Without dead ends: 4608 [2025-03-04 00:37:26,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:26,879 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 426 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:26,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1288 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2025-03-04 00:37:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 2522. [2025-03-04 00:37:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2112 states have (on average 1.566287878787879) internal successors, (3308), 2116 states have internal predecessors, (3308), 399 states have call successors, (399), 10 states have call predecessors, (399), 10 states have return successors, (399), 395 states have call predecessors, (399), 399 states have call successors, (399) [2025-03-04 00:37:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 4106 transitions. [2025-03-04 00:37:27,123 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 4106 transitions. Word has length 468 [2025-03-04 00:37:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:27,124 INFO L471 AbstractCegarLoop]: Abstraction has 2522 states and 4106 transitions. [2025-03-04 00:37:27,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 4106 transitions. [2025-03-04 00:37:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-04 00:37:27,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:27,133 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:27,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:37:27,134 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:27,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:27,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1198614854, now seen corresponding path program 1 times [2025-03-04 00:37:27,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:27,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582064050] [2025-03-04 00:37:27,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:27,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:27,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-04 00:37:27,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-04 00:37:27,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:27,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:28,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:28,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582064050] [2025-03-04 00:37:28,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582064050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:28,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:28,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:28,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956300972] [2025-03-04 00:37:28,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:28,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:28,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:28,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:28,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:28,245 INFO L87 Difference]: Start difference. First operand 2522 states and 4106 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:28,668 INFO L93 Difference]: Finished difference Result 7620 states and 12353 transitions. [2025-03-04 00:37:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:28,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 468 [2025-03-04 00:37:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:28,696 INFO L225 Difference]: With dead ends: 7620 [2025-03-04 00:37:28,696 INFO L226 Difference]: Without dead ends: 5230 [2025-03-04 00:37:28,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:28,705 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 658 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:28,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1084 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:37:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5230 states. [2025-03-04 00:37:28,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5230 to 2912. [2025-03-04 00:37:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2912 states, 2502 states have (on average 1.5883293365307753) internal successors, (3974), 2506 states have internal predecessors, (3974), 399 states have call successors, (399), 10 states have call predecessors, (399), 10 states have return successors, (399), 395 states have call predecessors, (399), 399 states have call successors, (399) [2025-03-04 00:37:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 4772 transitions. [2025-03-04 00:37:28,920 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 4772 transitions. Word has length 468 [2025-03-04 00:37:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:28,920 INFO L471 AbstractCegarLoop]: Abstraction has 2912 states and 4772 transitions. [2025-03-04 00:37:28,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:28,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 4772 transitions. [2025-03-04 00:37:28,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-04 00:37:28,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:28,925 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:28,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:37:28,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:28,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:28,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2071658521, now seen corresponding path program 1 times [2025-03-04 00:37:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:28,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478565001] [2025-03-04 00:37:28,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:28,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-04 00:37:29,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-04 00:37:29,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:29,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:29,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:29,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478565001] [2025-03-04 00:37:29,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478565001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:29,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:29,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:29,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146917262] [2025-03-04 00:37:29,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:29,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:29,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:29,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:29,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:29,950 INFO L87 Difference]: Start difference. First operand 2912 states and 4772 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:30,437 INFO L93 Difference]: Finished difference Result 6976 states and 11382 transitions. [2025-03-04 00:37:30,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:30,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 468 [2025-03-04 00:37:30,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:30,459 INFO L225 Difference]: With dead ends: 6976 [2025-03-04 00:37:30,460 INFO L226 Difference]: Without dead ends: 4180 [2025-03-04 00:37:30,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:30,470 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 520 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:30,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1449 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:37:30,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4180 states. [2025-03-04 00:37:30,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4180 to 2978. [2025-03-04 00:37:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2978 states, 2632 states have (on average 1.6117021276595744) internal successors, (4242), 2632 states have internal predecessors, (4242), 335 states have call successors, (335), 10 states have call predecessors, (335), 10 states have return successors, (335), 335 states have call predecessors, (335), 335 states have call successors, (335) [2025-03-04 00:37:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2978 states to 2978 states and 4912 transitions. [2025-03-04 00:37:30,647 INFO L78 Accepts]: Start accepts. Automaton has 2978 states and 4912 transitions. Word has length 468 [2025-03-04 00:37:30,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:30,648 INFO L471 AbstractCegarLoop]: Abstraction has 2978 states and 4912 transitions. [2025-03-04 00:37:30,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:30,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2978 states and 4912 transitions. [2025-03-04 00:37:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-04 00:37:30,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:30,653 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:30,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:37:30,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:30,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:30,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1810504982, now seen corresponding path program 1 times [2025-03-04 00:37:30,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:30,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254027632] [2025-03-04 00:37:30,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:30,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:30,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-04 00:37:30,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-04 00:37:30,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:30,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:35,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:35,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254027632] [2025-03-04 00:37:35,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254027632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:35,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:35,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:37:35,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366180282] [2025-03-04 00:37:35,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:35,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:37:35,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:35,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:37:35,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:37:35,900 INFO L87 Difference]: Start difference. First operand 2978 states and 4912 transitions. Second operand has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-04 00:37:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:38,847 INFO L93 Difference]: Finished difference Result 9992 states and 16540 transitions. [2025-03-04 00:37:38,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:37:38,850 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 468 [2025-03-04 00:37:38,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:38,885 INFO L225 Difference]: With dead ends: 9992 [2025-03-04 00:37:38,885 INFO L226 Difference]: Without dead ends: 7146 [2025-03-04 00:37:38,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:37:38,893 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 1972 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1972 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:38,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1972 Valid, 2051 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-04 00:37:38,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7146 states. [2025-03-04 00:37:39,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7146 to 7010. [2025-03-04 00:37:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7010 states, 6631 states have (on average 1.6403257427235711) internal successors, (10877), 6635 states have internal predecessors, (10877), 359 states have call successors, (359), 19 states have call predecessors, (359), 19 states have return successors, (359), 355 states have call predecessors, (359), 359 states have call successors, (359) [2025-03-04 00:37:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7010 states to 7010 states and 11595 transitions. [2025-03-04 00:37:39,088 INFO L78 Accepts]: Start accepts. Automaton has 7010 states and 11595 transitions. Word has length 468 [2025-03-04 00:37:39,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:39,089 INFO L471 AbstractCegarLoop]: Abstraction has 7010 states and 11595 transitions. [2025-03-04 00:37:39,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-04 00:37:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 7010 states and 11595 transitions. [2025-03-04 00:37:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-04 00:37:39,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:39,135 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:39,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:37:39,136 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:39,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:39,137 INFO L85 PathProgramCache]: Analyzing trace with hash 363458774, now seen corresponding path program 1 times [2025-03-04 00:37:39,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:39,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507508476] [2025-03-04 00:37:39,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:39,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:39,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-04 00:37:39,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-04 00:37:39,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:39,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:39,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:39,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507508476] [2025-03-04 00:37:39,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507508476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:39,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:39,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:39,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543982834] [2025-03-04 00:37:39,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:39,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:39,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:39,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:39,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:39,976 INFO L87 Difference]: Start difference. First operand 7010 states and 11595 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:40,459 INFO L93 Difference]: Finished difference Result 24288 states and 40072 transitions. [2025-03-04 00:37:40,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:40,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 468 [2025-03-04 00:37:40,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:40,498 INFO L225 Difference]: With dead ends: 24288 [2025-03-04 00:37:40,499 INFO L226 Difference]: Without dead ends: 17318 [2025-03-04 00:37:40,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:40,514 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 781 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:40,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1104 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:37:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17318 states. [2025-03-04 00:37:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17318 to 13878. [2025-03-04 00:37:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13878 states, 13499 states have (on average 1.6591599377731683) internal successors, (22397), 13503 states have internal predecessors, (22397), 359 states have call successors, (359), 19 states have call predecessors, (359), 19 states have return successors, (359), 355 states have call predecessors, (359), 359 states have call successors, (359) [2025-03-04 00:37:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13878 states to 13878 states and 23115 transitions. [2025-03-04 00:37:40,833 INFO L78 Accepts]: Start accepts. Automaton has 13878 states and 23115 transitions. Word has length 468 [2025-03-04 00:37:40,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:40,834 INFO L471 AbstractCegarLoop]: Abstraction has 13878 states and 23115 transitions. [2025-03-04 00:37:40,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:40,834 INFO L276 IsEmpty]: Start isEmpty. Operand 13878 states and 23115 transitions. [2025-03-04 00:37:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-04 00:37:40,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:40,847 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:40,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:37:40,849 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:40,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:40,849 INFO L85 PathProgramCache]: Analyzing trace with hash 638145114, now seen corresponding path program 1 times [2025-03-04 00:37:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:40,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775423616] [2025-03-04 00:37:40,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:40,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:40,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-04 00:37:40,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-04 00:37:40,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:40,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:40,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:40,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775423616] [2025-03-04 00:37:40,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775423616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:40,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:40,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:37:40,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960224848] [2025-03-04 00:37:40,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:40,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:37:40,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:40,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:37:40,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:40,995 INFO L87 Difference]: Start difference. First operand 13878 states and 23115 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:41,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:41,308 INFO L93 Difference]: Finished difference Result 37400 states and 62236 transitions. [2025-03-04 00:37:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:41,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 468 [2025-03-04 00:37:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:41,355 INFO L225 Difference]: With dead ends: 37400 [2025-03-04 00:37:41,356 INFO L226 Difference]: Without dead ends: 23658 [2025-03-04 00:37:41,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:41,373 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 429 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:41,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1078 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23658 states. [2025-03-04 00:37:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23658 to 14294. [2025-03-04 00:37:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14294 states, 13915 states have (on average 1.6265181458857347) internal successors, (22633), 13919 states have internal predecessors, (22633), 359 states have call successors, (359), 19 states have call predecessors, (359), 19 states have return successors, (359), 355 states have call predecessors, (359), 359 states have call successors, (359) [2025-03-04 00:37:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14294 states to 14294 states and 23351 transitions. [2025-03-04 00:37:41,700 INFO L78 Accepts]: Start accepts. Automaton has 14294 states and 23351 transitions. Word has length 468 [2025-03-04 00:37:41,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:41,700 INFO L471 AbstractCegarLoop]: Abstraction has 14294 states and 23351 transitions. [2025-03-04 00:37:41,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 14294 states and 23351 transitions. [2025-03-04 00:37:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-04 00:37:41,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:41,713 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:41,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:37:41,714 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:41,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:41,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1121596777, now seen corresponding path program 1 times [2025-03-04 00:37:41,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:41,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135997454] [2025-03-04 00:37:41,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:41,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:41,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-04 00:37:41,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-04 00:37:41,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:41,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:41,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:41,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135997454] [2025-03-04 00:37:41,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135997454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:41,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:41,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:37:41,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746336876] [2025-03-04 00:37:41,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:41,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:37:41,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:41,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:37:41,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:41,860 INFO L87 Difference]: Start difference. First operand 14294 states and 23351 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:42,128 INFO L93 Difference]: Finished difference Result 42150 states and 68880 transitions. [2025-03-04 00:37:42,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:42,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 468 [2025-03-04 00:37:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:42,268 INFO L225 Difference]: With dead ends: 42150 [2025-03-04 00:37:42,268 INFO L226 Difference]: Without dead ends: 27992 [2025-03-04 00:37:42,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:42,279 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 237 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:42,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 970 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27992 states. [2025-03-04 00:37:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27992 to 27986. [2025-03-04 00:37:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27986 states, 27514 states have (on average 1.6239005597150542) internal successors, (44680), 27526 states have internal predecessors, (44680), 439 states have call successors, (439), 32 states have call predecessors, (439), 32 states have return successors, (439), 427 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 00:37:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27986 states to 27986 states and 45558 transitions. [2025-03-04 00:37:43,036 INFO L78 Accepts]: Start accepts. Automaton has 27986 states and 45558 transitions. Word has length 468 [2025-03-04 00:37:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:43,036 INFO L471 AbstractCegarLoop]: Abstraction has 27986 states and 45558 transitions. [2025-03-04 00:37:43,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 27986 states and 45558 transitions. [2025-03-04 00:37:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-04 00:37:43,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:43,059 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:43,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:37:43,060 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:43,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:43,061 INFO L85 PathProgramCache]: Analyzing trace with hash 989693592, now seen corresponding path program 1 times [2025-03-04 00:37:43,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:43,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532983677] [2025-03-04 00:37:43,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:43,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:43,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-04 00:37:43,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-04 00:37:43,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:43,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:43,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532983677] [2025-03-04 00:37:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532983677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:43,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:43,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:37:43,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565238146] [2025-03-04 00:37:43,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:43,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:37:43,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:43,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:37:43,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:43,493 INFO L87 Difference]: Start difference. First operand 27986 states and 45558 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:44,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:44,136 INFO L93 Difference]: Finished difference Result 69318 states and 112756 transitions. [2025-03-04 00:37:44,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:44,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 468 [2025-03-04 00:37:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:44,294 INFO L225 Difference]: With dead ends: 69318 [2025-03-04 00:37:44,294 INFO L226 Difference]: Without dead ends: 41472 [2025-03-04 00:37:44,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:44,314 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 326 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:44,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1092 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41472 states. [2025-03-04 00:37:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41472 to 41446. [2025-03-04 00:37:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41446 states, 40574 states have (on average 1.6158623749198995) internal successors, (65562), 40598 states have internal predecessors, (65562), 811 states have call successors, (811), 60 states have call predecessors, (811), 60 states have return successors, (811), 787 states have call predecessors, (811), 811 states have call successors, (811) [2025-03-04 00:37:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41446 states to 41446 states and 67184 transitions. [2025-03-04 00:37:45,289 INFO L78 Accepts]: Start accepts. Automaton has 41446 states and 67184 transitions. Word has length 468 [2025-03-04 00:37:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:45,290 INFO L471 AbstractCegarLoop]: Abstraction has 41446 states and 67184 transitions. [2025-03-04 00:37:45,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 41446 states and 67184 transitions. [2025-03-04 00:37:45,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-04 00:37:45,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:45,316 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:45,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:37:45,316 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:45,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:45,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2146368643, now seen corresponding path program 1 times [2025-03-04 00:37:45,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:45,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665440495] [2025-03-04 00:37:45,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:45,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:45,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-04 00:37:45,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-04 00:37:45,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:45,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:46,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:46,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665440495] [2025-03-04 00:37:46,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665440495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:46,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:46,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:46,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455800237] [2025-03-04 00:37:46,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:46,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:46,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:46,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:46,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:46,199 INFO L87 Difference]: Start difference. First operand 41446 states and 67184 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:47,050 INFO L93 Difference]: Finished difference Result 85660 states and 138299 transitions. [2025-03-04 00:37:47,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:47,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 469 [2025-03-04 00:37:47,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:47,130 INFO L225 Difference]: With dead ends: 85660 [2025-03-04 00:37:47,130 INFO L226 Difference]: Without dead ends: 43874 [2025-03-04 00:37:47,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:47,169 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 529 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:47,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1499 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:37:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43874 states. [2025-03-04 00:37:47,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43874 to 39438. [2025-03-04 00:37:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39438 states, 38566 states have (on average 1.613493750972359) internal successors, (62226), 38590 states have internal predecessors, (62226), 811 states have call successors, (811), 60 states have call predecessors, (811), 60 states have return successors, (811), 787 states have call predecessors, (811), 811 states have call successors, (811) [2025-03-04 00:37:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39438 states to 39438 states and 63848 transitions. [2025-03-04 00:37:47,946 INFO L78 Accepts]: Start accepts. Automaton has 39438 states and 63848 transitions. Word has length 469 [2025-03-04 00:37:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:47,947 INFO L471 AbstractCegarLoop]: Abstraction has 39438 states and 63848 transitions. [2025-03-04 00:37:47,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 39438 states and 63848 transitions. [2025-03-04 00:37:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-04 00:37:47,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:47,965 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:47,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:37:47,965 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:47,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:47,966 INFO L85 PathProgramCache]: Analyzing trace with hash 661313092, now seen corresponding path program 1 times [2025-03-04 00:37:47,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:47,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104106274] [2025-03-04 00:37:47,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:47,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:47,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-04 00:37:48,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-04 00:37:48,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:48,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:48,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:48,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104106274] [2025-03-04 00:37:48,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104106274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:48,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:48,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:37:48,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693706349] [2025-03-04 00:37:48,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:48,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:37:48,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:48,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:37:48,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:48,098 INFO L87 Difference]: Start difference. First operand 39438 states and 63848 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:48,976 INFO L93 Difference]: Finished difference Result 78454 states and 126886 transitions. [2025-03-04 00:37:48,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:48,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 469 [2025-03-04 00:37:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:49,047 INFO L225 Difference]: With dead ends: 78454 [2025-03-04 00:37:49,047 INFO L226 Difference]: Without dead ends: 39156 [2025-03-04 00:37:49,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:49,088 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 441 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:49,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1016 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39156 states. [2025-03-04 00:37:50,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39156 to 25678. [2025-03-04 00:37:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25678 states, 24806 states have (on average 1.6041280335402726) internal successors, (39792), 24830 states have internal predecessors, (39792), 811 states have call successors, (811), 60 states have call predecessors, (811), 60 states have return successors, (811), 787 states have call predecessors, (811), 811 states have call successors, (811) [2025-03-04 00:37:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25678 states to 25678 states and 41414 transitions. [2025-03-04 00:37:50,303 INFO L78 Accepts]: Start accepts. Automaton has 25678 states and 41414 transitions. Word has length 469 [2025-03-04 00:37:50,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:50,304 INFO L471 AbstractCegarLoop]: Abstraction has 25678 states and 41414 transitions. [2025-03-04 00:37:50,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:37:50,304 INFO L276 IsEmpty]: Start isEmpty. Operand 25678 states and 41414 transitions. [2025-03-04 00:37:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-04 00:37:50,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:50,314 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:50,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 00:37:50,314 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:50,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:50,315 INFO L85 PathProgramCache]: Analyzing trace with hash -909637406, now seen corresponding path program 1 times [2025-03-04 00:37:50,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:50,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431994024] [2025-03-04 00:37:50,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:50,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-04 00:37:51,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-04 00:37:51,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:51,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:37:54,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:54,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431994024] [2025-03-04 00:37:54,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431994024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:54,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:54,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-04 00:37:54,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535835846] [2025-03-04 00:37:54,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:54,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 00:37:54,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:54,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 00:37:54,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2025-03-04 00:37:54,469 INFO L87 Difference]: Start difference. First operand 25678 states and 41414 transitions. Second operand has 24 states, 24 states have (on average 5.708333333333333) internal successors, (137), 24 states have internal predecessors, (137), 6 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 6 states have call predecessors, (67), 6 states have call successors, (67) [2025-03-04 00:38:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:11,613 INFO L93 Difference]: Finished difference Result 134704 states and 215106 transitions. [2025-03-04 00:38:11,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-04 00:38:11,614 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.708333333333333) internal successors, (137), 24 states have internal predecessors, (137), 6 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 6 states have call predecessors, (67), 6 states have call successors, (67) Word has length 469 [2025-03-04 00:38:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:11,807 INFO L225 Difference]: With dead ends: 134704 [2025-03-04 00:38:11,807 INFO L226 Difference]: Without dead ends: 109166 [2025-03-04 00:38:11,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=967, Invalid=3193, Unknown=0, NotChecked=0, Total=4160 [2025-03-04 00:38:11,868 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 7398 mSDsluCounter, 9245 mSDsCounter, 0 mSdLazyCounter, 9449 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7398 SdHoareTripleChecker+Valid, 10067 SdHoareTripleChecker+Invalid, 10047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 9449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:11,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7398 Valid, 10067 Invalid, 10047 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [598 Valid, 9449 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2025-03-04 00:38:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109166 states. [2025-03-04 00:38:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109166 to 41308. [2025-03-04 00:38:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41308 states, 39503 states have (on average 1.590588056603296) internal successors, (62833), 39563 states have internal predecessors, (62833), 1651 states have call successors, (1651), 153 states have call predecessors, (1651), 153 states have return successors, (1651), 1591 states have call predecessors, (1651), 1651 states have call successors, (1651) [2025-03-04 00:38:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41308 states to 41308 states and 66135 transitions. [2025-03-04 00:38:13,568 INFO L78 Accepts]: Start accepts. Automaton has 41308 states and 66135 transitions. Word has length 469 [2025-03-04 00:38:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:13,569 INFO L471 AbstractCegarLoop]: Abstraction has 41308 states and 66135 transitions. [2025-03-04 00:38:13,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.708333333333333) internal successors, (137), 24 states have internal predecessors, (137), 6 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 6 states have call predecessors, (67), 6 states have call successors, (67) [2025-03-04 00:38:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 41308 states and 66135 transitions. [2025-03-04 00:38:13,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-04 00:38:13,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:13,585 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:38:13,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 00:38:13,585 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:13,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:13,586 INFO L85 PathProgramCache]: Analyzing trace with hash -279178781, now seen corresponding path program 1 times [2025-03-04 00:38:13,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:13,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708137583] [2025-03-04 00:38:13,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:13,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:13,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-04 00:38:14,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-04 00:38:14,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:14,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:38:16,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:16,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708137583] [2025-03-04 00:38:16,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708137583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:16,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:16,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-04 00:38:16,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656392769] [2025-03-04 00:38:16,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:16,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 00:38:16,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:16,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 00:38:16,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:38:16,333 INFO L87 Difference]: Start difference. First operand 41308 states and 66135 transitions. Second operand has 20 states, 20 states have (on average 6.85) internal successors, (137), 20 states have internal predecessors, (137), 5 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 5 states have call predecessors, (67), 5 states have call successors, (67) [2025-03-04 00:38:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:24,798 INFO L93 Difference]: Finished difference Result 140150 states and 224270 transitions. [2025-03-04 00:38:24,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 00:38:24,799 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.85) internal successors, (137), 20 states have internal predecessors, (137), 5 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 5 states have call predecessors, (67), 5 states have call successors, (67) Word has length 469 [2025-03-04 00:38:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:24,950 INFO L225 Difference]: With dead ends: 140150 [2025-03-04 00:38:24,950 INFO L226 Difference]: Without dead ends: 98986 [2025-03-04 00:38:24,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=432, Invalid=1208, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 00:38:24,988 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 4810 mSDsluCounter, 4039 mSDsCounter, 0 mSdLazyCounter, 5699 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4810 SdHoareTripleChecker+Valid, 4556 SdHoareTripleChecker+Invalid, 5854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 5699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:24,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4810 Valid, 4556 Invalid, 5854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 5699 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-04 00:38:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98986 states. [2025-03-04 00:38:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98986 to 47536. [2025-03-04 00:38:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47536 states, 45599 states have (on average 1.5901225904076843) internal successors, (72508), 45671 states have internal predecessors, (72508), 1747 states have call successors, (1747), 189 states have call predecessors, (1747), 189 states have return successors, (1747), 1675 states have call predecessors, (1747), 1747 states have call successors, (1747) [2025-03-04 00:38:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47536 states to 47536 states and 76002 transitions. [2025-03-04 00:38:26,965 INFO L78 Accepts]: Start accepts. Automaton has 47536 states and 76002 transitions. Word has length 469 [2025-03-04 00:38:26,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:26,966 INFO L471 AbstractCegarLoop]: Abstraction has 47536 states and 76002 transitions. [2025-03-04 00:38:26,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.85) internal successors, (137), 20 states have internal predecessors, (137), 5 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 5 states have call predecessors, (67), 5 states have call successors, (67) [2025-03-04 00:38:26,966 INFO L276 IsEmpty]: Start isEmpty. Operand 47536 states and 76002 transitions. [2025-03-04 00:38:26,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-04 00:38:26,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:26,984 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:38:26,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 00:38:26,984 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:26,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:26,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1832111588, now seen corresponding path program 1 times [2025-03-04 00:38:26,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:26,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779106468] [2025-03-04 00:38:26,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:26,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:27,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-04 00:38:27,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-04 00:38:27,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:27,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat