./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_amount250_file-94.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 a92ccd1f56cdb28b8e6efc63e50fd814467549956882758cf5aa04b7a8a9eb25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:35:18,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:35:18,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:35:18,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:35:18,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:35:18,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:35:18,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:35:18,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:35:18,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:35:18,761 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:35:18,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:35:18,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:35:18,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:35:18,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:35:18,762 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:35:18,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:35:18,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:35:18,762 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:35:18,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:35:18,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:35:18,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:35:18,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:35:18,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:35:18,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:35:18,763 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:35:18,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:35:18,763 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:35:18,763 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:35:18,763 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:35:18,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:35:18,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:35:18,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:35:18,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:35:18,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:35:18,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:35:18,764 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:35:18,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:35:18,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:35:18,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:35:18,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:35:18,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:35:18,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:35:18,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:35:18,765 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 -> a92ccd1f56cdb28b8e6efc63e50fd814467549956882758cf5aa04b7a8a9eb25 [2025-03-17 04:35:18,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:35:18,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:35:18,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:35:19,000 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:35:19,000 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:35:19,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-94.i [2025-03-17 04:35:20,149 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d92638587/b5d6e75dcd594996b5526a101055d17f/FLAG931a07043 [2025-03-17 04:35:20,429 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:35:20,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-94.i [2025-03-17 04:35:20,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d92638587/b5d6e75dcd594996b5526a101055d17f/FLAG931a07043 [2025-03-17 04:35:20,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d92638587/b5d6e75dcd594996b5526a101055d17f [2025-03-17 04:35:20,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:35:20,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:35:20,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:35:20,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:35:20,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:35:20,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:35:20" (1/1) ... [2025-03-17 04:35:20,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e28460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:35:20, skipping insertion in model container [2025-03-17 04:35:20,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:35:20" (1/1) ... [2025-03-17 04:35:20,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:35:20,861 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_amount250_file-94.i[916,929] [2025-03-17 04:35:20,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:35:20,958 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:35:20,965 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_amount250_file-94.i[916,929] [2025-03-17 04:35:21,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:35:21,035 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:35:21,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:35:21 WrapperNode [2025-03-17 04:35:21,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:35:21,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:35:21,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:35:21,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:35:21,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:35:21" (1/1) ... [2025-03-17 04:35:21,051 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:35:21" (1/1) ... [2025-03-17 04:35:21,092 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 493 [2025-03-17 04:35:21,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:35:21,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:35:21,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:35:21,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:35:21,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:35:21" (1/1) ... [2025-03-17 04:35:21,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:35:21" (1/1) ... [2025-03-17 04:35:21,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:35:21" (1/1) ... [2025-03-17 04:35:21,135 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-17 04:35:21,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:35:21" (1/1) ... [2025-03-17 04:35:21,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:35:21" (1/1) ... [2025-03-17 04:35:21,156 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:35:21" (1/1) ... [2025-03-17 04:35:21,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:35:21" (1/1) ... [2025-03-17 04:35:21,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:35:21" (1/1) ... [2025-03-17 04:35:21,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:35:21" (1/1) ... [2025-03-17 04:35:21,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:35:21,188 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:35:21,189 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:35:21,189 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:35:21,190 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:35:21" (1/1) ... [2025-03-17 04:35:21,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:35:21,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:35:21,219 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-17 04:35:21,221 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-17 04:35:21,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:35:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:35:21,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:35:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:35:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:35:21,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:35:21,319 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:35:21,321 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:35:21,947 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L369: havoc property_#t~bitwise35#1;havoc property_#t~short36#1;havoc property_#t~bitwise37#1;havoc property_#t~bitwise38#1;havoc property_#t~ite41#1;havoc property_#t~bitwise39#1;havoc property_#t~bitwise40#1;havoc property_#t~short42#1;havoc property_#t~bitwise43#1;havoc property_#t~ite45#1;havoc property_#t~bitwise44#1;havoc property_#t~short46#1; [2025-03-17 04:35:21,998 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-03-17 04:35:21,998 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:35:22,018 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:35:22,018 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:35:22,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:35:22 BoogieIcfgContainer [2025-03-17 04:35:22,019 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:35:22,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:35:22,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:35:22,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:35:22,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:35:20" (1/3) ... [2025-03-17 04:35:22,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c3f4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:35:22, skipping insertion in model container [2025-03-17 04:35:22,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:35:21" (2/3) ... [2025-03-17 04:35:22,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c3f4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:35:22, skipping insertion in model container [2025-03-17 04:35:22,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:35:22" (3/3) ... [2025-03-17 04:35:22,028 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-94.i [2025-03-17 04:35:22,038 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:35:22,040 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-94.i that has 2 procedures, 187 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:35:22,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:35:22,099 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;@32e31747, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:35:22,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:35:22,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 146 states have internal predecessors, (221), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 04:35:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-17 04:35:22,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:22,126 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:22,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:22,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:22,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2056679227, now seen corresponding path program 1 times [2025-03-17 04:35:22,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:22,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042764558] [2025-03-17 04:35:22,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:22,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:22,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 04:35:22,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 04:35:22,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:22,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-03-17 04:35:22,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:22,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042764558] [2025-03-17 04:35:22,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042764558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:35:22,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856953101] [2025-03-17 04:35:22,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:22,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:35:22,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:35:22,604 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-17 04:35:22,605 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-17 04:35:22,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 04:35:22,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 04:35:22,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:22,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:22,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:35:22,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:35:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-03-17 04:35:22,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:35:22,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856953101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:22,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:35:22,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:35:22,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891088897] [2025-03-17 04:35:22,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:22,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:35:22,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:22,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:35:22,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:35:22,909 INFO L87 Difference]: Start difference. First operand has 187 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 146 states have internal predecessors, (221), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-17 04:35:22,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:22,968 INFO L93 Difference]: Finished difference Result 371 states and 635 transitions. [2025-03-17 04:35:22,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:35:22,970 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 272 [2025-03-17 04:35:22,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:22,977 INFO L225 Difference]: With dead ends: 371 [2025-03-17 04:35:22,978 INFO L226 Difference]: Without dead ends: 185 [2025-03-17 04:35:22,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 273 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-17 04:35:22,984 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:22,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:35:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-17 04:35:23,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-17 04:35:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 144 states have (on average 1.5069444444444444) internal successors, (217), 144 states have internal predecessors, (217), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 04:35:23,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 295 transitions. [2025-03-17 04:35:23,035 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 295 transitions. Word has length 272 [2025-03-17 04:35:23,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:23,035 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 295 transitions. [2025-03-17 04:35:23,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-17 04:35:23,035 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 295 transitions. [2025-03-17 04:35:23,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-17 04:35:23,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:23,040 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:23,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:35:23,240 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-17 04:35:23,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:23,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:23,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1388885154, now seen corresponding path program 1 times [2025-03-17 04:35:23,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:23,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817406868] [2025-03-17 04:35:23,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:23,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:23,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 04:35:23,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 04:35:23,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:23,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:24,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:24,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817406868] [2025-03-17 04:35:24,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817406868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:24,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:24,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:35:24,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847211338] [2025-03-17 04:35:24,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:24,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:35:24,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:24,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:35:24,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:35:24,164 INFO L87 Difference]: Start difference. First operand 185 states and 295 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:25,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:25,283 INFO L93 Difference]: Finished difference Result 841 states and 1332 transitions. [2025-03-17 04:35:25,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:35:25,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 272 [2025-03-17 04:35:25,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:25,291 INFO L225 Difference]: With dead ends: 841 [2025-03-17 04:35:25,291 INFO L226 Difference]: Without dead ends: 657 [2025-03-17 04:35:25,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-17 04:35:25,296 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 668 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 2418 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:25,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 2418 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 04:35:25,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-03-17 04:35:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 448. [2025-03-17 04:35:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 367 states have (on average 1.5286103542234333) internal successors, (561), 367 states have internal predecessors, (561), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 04:35:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 717 transitions. [2025-03-17 04:35:25,362 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 717 transitions. Word has length 272 [2025-03-17 04:35:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:25,364 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 717 transitions. [2025-03-17 04:35:25,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 717 transitions. [2025-03-17 04:35:25,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 04:35:25,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:25,369 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:25,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:35:25,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:25,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:25,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1515895291, now seen corresponding path program 1 times [2025-03-17 04:35:25,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:25,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709899530] [2025-03-17 04:35:25,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:25,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:25,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 04:35:25,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 04:35:25,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:25,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:26,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:26,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709899530] [2025-03-17 04:35:26,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709899530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:26,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:26,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 04:35:26,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903196946] [2025-03-17 04:35:26,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:26,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 04:35:26,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:26,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 04:35:26,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:35:26,132 INFO L87 Difference]: Start difference. First operand 448 states and 717 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:27,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:27,117 INFO L93 Difference]: Finished difference Result 2352 states and 3764 transitions. [2025-03-17 04:35:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 04:35:27,118 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 273 [2025-03-17 04:35:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:27,129 INFO L225 Difference]: With dead ends: 2352 [2025-03-17 04:35:27,129 INFO L226 Difference]: Without dead ends: 2168 [2025-03-17 04:35:27,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2025-03-17 04:35:27,132 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 1990 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1990 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:27,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1990 Valid, 2766 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 04:35:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2025-03-17 04:35:27,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 1285. [2025-03-17 04:35:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1066 states have (on average 1.5337711069418387) internal successors, (1635), 1068 states have internal predecessors, (1635), 211 states have call successors, (211), 7 states have call predecessors, (211), 7 states have return successors, (211), 209 states have call predecessors, (211), 211 states have call successors, (211) [2025-03-17 04:35:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 2057 transitions. [2025-03-17 04:35:27,261 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 2057 transitions. Word has length 273 [2025-03-17 04:35:27,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:27,262 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 2057 transitions. [2025-03-17 04:35:27,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:27,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 2057 transitions. [2025-03-17 04:35:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 04:35:27,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:27,266 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:27,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:35:27,267 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:27,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:27,267 INFO L85 PathProgramCache]: Analyzing trace with hash -561314052, now seen corresponding path program 1 times [2025-03-17 04:35:27,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:27,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810341317] [2025-03-17 04:35:27,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:27,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:27,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 04:35:27,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 04:35:27,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:27,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:28,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:28,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810341317] [2025-03-17 04:35:28,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810341317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:28,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:28,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:35:28,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044386134] [2025-03-17 04:35:28,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:28,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:35:28,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:28,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:35:28,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:35:28,028 INFO L87 Difference]: Start difference. First operand 1285 states and 2057 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:28,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:28,230 INFO L93 Difference]: Finished difference Result 4216 states and 6768 transitions. [2025-03-17 04:35:28,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:35:28,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 273 [2025-03-17 04:35:28,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:28,244 INFO L225 Difference]: With dead ends: 4216 [2025-03-17 04:35:28,245 INFO L226 Difference]: Without dead ends: 3013 [2025-03-17 04:35:28,247 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-17 04:35:28,249 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 321 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:28,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 945 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:35:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2025-03-17 04:35:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 1427. [2025-03-17 04:35:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1208 states have (on average 1.5355960264900663) internal successors, (1855), 1210 states have internal predecessors, (1855), 211 states have call successors, (211), 7 states have call predecessors, (211), 7 states have return successors, (211), 209 states have call predecessors, (211), 211 states have call successors, (211) [2025-03-17 04:35:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2277 transitions. [2025-03-17 04:35:28,341 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 2277 transitions. Word has length 273 [2025-03-17 04:35:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:28,343 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 2277 transitions. [2025-03-17 04:35:28,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 2277 transitions. [2025-03-17 04:35:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 04:35:28,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:28,350 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:28,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:35:28,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:28,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash -231548291, now seen corresponding path program 1 times [2025-03-17 04:35:28,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:28,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339457426] [2025-03-17 04:35:28,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:28,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:28,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 04:35:28,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 04:35:28,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:28,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:29,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:29,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339457426] [2025-03-17 04:35:29,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339457426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:29,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:29,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 04:35:29,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425385210] [2025-03-17 04:35:29,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:29,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 04:35:29,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:29,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 04:35:29,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 04:35:29,299 INFO L87 Difference]: Start difference. First operand 1427 states and 2277 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-17 04:35:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:30,877 INFO L93 Difference]: Finished difference Result 4022 states and 6374 transitions. [2025-03-17 04:35:30,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 04:35:30,878 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 273 [2025-03-17 04:35:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:30,893 INFO L225 Difference]: With dead ends: 4022 [2025-03-17 04:35:30,893 INFO L226 Difference]: Without dead ends: 3475 [2025-03-17 04:35:30,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2025-03-17 04:35:30,898 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 1929 mSDsluCounter, 2479 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1929 SdHoareTripleChecker+Valid, 2780 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:30,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1929 Valid, 2780 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 04:35:30,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3475 states. [2025-03-17 04:35:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3475 to 1799. [2025-03-17 04:35:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1554 states have (on average 1.5392535392535394) internal successors, (2392), 1558 states have internal predecessors, (2392), 231 states have call successors, (231), 13 states have call predecessors, (231), 13 states have return successors, (231), 227 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-17 04:35:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2854 transitions. [2025-03-17 04:35:31,043 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2854 transitions. Word has length 273 [2025-03-17 04:35:31,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:31,045 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2854 transitions. [2025-03-17 04:35:31,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-17 04:35:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2854 transitions. [2025-03-17 04:35:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 04:35:31,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:31,051 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:31,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:35:31,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:31,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:31,051 INFO L85 PathProgramCache]: Analyzing trace with hash 407236188, now seen corresponding path program 1 times [2025-03-17 04:35:31,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:31,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351721284] [2025-03-17 04:35:31,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:31,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:31,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 04:35:31,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 04:35:31,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:31,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:33,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:33,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351721284] [2025-03-17 04:35:33,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351721284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:33,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:33,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 04:35:33,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235885465] [2025-03-17 04:35:33,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:33,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 04:35:33,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:33,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 04:35:33,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-17 04:35:33,819 INFO L87 Difference]: Start difference. First operand 1799 states and 2854 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:36,482 INFO L93 Difference]: Finished difference Result 5471 states and 8699 transitions. [2025-03-17 04:35:36,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 04:35:36,482 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 273 [2025-03-17 04:35:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:36,498 INFO L225 Difference]: With dead ends: 5471 [2025-03-17 04:35:36,498 INFO L226 Difference]: Without dead ends: 3869 [2025-03-17 04:35:36,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=516, Unknown=0, NotChecked=0, Total=702 [2025-03-17 04:35:36,504 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 1506 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:36,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 2219 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 04:35:36,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2025-03-17 04:35:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 3485. [2025-03-17 04:35:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3485 states, 3225 states have (on average 1.551937984496124) internal successors, (5005), 3232 states have internal predecessors, (5005), 243 states have call successors, (243), 16 states have call predecessors, (243), 16 states have return successors, (243), 236 states have call predecessors, (243), 243 states have call successors, (243) [2025-03-17 04:35:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 5491 transitions. [2025-03-17 04:35:36,641 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 5491 transitions. Word has length 273 [2025-03-17 04:35:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:36,642 INFO L471 AbstractCegarLoop]: Abstraction has 3485 states and 5491 transitions. [2025-03-17 04:35:36,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 5491 transitions. [2025-03-17 04:35:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 04:35:36,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:36,651 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:36,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:35:36,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:36,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:36,651 INFO L85 PathProgramCache]: Analyzing trace with hash -935069288, now seen corresponding path program 1 times [2025-03-17 04:35:36,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:36,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768681168] [2025-03-17 04:35:36,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:36,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:36,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 04:35:36,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 04:35:36,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:36,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:36,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:36,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768681168] [2025-03-17 04:35:36,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768681168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:36,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:36,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:35:36,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206723549] [2025-03-17 04:35:36,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:36,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:35:36,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:36,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:35:36,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:35:36,831 INFO L87 Difference]: Start difference. First operand 3485 states and 5491 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:37,347 INFO L93 Difference]: Finished difference Result 8442 states and 13214 transitions. [2025-03-17 04:35:37,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 04:35:37,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 273 [2025-03-17 04:35:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:37,379 INFO L225 Difference]: With dead ends: 8442 [2025-03-17 04:35:37,379 INFO L226 Difference]: Without dead ends: 6137 [2025-03-17 04:35:37,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:35:37,387 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 918 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:37,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1189 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:35:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6137 states. [2025-03-17 04:35:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6137 to 5196. [2025-03-17 04:35:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5196 states, 4658 states have (on average 1.516316015457278) internal successors, (7063), 4673 states have internal predecessors, (7063), 499 states have call successors, (499), 38 states have call predecessors, (499), 38 states have return successors, (499), 484 states have call predecessors, (499), 499 states have call successors, (499) [2025-03-17 04:35:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5196 states to 5196 states and 8061 transitions. [2025-03-17 04:35:37,639 INFO L78 Accepts]: Start accepts. Automaton has 5196 states and 8061 transitions. Word has length 273 [2025-03-17 04:35:37,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:37,639 INFO L471 AbstractCegarLoop]: Abstraction has 5196 states and 8061 transitions. [2025-03-17 04:35:37,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 5196 states and 8061 transitions. [2025-03-17 04:35:37,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 04:35:37,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:37,645 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:37,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:35:37,646 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:37,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:37,646 INFO L85 PathProgramCache]: Analyzing trace with hash -869487858, now seen corresponding path program 1 times [2025-03-17 04:35:37,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:37,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823722456] [2025-03-17 04:35:37,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:37,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:37,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 04:35:37,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 04:35:37,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:37,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:38,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:38,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823722456] [2025-03-17 04:35:38,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823722456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:38,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:38,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:35:38,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818671964] [2025-03-17 04:35:38,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:38,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:35:38,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:38,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:35:38,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:35:38,095 INFO L87 Difference]: Start difference. First operand 5196 states and 8061 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:39,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:39,745 INFO L93 Difference]: Finished difference Result 14185 states and 21988 transitions. [2025-03-17 04:35:39,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 04:35:39,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 273 [2025-03-17 04:35:39,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:39,798 INFO L225 Difference]: With dead ends: 14185 [2025-03-17 04:35:39,798 INFO L226 Difference]: Without dead ends: 10512 [2025-03-17 04:35:39,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-17 04:35:39,808 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 1140 mSDsluCounter, 2274 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 2949 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:39,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 2949 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 04:35:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10512 states. [2025-03-17 04:35:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10512 to 6726. [2025-03-17 04:35:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6726 states, 6188 states have (on average 1.54169360051713) internal successors, (9540), 6203 states have internal predecessors, (9540), 499 states have call successors, (499), 38 states have call predecessors, (499), 38 states have return successors, (499), 484 states have call predecessors, (499), 499 states have call successors, (499) [2025-03-17 04:35:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6726 states to 6726 states and 10538 transitions. [2025-03-17 04:35:40,122 INFO L78 Accepts]: Start accepts. Automaton has 6726 states and 10538 transitions. Word has length 273 [2025-03-17 04:35:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:40,124 INFO L471 AbstractCegarLoop]: Abstraction has 6726 states and 10538 transitions. [2025-03-17 04:35:40,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 6726 states and 10538 transitions. [2025-03-17 04:35:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 04:35:40,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:40,157 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:40,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:35:40,157 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:40,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:40,158 INFO L85 PathProgramCache]: Analyzing trace with hash 820967131, now seen corresponding path program 1 times [2025-03-17 04:35:40,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:40,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056226084] [2025-03-17 04:35:40,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:40,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:40,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 04:35:40,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 04:35:40,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:40,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:40,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:40,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056226084] [2025-03-17 04:35:40,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056226084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:40,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:40,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 04:35:40,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766444406] [2025-03-17 04:35:40,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:40,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:35:40,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:40,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:35:40,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:35:40,646 INFO L87 Difference]: Start difference. First operand 6726 states and 10538 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:41,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:41,299 INFO L93 Difference]: Finished difference Result 9783 states and 15447 transitions. [2025-03-17 04:35:41,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:35:41,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 273 [2025-03-17 04:35:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:41,319 INFO L225 Difference]: With dead ends: 9783 [2025-03-17 04:35:41,320 INFO L226 Difference]: Without dead ends: 9263 [2025-03-17 04:35:41,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 04:35:41,326 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 560 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:41,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1906 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:35:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9263 states. [2025-03-17 04:35:41,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9263 to 7566. [2025-03-17 04:35:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7566 states, 7023 states have (on average 1.5457781574825573) internal successors, (10856), 7039 states have internal predecessors, (10856), 503 states have call successors, (503), 39 states have call predecessors, (503), 39 states have return successors, (503), 487 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-17 04:35:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7566 states to 7566 states and 11862 transitions. [2025-03-17 04:35:41,570 INFO L78 Accepts]: Start accepts. Automaton has 7566 states and 11862 transitions. Word has length 273 [2025-03-17 04:35:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:41,571 INFO L471 AbstractCegarLoop]: Abstraction has 7566 states and 11862 transitions. [2025-03-17 04:35:41,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 7566 states and 11862 transitions. [2025-03-17 04:35:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 04:35:41,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:41,580 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:41,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:35:41,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:41,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:41,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1256242212, now seen corresponding path program 1 times [2025-03-17 04:35:41,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:41,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172497492] [2025-03-17 04:35:41,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:41,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:41,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 04:35:41,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 04:35:41,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:41,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:41,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:41,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172497492] [2025-03-17 04:35:41,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172497492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:41,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:41,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:35:41,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331319396] [2025-03-17 04:35:41,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:41,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:35:41,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:41,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:35:41,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:35:41,841 INFO L87 Difference]: Start difference. First operand 7566 states and 11862 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:42,280 INFO L93 Difference]: Finished difference Result 14990 states and 23493 transitions. [2025-03-17 04:35:42,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:35:42,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 273 [2025-03-17 04:35:42,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:42,299 INFO L225 Difference]: With dead ends: 14990 [2025-03-17 04:35:42,299 INFO L226 Difference]: Without dead ends: 7534 [2025-03-17 04:35:42,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:35:42,313 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 226 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:42,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1166 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:35:42,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7534 states. [2025-03-17 04:35:42,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7534 to 7500. [2025-03-17 04:35:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7500 states, 6957 states have (on average 1.5459249676584734) internal successors, (10755), 6973 states have internal predecessors, (10755), 503 states have call successors, (503), 39 states have call predecessors, (503), 39 states have return successors, (503), 487 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-17 04:35:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7500 states to 7500 states and 11761 transitions. [2025-03-17 04:35:42,592 INFO L78 Accepts]: Start accepts. Automaton has 7500 states and 11761 transitions. Word has length 273 [2025-03-17 04:35:42,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:42,593 INFO L471 AbstractCegarLoop]: Abstraction has 7500 states and 11761 transitions. [2025-03-17 04:35:42,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:42,593 INFO L276 IsEmpty]: Start isEmpty. Operand 7500 states and 11761 transitions. [2025-03-17 04:35:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-17 04:35:42,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:42,602 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:42,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:35:42,602 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:42,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2106920734, now seen corresponding path program 1 times [2025-03-17 04:35:42,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:42,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973303396] [2025-03-17 04:35:42,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:42,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-17 04:35:42,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-17 04:35:42,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:42,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:42,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:42,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973303396] [2025-03-17 04:35:42,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973303396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:42,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:42,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:35:42,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327299174] [2025-03-17 04:35:42,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:42,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:35:42,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:42,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:35:42,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:35:42,755 INFO L87 Difference]: Start difference. First operand 7500 states and 11761 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:43,109 INFO L93 Difference]: Finished difference Result 14956 states and 23444 transitions. [2025-03-17 04:35:43,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:35:43,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 274 [2025-03-17 04:35:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:43,127 INFO L225 Difference]: With dead ends: 14956 [2025-03-17 04:35:43,127 INFO L226 Difference]: Without dead ends: 7534 [2025-03-17 04:35:43,140 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-17 04:35:43,140 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 316 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:43,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 962 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:35:43,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7534 states. [2025-03-17 04:35:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7534 to 7500. [2025-03-17 04:35:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7500 states, 6957 states have (on average 1.5457812275406067) internal successors, (10754), 6973 states have internal predecessors, (10754), 503 states have call successors, (503), 39 states have call predecessors, (503), 39 states have return successors, (503), 487 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-17 04:35:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7500 states to 7500 states and 11760 transitions. [2025-03-17 04:35:43,463 INFO L78 Accepts]: Start accepts. Automaton has 7500 states and 11760 transitions. Word has length 274 [2025-03-17 04:35:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:43,464 INFO L471 AbstractCegarLoop]: Abstraction has 7500 states and 11760 transitions. [2025-03-17 04:35:43,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 7500 states and 11760 transitions. [2025-03-17 04:35:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-17 04:35:43,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:43,473 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:43,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:35:43,474 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:43,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:43,474 INFO L85 PathProgramCache]: Analyzing trace with hash 262513251, now seen corresponding path program 1 times [2025-03-17 04:35:43,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:43,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843788727] [2025-03-17 04:35:43,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:43,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:43,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-17 04:35:43,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-17 04:35:43,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:43,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:43,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:43,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843788727] [2025-03-17 04:35:43,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843788727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:43,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:43,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:35:43,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543167586] [2025-03-17 04:35:43,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:43,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:35:43,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:43,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:35:43,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:35:43,951 INFO L87 Difference]: Start difference. First operand 7500 states and 11760 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:44,522 INFO L93 Difference]: Finished difference Result 24465 states and 38456 transitions. [2025-03-17 04:35:44,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:35:44,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 274 [2025-03-17 04:35:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:44,564 INFO L225 Difference]: With dead ends: 24465 [2025-03-17 04:35:44,565 INFO L226 Difference]: Without dead ends: 17075 [2025-03-17 04:35:44,582 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-17 04:35:44,583 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 452 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:44,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1227 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:35:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17075 states. [2025-03-17 04:35:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17075 to 10273. [2025-03-17 04:35:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10273 states, 9514 states have (on average 1.5525541307546773) internal successors, (14771), 9540 states have internal predecessors, (14771), 705 states have call successors, (705), 53 states have call predecessors, (705), 53 states have return successors, (705), 679 states have call predecessors, (705), 705 states have call successors, (705) [2025-03-17 04:35:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10273 states to 10273 states and 16181 transitions. [2025-03-17 04:35:44,935 INFO L78 Accepts]: Start accepts. Automaton has 10273 states and 16181 transitions. Word has length 274 [2025-03-17 04:35:44,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:44,935 INFO L471 AbstractCegarLoop]: Abstraction has 10273 states and 16181 transitions. [2025-03-17 04:35:44,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 10273 states and 16181 transitions. [2025-03-17 04:35:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-17 04:35:44,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:44,944 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:44,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 04:35:44,944 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:44,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:44,945 INFO L85 PathProgramCache]: Analyzing trace with hash 592279012, now seen corresponding path program 1 times [2025-03-17 04:35:44,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:44,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747273731] [2025-03-17 04:35:44,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:44,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:44,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-17 04:35:44,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-17 04:35:44,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:44,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:45,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:45,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747273731] [2025-03-17 04:35:45,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747273731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:45,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:45,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 04:35:45,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137913850] [2025-03-17 04:35:45,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:45,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:35:45,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:45,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:35:45,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:35:45,560 INFO L87 Difference]: Start difference. First operand 10273 states and 16181 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:47,609 INFO L93 Difference]: Finished difference Result 29832 states and 47486 transitions. [2025-03-17 04:35:47,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:35:47,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 274 [2025-03-17 04:35:47,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:47,671 INFO L225 Difference]: With dead ends: 29832 [2025-03-17 04:35:47,671 INFO L226 Difference]: Without dead ends: 25350 [2025-03-17 04:35:47,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-03-17 04:35:47,685 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 2182 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:47,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 2181 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 04:35:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25350 states. [2025-03-17 04:35:48,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25350 to 22786. [2025-03-17 04:35:48,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22786 states, 21739 states have (on average 1.5828694972169832) internal successors, (34410), 21787 states have internal predecessors, (34410), 969 states have call successors, (969), 77 states have call predecessors, (969), 77 states have return successors, (969), 921 states have call predecessors, (969), 969 states have call successors, (969) [2025-03-17 04:35:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22786 states to 22786 states and 36348 transitions. [2025-03-17 04:35:48,316 INFO L78 Accepts]: Start accepts. Automaton has 22786 states and 36348 transitions. Word has length 274 [2025-03-17 04:35:48,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:48,317 INFO L471 AbstractCegarLoop]: Abstraction has 22786 states and 36348 transitions. [2025-03-17 04:35:48,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 22786 states and 36348 transitions. [2025-03-17 04:35:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-17 04:35:48,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:48,332 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:48,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 04:35:48,332 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:48,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1837043493, now seen corresponding path program 1 times [2025-03-17 04:35:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:48,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180980161] [2025-03-17 04:35:48,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:48,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-17 04:35:48,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-17 04:35:48,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:48,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:48,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:48,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180980161] [2025-03-17 04:35:48,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180980161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:48,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:48,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 04:35:48,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571954170] [2025-03-17 04:35:48,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:48,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 04:35:48,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:48,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 04:35:48,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:35:48,890 INFO L87 Difference]: Start difference. First operand 22786 states and 36348 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-17 04:35:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:50,438 INFO L93 Difference]: Finished difference Result 44060 states and 70491 transitions. [2025-03-17 04:35:50,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 04:35:50,439 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 274 [2025-03-17 04:35:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:50,507 INFO L225 Difference]: With dead ends: 44060 [2025-03-17 04:35:50,508 INFO L226 Difference]: Without dead ends: 39392 [2025-03-17 04:35:50,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2025-03-17 04:35:50,527 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 1252 mSDsluCounter, 2017 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 2404 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:50,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 2404 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 04:35:50,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39392 states. [2025-03-17 04:35:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39392 to 21026. [2025-03-17 04:35:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21026 states, 20028 states have (on average 1.5837827042141002) internal successors, (31720), 20067 states have internal predecessors, (31720), 917 states have call successors, (917), 80 states have call predecessors, (917), 80 states have return successors, (917), 878 states have call predecessors, (917), 917 states have call successors, (917) [2025-03-17 04:35:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21026 states to 21026 states and 33554 transitions. [2025-03-17 04:35:51,165 INFO L78 Accepts]: Start accepts. Automaton has 21026 states and 33554 transitions. Word has length 274 [2025-03-17 04:35:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:51,166 INFO L471 AbstractCegarLoop]: Abstraction has 21026 states and 33554 transitions. [2025-03-17 04:35:51,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-17 04:35:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 21026 states and 33554 transitions. [2025-03-17 04:35:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-17 04:35:51,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:51,176 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:51,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 04:35:51,176 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:51,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:51,177 INFO L85 PathProgramCache]: Analyzing trace with hash -111241985, now seen corresponding path program 1 times [2025-03-17 04:35:51,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:51,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021286839] [2025-03-17 04:35:51,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:51,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:51,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-17 04:35:51,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-17 04:35:51,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:51,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:51,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:51,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021286839] [2025-03-17 04:35:51,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021286839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:51,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:51,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:35:51,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366160204] [2025-03-17 04:35:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:51,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:35:51,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:51,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:35:51,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:51,298 INFO L87 Difference]: Start difference. First operand 21026 states and 33554 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:52,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:52,333 INFO L93 Difference]: Finished difference Result 55292 states and 88492 transitions. [2025-03-17 04:35:52,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:35:52,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 274 [2025-03-17 04:35:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:52,412 INFO L225 Difference]: With dead ends: 55292 [2025-03-17 04:35:52,413 INFO L226 Difference]: Without dead ends: 41269 [2025-03-17 04:35:52,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:52,453 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 198 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:52,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 765 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:35:52,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41269 states. [2025-03-17 04:35:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41269 to 36271. [2025-03-17 04:35:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36271 states, 34967 states have (on average 1.59069980267109) internal successors, (55622), 35031 states have internal predecessors, (55622), 1185 states have call successors, (1185), 118 states have call predecessors, (1185), 118 states have return successors, (1185), 1121 states have call predecessors, (1185), 1185 states have call successors, (1185) [2025-03-17 04:35:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36271 states to 36271 states and 57992 transitions. [2025-03-17 04:35:53,534 INFO L78 Accepts]: Start accepts. Automaton has 36271 states and 57992 transitions. Word has length 274 [2025-03-17 04:35:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:53,535 INFO L471 AbstractCegarLoop]: Abstraction has 36271 states and 57992 transitions. [2025-03-17 04:35:53,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 36271 states and 57992 transitions. [2025-03-17 04:35:53,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-17 04:35:53,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:53,549 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:53,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 04:35:53,550 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:53,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:53,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1115781496, now seen corresponding path program 1 times [2025-03-17 04:35:53,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:53,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931426908] [2025-03-17 04:35:53,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:53,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:53,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-17 04:35:53,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-17 04:35:53,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:53,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:54,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:54,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931426908] [2025-03-17 04:35:54,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931426908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:54,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:54,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 04:35:54,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191210284] [2025-03-17 04:35:54,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:54,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 04:35:54,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:54,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 04:35:54,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-17 04:35:54,758 INFO L87 Difference]: Start difference. First operand 36271 states and 57992 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-17 04:35:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:57,465 INFO L93 Difference]: Finished difference Result 80774 states and 129341 transitions. [2025-03-17 04:35:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 04:35:57,465 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 275 [2025-03-17 04:35:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:57,555 INFO L225 Difference]: With dead ends: 80774 [2025-03-17 04:35:57,555 INFO L226 Difference]: Without dead ends: 53936 [2025-03-17 04:35:57,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-17 04:35:57,578 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 951 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:57,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 2050 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1813 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 04:35:57,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53936 states. [2025-03-17 04:35:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53936 to 36561. [2025-03-17 04:35:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36561 states, 35349 states have (on average 1.5933972672494272) internal successors, (56325), 35403 states have internal predecessors, (56325), 1085 states have call successors, (1085), 126 states have call predecessors, (1085), 126 states have return successors, (1085), 1031 states have call predecessors, (1085), 1085 states have call successors, (1085) [2025-03-17 04:35:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36561 states to 36561 states and 58495 transitions. [2025-03-17 04:35:58,663 INFO L78 Accepts]: Start accepts. Automaton has 36561 states and 58495 transitions. Word has length 275 [2025-03-17 04:35:58,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:58,667 INFO L471 AbstractCegarLoop]: Abstraction has 36561 states and 58495 transitions. [2025-03-17 04:35:58,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-17 04:35:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 36561 states and 58495 transitions. [2025-03-17 04:35:58,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-17 04:35:58,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:58,691 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:35:58,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 04:35:58,691 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:58,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:58,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1447707713, now seen corresponding path program 1 times [2025-03-17 04:35:58,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:58,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446196926] [2025-03-17 04:35:58,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:58,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:58,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-17 04:35:58,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-17 04:35:58,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:58,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:35:58,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:58,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446196926] [2025-03-17 04:35:58,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446196926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:58,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:58,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:35:58,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095024197] [2025-03-17 04:35:58,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:58,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:35:58,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:58,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:35:58,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:58,827 INFO L87 Difference]: Start difference. First operand 36561 states and 58495 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:35:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:59,850 INFO L93 Difference]: Finished difference Result 68124 states and 109136 transitions. [2025-03-17 04:35:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:35:59,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 275 [2025-03-17 04:35:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:59,912 INFO L225 Difference]: With dead ends: 68124 [2025-03-17 04:35:59,912 INFO L226 Difference]: Without dead ends: 39931 [2025-03-17 04:35:59,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:35:59,942 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 271 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:59,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 915 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:35:59,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39931 states. [2025-03-17 04:36:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39931 to 39785. [2025-03-17 04:36:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39785 states, 38573 states have (on average 1.5880019702900994) internal successors, (61254), 38627 states have internal predecessors, (61254), 1085 states have call successors, (1085), 126 states have call predecessors, (1085), 126 states have return successors, (1085), 1031 states have call predecessors, (1085), 1085 states have call successors, (1085) [2025-03-17 04:36:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39785 states to 39785 states and 63424 transitions. [2025-03-17 04:36:01,062 INFO L78 Accepts]: Start accepts. Automaton has 39785 states and 63424 transitions. Word has length 275 [2025-03-17 04:36:01,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:36:01,062 INFO L471 AbstractCegarLoop]: Abstraction has 39785 states and 63424 transitions. [2025-03-17 04:36:01,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:36:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 39785 states and 63424 transitions. [2025-03-17 04:36:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-17 04:36:01,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:36:01,078 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:36:01,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 04:36:01,078 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:36:01,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:36:01,079 INFO L85 PathProgramCache]: Analyzing trace with hash -170413261, now seen corresponding path program 1 times [2025-03-17 04:36:01,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:36:01,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232081153] [2025-03-17 04:36:01,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:36:01,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:36:01,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-17 04:36:01,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-17 04:36:01,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:36:01,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:36:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:36:01,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:36:01,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232081153] [2025-03-17 04:36:01,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232081153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:36:01,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:36:01,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:36:01,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487408205] [2025-03-17 04:36:01,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:36:01,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:36:01,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:36:01,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:36:01,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:36:01,607 INFO L87 Difference]: Start difference. First operand 39785 states and 63424 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-17 04:36:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:36:03,380 INFO L93 Difference]: Finished difference Result 70266 states and 112194 transitions. [2025-03-17 04:36:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:36:03,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 275 [2025-03-17 04:36:03,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:36:03,446 INFO L225 Difference]: With dead ends: 70266 [2025-03-17 04:36:03,446 INFO L226 Difference]: Without dead ends: 41796 [2025-03-17 04:36:03,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-17 04:36:03,467 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 1245 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 04:36:03,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 785 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 04:36:03,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41796 states. [2025-03-17 04:36:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41796 to 38232. [2025-03-17 04:36:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38232 states, 37110 states have (on average 1.5906224737267582) internal successors, (59028), 37154 states have internal predecessors, (59028), 1013 states have call successors, (1013), 108 states have call predecessors, (1013), 108 states have return successors, (1013), 969 states have call predecessors, (1013), 1013 states have call successors, (1013) [2025-03-17 04:36:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38232 states to 38232 states and 61054 transitions. [2025-03-17 04:36:04,555 INFO L78 Accepts]: Start accepts. Automaton has 38232 states and 61054 transitions. Word has length 275 [2025-03-17 04:36:04,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:36:04,556 INFO L471 AbstractCegarLoop]: Abstraction has 38232 states and 61054 transitions. [2025-03-17 04:36:04,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-17 04:36:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 38232 states and 61054 transitions. [2025-03-17 04:36:04,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-17 04:36:04,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:36:04,571 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:36:04,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 04:36:04,571 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:36:04,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:36:04,571 INFO L85 PathProgramCache]: Analyzing trace with hash -179871338, now seen corresponding path program 1 times [2025-03-17 04:36:04,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:36:04,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093083476] [2025-03-17 04:36:04,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:36:04,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:36:04,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-17 04:36:04,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-17 04:36:04,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:36:04,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:36:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:36:05,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:36:05,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093083476] [2025-03-17 04:36:05,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093083476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:36:05,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:36:05,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 04:36:05,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687159368] [2025-03-17 04:36:05,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:36:05,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 04:36:05,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:36:05,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 04:36:05,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-17 04:36:05,740 INFO L87 Difference]: Start difference. First operand 38232 states and 61054 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-17 04:36:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:36:10,311 INFO L93 Difference]: Finished difference Result 46319 states and 73438 transitions. [2025-03-17 04:36:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 04:36:10,311 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 275 [2025-03-17 04:36:10,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:36:10,365 INFO L225 Difference]: With dead ends: 46319 [2025-03-17 04:36:10,365 INFO L226 Difference]: Without dead ends: 41760 [2025-03-17 04:36:10,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=555, Invalid=1515, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 04:36:10,374 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 3122 mSDsluCounter, 3657 mSDsCounter, 0 mSdLazyCounter, 3561 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3122 SdHoareTripleChecker+Valid, 4137 SdHoareTripleChecker+Invalid, 3889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 3561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:36:10,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3122 Valid, 4137 Invalid, 3889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 3561 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 04:36:10,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41760 states. [2025-03-17 04:36:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41760 to 38110. [2025-03-17 04:36:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38110 states, 36988 states have (on average 1.5904888071807073) internal successors, (58829), 37032 states have internal predecessors, (58829), 1013 states have call successors, (1013), 108 states have call predecessors, (1013), 108 states have return successors, (1013), 969 states have call predecessors, (1013), 1013 states have call successors, (1013) [2025-03-17 04:36:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38110 states to 38110 states and 60855 transitions. [2025-03-17 04:36:11,186 INFO L78 Accepts]: Start accepts. Automaton has 38110 states and 60855 transitions. Word has length 275 [2025-03-17 04:36:11,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:36:11,187 INFO L471 AbstractCegarLoop]: Abstraction has 38110 states and 60855 transitions. [2025-03-17 04:36:11,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-17 04:36:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 38110 states and 60855 transitions. [2025-03-17 04:36:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-17 04:36:11,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:36:11,199 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:36:11,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 04:36:11,199 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:36:11,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:36:11,200 INFO L85 PathProgramCache]: Analyzing trace with hash 458913141, now seen corresponding path program 1 times [2025-03-17 04:36:11,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:36:11,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297565715] [2025-03-17 04:36:11,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:36:11,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:36:11,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-17 04:36:11,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-17 04:36:11,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:36:11,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:36:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:36:14,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:36:14,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297565715] [2025-03-17 04:36:14,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297565715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:36:14,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:36:14,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 04:36:14,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717782404] [2025-03-17 04:36:14,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:36:14,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 04:36:14,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:36:14,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 04:36:14,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-17 04:36:14,305 INFO L87 Difference]: Start difference. First operand 38110 states and 60855 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:36:20,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:36:20,746 INFO L93 Difference]: Finished difference Result 65722 states and 103716 transitions. [2025-03-17 04:36:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 04:36:20,746 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 275 [2025-03-17 04:36:20,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:36:20,827 INFO L225 Difference]: With dead ends: 65722 [2025-03-17 04:36:20,827 INFO L226 Difference]: Without dead ends: 55945 [2025-03-17 04:36:20,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=440, Invalid=1120, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 04:36:20,851 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 3427 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 2688 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3427 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 2688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:36:20,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3427 Valid, 2334 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 2688 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-17 04:36:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55945 states. [2025-03-17 04:36:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55945 to 39330. [2025-03-17 04:36:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39330 states, 38197 states have (on average 1.588606435060345) internal successors, (60680), 38243 states have internal predecessors, (60680), 1021 states have call successors, (1021), 111 states have call predecessors, (1021), 111 states have return successors, (1021), 975 states have call predecessors, (1021), 1021 states have call successors, (1021) [2025-03-17 04:36:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39330 states to 39330 states and 62722 transitions. [2025-03-17 04:36:21,866 INFO L78 Accepts]: Start accepts. Automaton has 39330 states and 62722 transitions. Word has length 275 [2025-03-17 04:36:21,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:36:21,866 INFO L471 AbstractCegarLoop]: Abstraction has 39330 states and 62722 transitions. [2025-03-17 04:36:21,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-17 04:36:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 39330 states and 62722 transitions. [2025-03-17 04:36:21,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-17 04:36:21,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:36:21,882 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:36:21,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 04:36:21,882 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:36:21,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:36:21,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1703677622, now seen corresponding path program 1 times [2025-03-17 04:36:21,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:36:21,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456926218] [2025-03-17 04:36:21,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:36:21,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:36:21,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-17 04:36:21,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-17 04:36:21,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:36:21,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:36:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-17 04:36:25,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:36:25,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456926218] [2025-03-17 04:36:25,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456926218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:36:25,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:36:25,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 04:36:25,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138211656] [2025-03-17 04:36:25,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:36:25,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 04:36:25,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:36:25,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 04:36:25,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-17 04:36:25,485 INFO L87 Difference]: Start difference. First operand 39330 states and 62722 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39)