./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-63.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-63.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 c66ddf4ed963c9002160029fe33b5c34d87306e43d6877b57e0974d5eaabbb18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:34:52,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:34:52,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:34:52,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:34:52,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:34:53,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:34:53,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:34:53,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:34:53,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:34:53,014 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:34:53,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:34:53,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:34:53,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:34:53,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:34:53,016 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:34:53,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:34:53,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:34:53,016 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:34:53,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:34:53,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:34:53,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:34:53,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:34:53,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:34:53,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:34:53,016 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:34:53,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:34:53,016 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:34:53,016 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:34:53,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:34:53,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:34:53,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:34:53,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:34:53,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:34:53,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:34:53,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:34:53,017 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:34:53,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:34:53,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:34:53,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:34:53,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:34:53,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:34:53,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:34:53,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:34:53,017 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 -> c66ddf4ed963c9002160029fe33b5c34d87306e43d6877b57e0974d5eaabbb18 [2025-03-04 00:34:53,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:34:53,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:34:53,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:34:53,266 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:34:53,267 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:34:53,268 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-63.i [2025-03-04 00:34:54,416 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2481c1219/1be46abbc74a4c5da80901388ec44d12/FLAGfbc44fe5e [2025-03-04 00:34:54,721 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:34:54,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-63.i [2025-03-04 00:34:54,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2481c1219/1be46abbc74a4c5da80901388ec44d12/FLAGfbc44fe5e [2025-03-04 00:34:54,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2481c1219/1be46abbc74a4c5da80901388ec44d12 [2025-03-04 00:34:54,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:34:54,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:34:54,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:34:54,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:34:55,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:34:55,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:34:54" (1/1) ... [2025-03-04 00:34:55,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:55, skipping insertion in model container [2025-03-04 00:34:55,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:34:54" (1/1) ... [2025-03-04 00:34:55,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:34:55,126 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-63.i[916,929] [2025-03-04 00:34:55,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:34:55,293 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:34:55,302 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-63.i[916,929] [2025-03-04 00:34:55,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:34:55,419 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:34:55,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:55 WrapperNode [2025-03-04 00:34:55,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:34:55,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:34:55,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:34:55,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:34:55,426 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:34:55" (1/1) ... [2025-03-04 00:34:55,450 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:34:55" (1/1) ... [2025-03-04 00:34:55,555 INFO L138 Inliner]: procedures = 26, calls = 81, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 739 [2025-03-04 00:34:55,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:34:55,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:34:55,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:34:55,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:34:55,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:55" (1/1) ... [2025-03-04 00:34:55,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:55" (1/1) ... [2025-03-04 00:34:55,586 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:55" (1/1) ... [2025-03-04 00:34:55,678 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:34:55,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:55" (1/1) ... [2025-03-04 00:34:55,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:55" (1/1) ... [2025-03-04 00:34:55,714 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:55" (1/1) ... [2025-03-04 00:34:55,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:55" (1/1) ... [2025-03-04 00:34:55,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:55" (1/1) ... [2025-03-04 00:34:55,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:55" (1/1) ... [2025-03-04 00:34:55,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:34:55,753 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:34:55,755 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:34:55,755 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:34:55,756 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:55" (1/1) ... [2025-03-04 00:34:55,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:34:55,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:34:55,782 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:34:55,784 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:34:55,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:34:55,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:34:55,803 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:34:55,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:34:55,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:34:55,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:34:55,936 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:34:55,938 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:34:56,746 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L672: havoc property_#t~ite49#1;havoc property_#t~bitwise48#1;havoc property_#t~short50#1;havoc property_#t~ite52#1;havoc property_#t~bitwise51#1;havoc property_#t~short53#1;havoc property_#t~bitwise54#1;havoc property_#t~short55#1;havoc property_#t~ite58#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short59#1;havoc property_#t~bitwise60#1;havoc property_#t~short61#1; [2025-03-04 00:34:56,880 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-04 00:34:56,881 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:34:56,901 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:34:56,901 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:34:56,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:34:56 BoogieIcfgContainer [2025-03-04 00:34:56,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:34:56,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:34:56,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:34:56,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:34:56,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:34:54" (1/3) ... [2025-03-04 00:34:56,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4994b756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:34:56, skipping insertion in model container [2025-03-04 00:34:56,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:55" (2/3) ... [2025-03-04 00:34:56,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4994b756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:34:56, skipping insertion in model container [2025-03-04 00:34:56,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:34:56" (3/3) ... [2025-03-04 00:34:56,913 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-63.i [2025-03-04 00:34:56,924 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:34:56,926 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-63.i that has 2 procedures, 279 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:34:56,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:34:56,989 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;@3ea851f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:34:56,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:34:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 208 states have (on average 1.5288461538461537) internal successors, (318), 209 states have internal predecessors, (318), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 00:34:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-04 00:34:57,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:57,016 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:57,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:57,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:57,021 INFO L85 PathProgramCache]: Analyzing trace with hash -884569537, now seen corresponding path program 1 times [2025-03-04 00:34:57,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:57,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448360998] [2025-03-04 00:34:57,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:57,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:57,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-04 00:34:57,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-04 00:34:57,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:57,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2025-03-04 00:34:57,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:57,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448360998] [2025-03-04 00:34:57,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448360998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:34:57,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045820097] [2025-03-04 00:34:57,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:57,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:34:57,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:34:57,563 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:34:57,565 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:34:57,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-04 00:34:57,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-04 00:34:57,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:57,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:57,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:34:57,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:34:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2025-03-04 00:34:57,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:34:57,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045820097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:34:57,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:34:57,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:34:57,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717977024] [2025-03-04 00:34:57,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:34:58,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:34:58,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:58,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:34:58,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:34:58,024 INFO L87 Difference]: Start difference. First operand has 279 states, 208 states have (on average 1.5288461538461537) internal successors, (318), 209 states have internal predecessors, (318), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) 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, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-04 00:34:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:58,083 INFO L93 Difference]: Finished difference Result 552 states and 971 transitions. [2025-03-04 00:34:58,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:34:58,085 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, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) Word has length 471 [2025-03-04 00:34:58,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:58,096 INFO L225 Difference]: With dead ends: 552 [2025-03-04 00:34:58,097 INFO L226 Difference]: Without dead ends: 276 [2025-03-04 00:34:58,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 472 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:34:58,108 INFO L435 NwaCegarLoop]: 437 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, 437 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:34:58,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:34:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-04 00:34:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-03-04 00:34:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 206 states have (on average 1.5097087378640777) internal successors, (311), 206 states have internal predecessors, (311), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 00:34:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 447 transitions. [2025-03-04 00:34:58,181 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 447 transitions. Word has length 471 [2025-03-04 00:34:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:58,182 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 447 transitions. [2025-03-04 00:34:58,182 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, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-04 00:34:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 447 transitions. [2025-03-04 00:34:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-04 00:34:58,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:58,196 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:58,205 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:34:58,400 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:34:58,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:58,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1352344425, now seen corresponding path program 1 times [2025-03-04 00:34:58,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:58,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531308204] [2025-03-04 00:34:58,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:58,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:58,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-04 00:34:58,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-04 00:34:58,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:58,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:34:58,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:58,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531308204] [2025-03-04 00:34:58,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531308204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:34:58,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:34:58,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:34:58,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968925174] [2025-03-04 00:34:58,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:34:58,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:34:58,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:58,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:34:58,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:34:58,904 INFO L87 Difference]: Start difference. First operand 276 states and 447 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:34:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:59,050 INFO L93 Difference]: Finished difference Result 722 states and 1170 transitions. [2025-03-04 00:34:59,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:34:59,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 471 [2025-03-04 00:34:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:59,057 INFO L225 Difference]: With dead ends: 722 [2025-03-04 00:34:59,057 INFO L226 Difference]: Without dead ends: 449 [2025-03-04 00:34:59,058 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:34:59,058 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 260 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:59,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 830 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:34:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-04 00:34:59,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 446. [2025-03-04 00:34:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 367 states have (on average 1.550408719346049) internal successors, (569), 368 states have internal predecessors, (569), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 00:34:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 721 transitions. [2025-03-04 00:34:59,105 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 721 transitions. Word has length 471 [2025-03-04 00:34:59,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:59,107 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 721 transitions. [2025-03-04 00:34:59,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:34:59,108 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 721 transitions. [2025-03-04 00:34:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-04 00:34:59,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:59,115 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:59,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:34:59,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:59,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:59,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1463330791, now seen corresponding path program 1 times [2025-03-04 00:34:59,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:59,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006872466] [2025-03-04 00:34:59,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:59,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:59,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-04 00:34:59,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-04 00:34:59,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:59,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:34:59,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:59,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006872466] [2025-03-04 00:34:59,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006872466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:34:59,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:34:59,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:34:59,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405021851] [2025-03-04 00:34:59,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:34:59,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:34:59,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:59,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:34:59,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:34:59,520 INFO L87 Difference]: Start difference. First operand 446 states and 721 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:34:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:59,672 INFO L93 Difference]: Finished difference Result 1320 states and 2135 transitions. [2025-03-04 00:34:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:34:59,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 471 [2025-03-04 00:34:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:59,682 INFO L225 Difference]: With dead ends: 1320 [2025-03-04 00:34:59,683 INFO L226 Difference]: Without dead ends: 877 [2025-03-04 00:34:59,684 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:34:59,685 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 417 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:59,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1064 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:34:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-04 00:34:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 554. [2025-03-04 00:34:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 475 states have (on average 1.5726315789473684) internal successors, (747), 476 states have internal predecessors, (747), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 00:34:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 899 transitions. [2025-03-04 00:34:59,747 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 899 transitions. Word has length 471 [2025-03-04 00:34:59,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:59,748 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 899 transitions. [2025-03-04 00:34:59,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:34:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 899 transitions. [2025-03-04 00:34:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-04 00:34:59,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:59,757 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:59,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:34:59,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:59,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1901340294, now seen corresponding path program 1 times [2025-03-04 00:34:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886252912] [2025-03-04 00:34:59,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:59,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:59,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-04 00:34:59,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-04 00:34:59,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:59,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:00,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:00,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886252912] [2025-03-04 00:35:00,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886252912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:00,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:00,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:35:00,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970928632] [2025-03-04 00:35:00,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:00,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:35:00,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:00,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:35:00,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:35:00,019 INFO L87 Difference]: Start difference. First operand 554 states and 899 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:00,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:00,133 INFO L93 Difference]: Finished difference Result 1632 states and 2647 transitions. [2025-03-04 00:35:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:35:00,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 471 [2025-03-04 00:35:00,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:00,142 INFO L225 Difference]: With dead ends: 1632 [2025-03-04 00:35:00,143 INFO L226 Difference]: Without dead ends: 1081 [2025-03-04 00:35:00,147 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:35:00,149 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 417 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:00,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 833 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:35:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-03-04 00:35:00,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 792. [2025-03-04 00:35:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 713 states have (on average 1.600280504908836) internal successors, (1141), 714 states have internal predecessors, (1141), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 00:35:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1293 transitions. [2025-03-04 00:35:00,219 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1293 transitions. Word has length 471 [2025-03-04 00:35:00,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:00,220 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1293 transitions. [2025-03-04 00:35:00,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1293 transitions. [2025-03-04 00:35:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-04 00:35:00,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:00,226 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:00,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:35:00,227 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:00,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:00,227 INFO L85 PathProgramCache]: Analyzing trace with hash -422687545, now seen corresponding path program 1 times [2025-03-04 00:35:00,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:00,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367723654] [2025-03-04 00:35:00,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:00,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:00,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-04 00:35:00,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-04 00:35:00,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:00,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:00,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:00,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367723654] [2025-03-04 00:35:00,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367723654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:00,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:35:00,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616055625] [2025-03-04 00:35:00,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:00,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:35:00,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:00,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:35:00,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:35:00,734 INFO L87 Difference]: Start difference. First operand 792 states and 1293 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-04 00:35:01,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:01,191 INFO L93 Difference]: Finished difference Result 2987 states and 4881 transitions. [2025-03-04 00:35:01,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:35:01,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) Word has length 471 [2025-03-04 00:35:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:01,202 INFO L225 Difference]: With dead ends: 2987 [2025-03-04 00:35:01,202 INFO L226 Difference]: Without dead ends: 2198 [2025-03-04 00:35:01,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:35:01,206 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 902 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:01,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 1495 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:35:01,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2025-03-04 00:35:01,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 932. [2025-03-04 00:35:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 783 states have (on average 1.5670498084291187) internal successors, (1227), 784 states have internal predecessors, (1227), 144 states have call successors, (144), 4 states have call predecessors, (144), 4 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 00:35:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1515 transitions. [2025-03-04 00:35:01,285 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1515 transitions. Word has length 471 [2025-03-04 00:35:01,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:01,287 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1515 transitions. [2025-03-04 00:35:01,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-04 00:35:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1515 transitions. [2025-03-04 00:35:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-04 00:35:01,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:01,294 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:01,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:35:01,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:01,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2094109050, now seen corresponding path program 1 times [2025-03-04 00:35:01,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:01,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509843156] [2025-03-04 00:35:01,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:01,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:01,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-04 00:35:01,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-04 00:35:01,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:01,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:01,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:01,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509843156] [2025-03-04 00:35:01,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509843156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:01,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:01,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:35:01,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249188443] [2025-03-04 00:35:01,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:01,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:35:01,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:01,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:35:01,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:35:01,882 INFO L87 Difference]: Start difference. First operand 932 states and 1515 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:02,281 INFO L93 Difference]: Finished difference Result 2939 states and 4803 transitions. [2025-03-04 00:35:02,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:35:02,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 471 [2025-03-04 00:35:02,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:02,290 INFO L225 Difference]: With dead ends: 2939 [2025-03-04 00:35:02,290 INFO L226 Difference]: Without dead ends: 2150 [2025-03-04 00:35:02,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:35:02,293 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 601 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:02,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1560 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:35:02,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2025-03-04 00:35:02,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1162. [2025-03-04 00:35:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1013 states have (on average 1.5745310957551826) internal successors, (1595), 1014 states have internal predecessors, (1595), 144 states have call successors, (144), 4 states have call predecessors, (144), 4 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 00:35:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1883 transitions. [2025-03-04 00:35:02,345 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1883 transitions. Word has length 471 [2025-03-04 00:35:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:02,346 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1883 transitions. [2025-03-04 00:35:02,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1883 transitions. [2025-03-04 00:35:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-04 00:35:02,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:02,351 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:02,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:35:02,351 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:02,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:02,352 INFO L85 PathProgramCache]: Analyzing trace with hash 500117767, now seen corresponding path program 1 times [2025-03-04 00:35:02,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:02,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488114010] [2025-03-04 00:35:02,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:02,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:02,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-04 00:35:02,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-04 00:35:02,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:02,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488114010] [2025-03-04 00:35:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488114010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:02,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:02,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:35:02,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639528846] [2025-03-04 00:35:02,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:02,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:35:02,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:02,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:35:02,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:35:02,783 INFO L87 Difference]: Start difference. First operand 1162 states and 1883 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:03,343 INFO L93 Difference]: Finished difference Result 3065 states and 4961 transitions. [2025-03-04 00:35:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:35:03,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 471 [2025-03-04 00:35:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:03,355 INFO L225 Difference]: With dead ends: 3065 [2025-03-04 00:35:03,355 INFO L226 Difference]: Without dead ends: 2276 [2025-03-04 00:35:03,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:35:03,359 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 697 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:03,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 2160 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:35:03,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2025-03-04 00:35:03,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1288. [2025-03-04 00:35:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1139 states have (on average 1.5812115891132572) internal successors, (1801), 1140 states have internal predecessors, (1801), 144 states have call successors, (144), 4 states have call predecessors, (144), 4 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 00:35:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 2089 transitions. [2025-03-04 00:35:03,422 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 2089 transitions. Word has length 471 [2025-03-04 00:35:03,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:03,423 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 2089 transitions. [2025-03-04 00:35:03,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 2089 transitions. [2025-03-04 00:35:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-04 00:35:03,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:03,427 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:03,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:35:03,427 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:03,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:03,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1844549274, now seen corresponding path program 1 times [2025-03-04 00:35:03,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:03,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169382129] [2025-03-04 00:35:03,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:03,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:03,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-04 00:35:03,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-04 00:35:03,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:03,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:05,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:05,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169382129] [2025-03-04 00:35:05,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169382129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:05,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:05,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:35:05,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085502027] [2025-03-04 00:35:05,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:05,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:35:05,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:05,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:35:05,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:35:05,255 INFO L87 Difference]: Start difference. First operand 1288 states and 2089 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-04 00:35:05,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:05,928 INFO L93 Difference]: Finished difference Result 2821 states and 4574 transitions. [2025-03-04 00:35:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:35:05,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) Word has length 471 [2025-03-04 00:35:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:05,937 INFO L225 Difference]: With dead ends: 2821 [2025-03-04 00:35:05,937 INFO L226 Difference]: Without dead ends: 1866 [2025-03-04 00:35:05,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:35:05,941 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 425 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:05,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1652 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:35:05,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2025-03-04 00:35:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1304. [2025-03-04 00:35:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1155 states have (on average 1.5766233766233766) internal successors, (1821), 1156 states have internal predecessors, (1821), 144 states have call successors, (144), 4 states have call predecessors, (144), 4 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 00:35:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 2109 transitions. [2025-03-04 00:35:06,003 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 2109 transitions. Word has length 471 [2025-03-04 00:35:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:06,004 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 2109 transitions. [2025-03-04 00:35:06,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-04 00:35:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 2109 transitions. [2025-03-04 00:35:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-04 00:35:06,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:06,007 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:06,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:35:06,008 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:06,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:06,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2085089403, now seen corresponding path program 1 times [2025-03-04 00:35:06,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:06,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239769734] [2025-03-04 00:35:06,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:06,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:06,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-04 00:35:07,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-04 00:35:07,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:07,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:11,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:11,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239769734] [2025-03-04 00:35:11,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239769734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:11,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:11,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:35:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137303972] [2025-03-04 00:35:11,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:11,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:35:11,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:11,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:35:11,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:35:11,333 INFO L87 Difference]: Start difference. First operand 1304 states and 2109 transitions. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:13,232 INFO L93 Difference]: Finished difference Result 3241 states and 5195 transitions. [2025-03-04 00:35:13,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:35:13,233 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 471 [2025-03-04 00:35:13,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:13,242 INFO L225 Difference]: With dead ends: 3241 [2025-03-04 00:35:13,242 INFO L226 Difference]: Without dead ends: 2334 [2025-03-04 00:35:13,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:35:13,245 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 1857 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1857 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:13,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1857 Valid, 2143 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 00:35:13,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2025-03-04 00:35:13,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2053. [2025-03-04 00:35:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 1895 states have (on average 1.5857519788918206) internal successors, (3005), 1897 states have internal predecessors, (3005), 150 states have call successors, (150), 7 states have call predecessors, (150), 7 states have return successors, (150), 148 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-04 00:35:13,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3305 transitions. [2025-03-04 00:35:13,332 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3305 transitions. Word has length 471 [2025-03-04 00:35:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:13,334 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 3305 transitions. [2025-03-04 00:35:13,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3305 transitions. [2025-03-04 00:35:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-04 00:35:13,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:13,338 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:13,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:35:13,339 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:13,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:13,340 INFO L85 PathProgramCache]: Analyzing trace with hash -623509404, now seen corresponding path program 1 times [2025-03-04 00:35:13,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:13,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573606811] [2025-03-04 00:35:13,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:13,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:13,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-04 00:35:13,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-04 00:35:13,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:13,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:17,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:17,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573606811] [2025-03-04 00:35:17,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573606811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:17,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:17,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 00:35:17,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338374233] [2025-03-04 00:35:17,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:17,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:35:17,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:17,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:35:17,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:35:17,165 INFO L87 Difference]: Start difference. First operand 2053 states and 3305 transitions. Second operand has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:19,657 INFO L93 Difference]: Finished difference Result 5254 states and 8483 transitions. [2025-03-04 00:35:19,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 00:35:19,658 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 471 [2025-03-04 00:35:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:19,669 INFO L225 Difference]: With dead ends: 5254 [2025-03-04 00:35:19,669 INFO L226 Difference]: Without dead ends: 3744 [2025-03-04 00:35:19,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2025-03-04 00:35:19,673 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 1868 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 2715 SdHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:19,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1868 Valid, 2715 Invalid, 1780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 00:35:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2025-03-04 00:35:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 2272. [2025-03-04 00:35:19,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2114 states have (on average 1.587038789025544) internal successors, (3355), 2116 states have internal predecessors, (3355), 150 states have call successors, (150), 7 states have call predecessors, (150), 7 states have return successors, (150), 148 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-04 00:35:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 3655 transitions. [2025-03-04 00:35:19,741 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 3655 transitions. Word has length 471 [2025-03-04 00:35:19,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:19,742 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 3655 transitions. [2025-03-04 00:35:19,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 3655 transitions. [2025-03-04 00:35:19,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-04 00:35:19,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:19,746 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:19,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:35:19,746 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:19,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:19,747 INFO L85 PathProgramCache]: Analyzing trace with hash 485305795, now seen corresponding path program 1 times [2025-03-04 00:35:19,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:19,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089501311] [2025-03-04 00:35:19,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:19,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:19,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-04 00:35:19,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-04 00:35:19,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:19,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:20,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089501311] [2025-03-04 00:35:20,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089501311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:20,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:20,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:35:20,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79597281] [2025-03-04 00:35:20,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:20,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:35:20,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:20,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:35:20,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:35:20,314 INFO L87 Difference]: Start difference. First operand 2272 states and 3655 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:20,688 INFO L93 Difference]: Finished difference Result 4774 states and 7717 transitions. [2025-03-04 00:35:20,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:35:20,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 471 [2025-03-04 00:35:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:20,700 INFO L225 Difference]: With dead ends: 4774 [2025-03-04 00:35:20,700 INFO L226 Difference]: Without dead ends: 2884 [2025-03-04 00:35:20,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:35:20,705 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 318 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:20,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1554 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:35:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2025-03-04 00:35:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 2119. [2025-03-04 00:35:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 1961 states have (on average 1.590515043345232) internal successors, (3119), 1963 states have internal predecessors, (3119), 150 states have call successors, (150), 7 states have call predecessors, (150), 7 states have return successors, (150), 148 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-04 00:35:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 3419 transitions. [2025-03-04 00:35:20,779 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 3419 transitions. Word has length 471 [2025-03-04 00:35:20,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:20,780 INFO L471 AbstractCegarLoop]: Abstraction has 2119 states and 3419 transitions. [2025-03-04 00:35:20,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:20,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3419 transitions. [2025-03-04 00:35:20,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-04 00:35:20,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:20,784 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:20,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:35:20,784 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:20,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:20,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1840069309, now seen corresponding path program 1 times [2025-03-04 00:35:20,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:20,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756406214] [2025-03-04 00:35:20,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:20,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:20,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-04 00:35:20,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-04 00:35:20,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:20,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:21,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:21,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756406214] [2025-03-04 00:35:21,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756406214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:21,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:21,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:35:21,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943344569] [2025-03-04 00:35:21,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:21,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:35:21,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:21,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:35:21,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:35:21,360 INFO L87 Difference]: Start difference. First operand 2119 states and 3419 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:21,720 INFO L93 Difference]: Finished difference Result 3832 states and 6174 transitions. [2025-03-04 00:35:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:35:21,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 472 [2025-03-04 00:35:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:21,727 INFO L225 Difference]: With dead ends: 3832 [2025-03-04 00:35:21,728 INFO L226 Difference]: Without dead ends: 1983 [2025-03-04 00:35:21,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:35:21,732 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 812 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:21,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1916 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:35:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2025-03-04 00:35:21,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1762. [2025-03-04 00:35:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1609 states have (on average 1.576755748912368) internal successors, (2537), 1610 states have internal predecessors, (2537), 144 states have call successors, (144), 8 states have call predecessors, (144), 8 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 00:35:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2825 transitions. [2025-03-04 00:35:21,789 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2825 transitions. Word has length 472 [2025-03-04 00:35:21,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:21,789 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2825 transitions. [2025-03-04 00:35:21,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2825 transitions. [2025-03-04 00:35:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-04 00:35:21,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:21,812 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:21,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:35:21,812 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:21,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:21,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1132153501, now seen corresponding path program 1 times [2025-03-04 00:35:21,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:21,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041024839] [2025-03-04 00:35:21,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:21,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-04 00:35:21,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-04 00:35:21,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:21,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:21,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:21,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041024839] [2025-03-04 00:35:21,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041024839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:21,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:21,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:35:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771563900] [2025-03-04 00:35:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:21,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:35:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:21,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:35:21,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:35:21,947 INFO L87 Difference]: Start difference. First operand 1762 states and 2825 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:22,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:22,043 INFO L93 Difference]: Finished difference Result 3646 states and 5837 transitions. [2025-03-04 00:35:22,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:35:22,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 472 [2025-03-04 00:35:22,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:22,075 INFO L225 Difference]: With dead ends: 3646 [2025-03-04 00:35:22,075 INFO L226 Difference]: Without dead ends: 2223 [2025-03-04 00:35:22,076 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:35:22,078 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 393 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:22,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1031 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:35:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2025-03-04 00:35:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1732. [2025-03-04 00:35:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1579 states have (on average 1.5554148195060165) internal successors, (2456), 1580 states have internal predecessors, (2456), 144 states have call successors, (144), 8 states have call predecessors, (144), 8 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 00:35:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2744 transitions. [2025-03-04 00:35:22,140 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2744 transitions. Word has length 472 [2025-03-04 00:35:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:22,141 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2744 transitions. [2025-03-04 00:35:22,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2744 transitions. [2025-03-04 00:35:22,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-04 00:35:22,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:22,144 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:22,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:35:22,145 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:22,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:22,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1392676020, now seen corresponding path program 1 times [2025-03-04 00:35:22,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:22,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250541250] [2025-03-04 00:35:22,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:22,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:22,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-04 00:35:22,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-04 00:35:22,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:22,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:23,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:23,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250541250] [2025-03-04 00:35:23,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250541250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:23,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:23,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:35:23,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653328090] [2025-03-04 00:35:23,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:23,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:35:23,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:23,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:35:23,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:35:23,101 INFO L87 Difference]: Start difference. First operand 1732 states and 2744 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:23,739 INFO L93 Difference]: Finished difference Result 4962 states and 7852 transitions. [2025-03-04 00:35:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:35:23,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 473 [2025-03-04 00:35:23,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:23,756 INFO L225 Difference]: With dead ends: 4962 [2025-03-04 00:35:23,756 INFO L226 Difference]: Without dead ends: 3601 [2025-03-04 00:35:23,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:35:23,759 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 1138 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:23,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 1744 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:35:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3601 states. [2025-03-04 00:35:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3601 to 3486. [2025-03-04 00:35:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3486 states, 3219 states have (on average 1.5585585585585586) internal successors, (5017), 3222 states have internal predecessors, (5017), 251 states have call successors, (251), 15 states have call predecessors, (251), 15 states have return successors, (251), 248 states have call predecessors, (251), 251 states have call successors, (251) [2025-03-04 00:35:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 5519 transitions. [2025-03-04 00:35:23,854 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 5519 transitions. Word has length 473 [2025-03-04 00:35:23,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:23,855 INFO L471 AbstractCegarLoop]: Abstraction has 3486 states and 5519 transitions. [2025-03-04 00:35:23,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 5519 transitions. [2025-03-04 00:35:23,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-04 00:35:23,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:23,860 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:23,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:35:23,860 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:23,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash -26715427, now seen corresponding path program 1 times [2025-03-04 00:35:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:23,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770313098] [2025-03-04 00:35:23,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:23,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:23,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-04 00:35:23,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-04 00:35:23,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:23,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:24,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:24,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770313098] [2025-03-04 00:35:24,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770313098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:24,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:24,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:35:24,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442325285] [2025-03-04 00:35:24,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:24,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:35:24,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:24,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:35:24,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:35:24,378 INFO L87 Difference]: Start difference. First operand 3486 states and 5519 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:24,860 INFO L93 Difference]: Finished difference Result 10811 states and 17122 transitions. [2025-03-04 00:35:24,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:35:24,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 473 [2025-03-04 00:35:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:24,882 INFO L225 Difference]: With dead ends: 10811 [2025-03-04 00:35:24,882 INFO L226 Difference]: Without dead ends: 7393 [2025-03-04 00:35:24,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:35:24,892 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 887 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:24,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1344 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:35:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7393 states. [2025-03-04 00:35:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7393 to 6250. [2025-03-04 00:35:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6250 states, 5858 states have (on average 1.5565039262546945) internal successors, (9118), 5866 states have internal predecessors, (9118), 364 states have call successors, (364), 27 states have call predecessors, (364), 27 states have return successors, (364), 356 states have call predecessors, (364), 364 states have call successors, (364) [2025-03-04 00:35:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6250 states to 6250 states and 9846 transitions. [2025-03-04 00:35:25,125 INFO L78 Accepts]: Start accepts. Automaton has 6250 states and 9846 transitions. Word has length 473 [2025-03-04 00:35:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:25,125 INFO L471 AbstractCegarLoop]: Abstraction has 6250 states and 9846 transitions. [2025-03-04 00:35:25,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 6250 states and 9846 transitions. [2025-03-04 00:35:25,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-04 00:35:25,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:25,134 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:25,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:35:25,135 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:25,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:25,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2131551092, now seen corresponding path program 1 times [2025-03-04 00:35:25,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:25,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37843808] [2025-03-04 00:35:25,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:25,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:25,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-04 00:35:25,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-04 00:35:25,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:25,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:25,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:25,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37843808] [2025-03-04 00:35:25,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37843808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:25,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:25,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:35:25,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197812906] [2025-03-04 00:35:25,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:25,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:35:25,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:25,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:35:25,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:35:25,274 INFO L87 Difference]: Start difference. First operand 6250 states and 9846 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, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:25,475 INFO L93 Difference]: Finished difference Result 12261 states and 19166 transitions. [2025-03-04 00:35:25,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:35:25,475 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, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 473 [2025-03-04 00:35:25,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:25,495 INFO L225 Difference]: With dead ends: 12261 [2025-03-04 00:35:25,496 INFO L226 Difference]: Without dead ends: 7112 [2025-03-04 00:35:25,504 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:35:25,505 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 403 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:25,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1193 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:35:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7112 states. [2025-03-04 00:35:25,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7112 to 5806. [2025-03-04 00:35:25,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5806 states, 5414 states have (on average 1.5271518285925378) internal successors, (8268), 5422 states have internal predecessors, (8268), 364 states have call successors, (364), 27 states have call predecessors, (364), 27 states have return successors, (364), 356 states have call predecessors, (364), 364 states have call successors, (364) [2025-03-04 00:35:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5806 states to 5806 states and 8996 transitions. [2025-03-04 00:35:25,670 INFO L78 Accepts]: Start accepts. Automaton has 5806 states and 8996 transitions. Word has length 473 [2025-03-04 00:35:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:25,670 INFO L471 AbstractCegarLoop]: Abstraction has 5806 states and 8996 transitions. [2025-03-04 00:35:25,671 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, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 5806 states and 8996 transitions. [2025-03-04 00:35:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-04 00:35:25,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:25,679 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:25,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 00:35:25,679 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:25,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:25,680 INFO L85 PathProgramCache]: Analyzing trace with hash 227755917, now seen corresponding path program 1 times [2025-03-04 00:35:25,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:25,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448358099] [2025-03-04 00:35:25,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:25,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:25,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-04 00:35:25,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-04 00:35:25,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:25,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:25,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:25,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448358099] [2025-03-04 00:35:25,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448358099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:25,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:25,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:35:25,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292857853] [2025-03-04 00:35:25,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:25,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:35:25,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:25,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:35:25,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:35:25,984 INFO L87 Difference]: Start difference. First operand 5806 states and 8996 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:26,632 INFO L93 Difference]: Finished difference Result 17746 states and 27517 transitions. [2025-03-04 00:35:26,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:35:26,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 473 [2025-03-04 00:35:26,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:26,663 INFO L225 Difference]: With dead ends: 17746 [2025-03-04 00:35:26,663 INFO L226 Difference]: Without dead ends: 13277 [2025-03-04 00:35:26,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:35:26,672 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 844 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:26,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 2834 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:35:26,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2025-03-04 00:35:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 8720. [2025-03-04 00:35:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8720 states, 8008 states have (on average 1.516983016983017) internal successors, (12148), 8024 states have internal predecessors, (12148), 660 states have call successors, (660), 51 states have call predecessors, (660), 51 states have return successors, (660), 644 states have call predecessors, (660), 660 states have call successors, (660) [2025-03-04 00:35:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8720 states to 8720 states and 13468 transitions. [2025-03-04 00:35:26,936 INFO L78 Accepts]: Start accepts. Automaton has 8720 states and 13468 transitions. Word has length 473 [2025-03-04 00:35:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:26,939 INFO L471 AbstractCegarLoop]: Abstraction has 8720 states and 13468 transitions. [2025-03-04 00:35:26,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 8720 states and 13468 transitions. [2025-03-04 00:35:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-04 00:35:26,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:26,947 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:26,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 00:35:26,947 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:26,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:26,949 INFO L85 PathProgramCache]: Analyzing trace with hash 557521678, now seen corresponding path program 1 times [2025-03-04 00:35:26,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:26,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557321538] [2025-03-04 00:35:26,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:27,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-04 00:35:27,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-04 00:35:27,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:27,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:31,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:31,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:31,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557321538] [2025-03-04 00:35:31,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557321538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:31,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:31,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 00:35:31,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092834136] [2025-03-04 00:35:31,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:31,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:35:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:31,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:35:31,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:35:31,647 INFO L87 Difference]: Start difference. First operand 8720 states and 13468 transitions. Second operand has 16 states, 16 states have (on average 8.5) internal successors, (136), 16 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:35,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:35,050 INFO L93 Difference]: Finished difference Result 23103 states and 35476 transitions. [2025-03-04 00:35:35,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 00:35:35,051 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.5) internal successors, (136), 16 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 473 [2025-03-04 00:35:35,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:35,082 INFO L225 Difference]: With dead ends: 23103 [2025-03-04 00:35:35,083 INFO L226 Difference]: Without dead ends: 15836 [2025-03-04 00:35:35,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=407, Invalid=1075, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 00:35:35,098 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 3351 mSDsluCounter, 4217 mSDsCounter, 0 mSdLazyCounter, 3028 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3351 SdHoareTripleChecker+Valid, 4845 SdHoareTripleChecker+Invalid, 3270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 3028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:35,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3351 Valid, 4845 Invalid, 3270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 3028 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-04 00:35:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15836 states. [2025-03-04 00:35:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15836 to 10455. [2025-03-04 00:35:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10455 states, 9743 states have (on average 1.5231448219234323) internal successors, (14840), 9759 states have internal predecessors, (14840), 660 states have call successors, (660), 51 states have call predecessors, (660), 51 states have return successors, (660), 644 states have call predecessors, (660), 660 states have call successors, (660) [2025-03-04 00:35:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10455 states to 10455 states and 16160 transitions. [2025-03-04 00:35:35,432 INFO L78 Accepts]: Start accepts. Automaton has 10455 states and 16160 transitions. Word has length 473 [2025-03-04 00:35:35,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:35,434 INFO L471 AbstractCegarLoop]: Abstraction has 10455 states and 16160 transitions. [2025-03-04 00:35:35,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.5) internal successors, (136), 16 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 10455 states and 16160 transitions. [2025-03-04 00:35:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-04 00:35:35,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:35,442 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:35,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 00:35:35,442 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:35,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:35,443 INFO L85 PathProgramCache]: Analyzing trace with hash 416895996, now seen corresponding path program 1 times [2025-03-04 00:35:35,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:35,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464441635] [2025-03-04 00:35:35,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:35,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:35,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-04 00:35:35,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-04 00:35:35,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:35,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:35,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:35,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:35,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464441635] [2025-03-04 00:35:35,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464441635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:35,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:35,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:35:35,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843226411] [2025-03-04 00:35:35,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:35,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:35:35,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:35,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:35:35,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:35:35,790 INFO L87 Difference]: Start difference. First operand 10455 states and 16160 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, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:36,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:36,371 INFO L93 Difference]: Finished difference Result 31209 states and 48177 transitions. [2025-03-04 00:35:36,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:35:36,371 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, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 473 [2025-03-04 00:35:36,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:36,409 INFO L225 Difference]: With dead ends: 31209 [2025-03-04 00:35:36,409 INFO L226 Difference]: Without dead ends: 21036 [2025-03-04 00:35:36,422 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:35:36,423 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 524 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:36,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1768 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:35:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21036 states. [2025-03-04 00:35:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21036 to 12915. [2025-03-04 00:35:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12915 states, 12203 states have (on average 1.5146275506023108) internal successors, (18483), 12219 states have internal predecessors, (18483), 660 states have call successors, (660), 51 states have call predecessors, (660), 51 states have return successors, (660), 644 states have call predecessors, (660), 660 states have call successors, (660) [2025-03-04 00:35:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12915 states to 12915 states and 19803 transitions. [2025-03-04 00:35:36,755 INFO L78 Accepts]: Start accepts. Automaton has 12915 states and 19803 transitions. Word has length 473 [2025-03-04 00:35:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:36,756 INFO L471 AbstractCegarLoop]: Abstraction has 12915 states and 19803 transitions. [2025-03-04 00:35:36,756 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, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:36,756 INFO L276 IsEmpty]: Start isEmpty. Operand 12915 states and 19803 transitions. [2025-03-04 00:35:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-04 00:35:36,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:36,767 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:36,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 00:35:36,767 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:36,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:36,767 INFO L85 PathProgramCache]: Analyzing trace with hash -749800323, now seen corresponding path program 1 times [2025-03-04 00:35:36,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:36,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140258307] [2025-03-04 00:35:36,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:36,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:36,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-04 00:35:36,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-04 00:35:36,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:36,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:37,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:37,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140258307] [2025-03-04 00:35:37,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140258307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:37,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:37,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:35:37,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25954670] [2025-03-04 00:35:37,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:37,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:35:37,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:37,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:35:37,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:35:37,352 INFO L87 Difference]: Start difference. First operand 12915 states and 19803 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, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:37,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:37,744 INFO L93 Difference]: Finished difference Result 33436 states and 51411 transitions. [2025-03-04 00:35:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:35:37,745 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, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 473 [2025-03-04 00:35:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:37,782 INFO L225 Difference]: With dead ends: 33436 [2025-03-04 00:35:37,782 INFO L226 Difference]: Without dead ends: 22855 [2025-03-04 00:35:37,802 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:35:37,802 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 631 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:37,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 1370 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:35:37,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22855 states. [2025-03-04 00:35:38,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22855 to 13577. [2025-03-04 00:35:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13577 states, 12865 states have (on average 1.516206762534007) internal successors, (19506), 12881 states have internal predecessors, (19506), 660 states have call successors, (660), 51 states have call predecessors, (660), 51 states have return successors, (660), 644 states have call predecessors, (660), 660 states have call successors, (660) [2025-03-04 00:35:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13577 states to 13577 states and 20826 transitions. [2025-03-04 00:35:38,187 INFO L78 Accepts]: Start accepts. Automaton has 13577 states and 20826 transitions. Word has length 473 [2025-03-04 00:35:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:38,187 INFO L471 AbstractCegarLoop]: Abstraction has 13577 states and 20826 transitions. [2025-03-04 00:35:38,187 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, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 13577 states and 20826 transitions. [2025-03-04 00:35:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-04 00:35:38,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:38,197 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:38,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 00:35:38,197 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:38,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1693049037, now seen corresponding path program 1 times [2025-03-04 00:35:38,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:38,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699391188] [2025-03-04 00:35:38,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:38,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:38,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-04 00:35:38,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-04 00:35:38,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:38,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:38,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:38,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699391188] [2025-03-04 00:35:38,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699391188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:38,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:38,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:35:38,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206897863] [2025-03-04 00:35:38,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:38,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:35:38,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:38,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:35:38,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:35:38,625 INFO L87 Difference]: Start difference. First operand 13577 states and 20826 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:39,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:39,083 INFO L93 Difference]: Finished difference Result 30658 states and 47002 transitions. [2025-03-04 00:35:39,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:35:39,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 473 [2025-03-04 00:35:39,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:39,110 INFO L225 Difference]: With dead ends: 30658 [2025-03-04 00:35:39,110 INFO L226 Difference]: Without dead ends: 20856 [2025-03-04 00:35:39,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:35:39,123 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 701 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:39,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 1731 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:35:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20856 states. [2025-03-04 00:35:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20856 to 18248. [2025-03-04 00:35:39,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18248 states, 17508 states have (on average 1.5161069225496915) internal successors, (26544), 17528 states have internal predecessors, (26544), 684 states have call successors, (684), 55 states have call predecessors, (684), 55 states have return successors, (684), 664 states have call predecessors, (684), 684 states have call successors, (684) [2025-03-04 00:35:39,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18248 states to 18248 states and 27912 transitions. [2025-03-04 00:35:39,455 INFO L78 Accepts]: Start accepts. Automaton has 18248 states and 27912 transitions. Word has length 473 [2025-03-04 00:35:39,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:39,455 INFO L471 AbstractCegarLoop]: Abstraction has 18248 states and 27912 transitions. [2025-03-04 00:35:39,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:35:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 18248 states and 27912 transitions. [2025-03-04 00:35:39,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-04 00:35:39,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:39,469 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:39,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 00:35:39,469 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:39,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:39,469 INFO L85 PathProgramCache]: Analyzing trace with hash 526352718, now seen corresponding path program 1 times [2025-03-04 00:35:39,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:39,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567021205] [2025-03-04 00:35:39,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:39,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:39,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-04 00:35:39,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-04 00:35:39,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:39,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:35:49,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:49,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567021205] [2025-03-04 00:35:49,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567021205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:49,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:49,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-04 00:35:49,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439084231] [2025-03-04 00:35:49,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:49,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 00:35:49,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:49,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 00:35:49,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:35:49,508 INFO L87 Difference]: Start difference. First operand 18248 states and 27912 transitions. Second operand has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68)