./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-57.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3076681f912d15400cc4a1f3a9bf78cf0eaf2d970cc5b4c395e45c99341df62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:19:17,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:19:18,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:19:18,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:19:18,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:19:18,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:19:18,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:19:18,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:19:18,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:19:18,042 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:19:18,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:19:18,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:19:18,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:19:18,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:19:18,044 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:19:18,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:19:18,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:19:18,044 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:19:18,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:19:18,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:19:18,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:19:18,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:19:18,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:19:18,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:19:18,045 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:19:18,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:19:18,045 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:19:18,045 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:19:18,045 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:19:18,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:19:18,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:19:18,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:19:18,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:19:18,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:19:18,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:19:18,046 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:19:18,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:19:18,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:19:18,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:19:18,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:19:18,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:19:18,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:19:18,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:19:18,046 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3076681f912d15400cc4a1f3a9bf78cf0eaf2d970cc5b4c395e45c99341df62 [2025-02-06 02:19:18,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:19:18,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:19:18,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:19:18,275 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:19:18,276 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:19:18,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-57.i [2025-02-06 02:19:19,397 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dac81eee2/d5fd32ab296b4045b800113c9233106a/FLAG019b4322b [2025-02-06 02:19:19,725 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:19:19,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-57.i [2025-02-06 02:19:19,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dac81eee2/d5fd32ab296b4045b800113c9233106a/FLAG019b4322b [2025-02-06 02:19:19,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dac81eee2/d5fd32ab296b4045b800113c9233106a [2025-02-06 02:19:19,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:19:19,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:19:19,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:19:19,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:19:19,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:19:19,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:19:19" (1/1) ... [2025-02-06 02:19:19,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:19, skipping insertion in model container [2025-02-06 02:19:19,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:19:19" (1/1) ... [2025-02-06 02:19:20,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:19:20,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-57.i[916,929] [2025-02-06 02:19:20,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:19:20,194 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:19:20,200 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-57.i[916,929] [2025-02-06 02:19:20,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:19:20,258 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:19:20,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:20 WrapperNode [2025-02-06 02:19:20,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:19:20,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:19:20,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:19:20,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:19:20,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:20" (1/1) ... [2025-02-06 02:19:20,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:20" (1/1) ... [2025-02-06 02:19:20,315 INFO L138 Inliner]: procedures = 26, calls = 68, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 518 [2025-02-06 02:19:20,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:19:20,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:19:20,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:19:20,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:19:20,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:20" (1/1) ... [2025-02-06 02:19:20,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:20" (1/1) ... [2025-02-06 02:19:20,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:20" (1/1) ... [2025-02-06 02:19:20,357 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:19:20,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:20" (1/1) ... [2025-02-06 02:19:20,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:20" (1/1) ... [2025-02-06 02:19:20,377 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:20" (1/1) ... [2025-02-06 02:19:20,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:20" (1/1) ... [2025-02-06 02:19:20,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:20" (1/1) ... [2025-02-06 02:19:20,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:20" (1/1) ... [2025-02-06 02:19:20,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:19:20,392 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:19:20,392 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:19:20,392 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:19:20,393 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:20" (1/1) ... [2025-02-06 02:19:20,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:19:20,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:20,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:19:20,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:19:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:19:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:19:20,436 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:19:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:19:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:19:20,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:19:20,529 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:19:20,531 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:19:21,087 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L387: havoc property_#t~bitwise43#1;havoc property_#t~short44#1;havoc property_#t~ite49#1;havoc property_#t~ite48#1;havoc property_#t~ite47#1;havoc property_#t~ite46#1;havoc property_#t~bitwise45#1;havoc property_#t~short50#1;havoc property_#t~ite52#1;havoc property_#t~bitwise51#1;havoc property_#t~short53#1;havoc property_#t~bitwise54#1;havoc property_#t~short55#1;havoc property_#t~bitwise56#1;havoc property_#t~short57#1; [2025-02-06 02:19:21,164 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-02-06 02:19:21,164 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:19:21,182 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:19:21,183 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:19:21,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:19:21 BoogieIcfgContainer [2025-02-06 02:19:21,183 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:19:21,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:19:21,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:19:21,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:19:21,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:19:19" (1/3) ... [2025-02-06 02:19:21,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d43ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:19:21, skipping insertion in model container [2025-02-06 02:19:21,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:20" (2/3) ... [2025-02-06 02:19:21,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d43ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:19:21, skipping insertion in model container [2025-02-06 02:19:21,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:19:21" (3/3) ... [2025-02-06 02:19:21,190 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-57.i [2025-02-06 02:19:21,201 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:19:21,204 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-57.i that has 2 procedures, 217 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:19:21,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:19:21,261 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;@3ba783f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:19:21,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:19:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 160 states have internal predecessors, (239), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-06 02:19:21,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-02-06 02:19:21,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:21,281 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:21,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:21,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash 605256254, now seen corresponding path program 1 times [2025-02-06 02:19:21,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:21,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518537622] [2025-02-06 02:19:21,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:21,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:21,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-02-06 02:19:21,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-02-06 02:19:21,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:21,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2025-02-06 02:19:21,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:21,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518537622] [2025-02-06 02:19:21,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518537622] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:19:21,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688733771] [2025-02-06 02:19:21,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:21,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:21,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:21,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:19:21,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:19:21,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-02-06 02:19:21,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-02-06 02:19:21,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:21,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:21,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:19:21,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:19:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2025-02-06 02:19:21,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:19:21,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688733771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:21,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:19:21,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:19:21,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137228845] [2025-02-06 02:19:21,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:22,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:19:22,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:22,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:19:22,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:19:22,017 INFO L87 Difference]: Start difference. First operand has 217 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 160 states have internal predecessors, (239), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 2 states have call successors, (55) [2025-02-06 02:19:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:22,061 INFO L93 Difference]: Finished difference Result 428 states and 748 transitions. [2025-02-06 02:19:22,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:19:22,064 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 2 states have call successors, (55) Word has length 362 [2025-02-06 02:19:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:22,069 INFO L225 Difference]: With dead ends: 428 [2025-02-06 02:19:22,069 INFO L226 Difference]: Without dead ends: 214 [2025-02-06 02:19:22,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:19:22,074 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:22,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 334 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:19:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-02-06 02:19:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-02-06 02:19:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 157 states have (on average 1.4904458598726114) internal successors, (234), 157 states have internal predecessors, (234), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-06 02:19:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 344 transitions. [2025-02-06 02:19:22,128 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 344 transitions. Word has length 362 [2025-02-06 02:19:22,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:22,129 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 344 transitions. [2025-02-06 02:19:22,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 2 states have call successors, (55) [2025-02-06 02:19:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 344 transitions. [2025-02-06 02:19:22,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-02-06 02:19:22,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:22,139 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:22,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:19:22,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:19:22,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:22,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:22,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1216571037, now seen corresponding path program 1 times [2025-02-06 02:19:22,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:22,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021468523] [2025-02-06 02:19:22,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:22,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:22,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-02-06 02:19:22,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-02-06 02:19:22,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:22,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-02-06 02:19:22,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:22,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021468523] [2025-02-06 02:19:22,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021468523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:22,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:22,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:19:22,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567968929] [2025-02-06 02:19:22,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:22,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:19:22,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:22,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:19:22,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:22,872 INFO L87 Difference]: Start difference. First operand 214 states and 344 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:23,426 INFO L93 Difference]: Finished difference Result 847 states and 1367 transitions. [2025-02-06 02:19:23,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:19:23,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 362 [2025-02-06 02:19:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:23,432 INFO L225 Difference]: With dead ends: 847 [2025-02-06 02:19:23,432 INFO L226 Difference]: Without dead ends: 636 [2025-02-06 02:19:23,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:23,434 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 831 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:23,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1036 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:19:23,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-02-06 02:19:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 488. [2025-02-06 02:19:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 375 states have (on average 1.5413333333333334) internal successors, (578), 375 states have internal predecessors, (578), 110 states have call successors, (110), 2 states have call predecessors, (110), 2 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-06 02:19:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 798 transitions. [2025-02-06 02:19:23,499 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 798 transitions. Word has length 362 [2025-02-06 02:19:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:23,501 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 798 transitions. [2025-02-06 02:19:23,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 798 transitions. [2025-02-06 02:19:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-02-06 02:19:23,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:23,504 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:23,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:19:23,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:23,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash 192526900, now seen corresponding path program 1 times [2025-02-06 02:19:23,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:23,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874857949] [2025-02-06 02:19:23,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:23,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:23,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-02-06 02:19:23,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-02-06 02:19:23,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:23,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-02-06 02:19:24,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:24,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874857949] [2025-02-06 02:19:24,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874857949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:24,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:24,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:19:24,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257189812] [2025-02-06 02:19:24,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:24,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:19:24,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:24,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:19:24,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:24,115 INFO L87 Difference]: Start difference. First operand 488 states and 798 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:24,250 INFO L93 Difference]: Finished difference Result 1232 states and 2024 transitions. [2025-02-06 02:19:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:19:24,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 363 [2025-02-06 02:19:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:24,257 INFO L225 Difference]: With dead ends: 1232 [2025-02-06 02:19:24,258 INFO L226 Difference]: Without dead ends: 747 [2025-02-06 02:19:24,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:19:24,262 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 364 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:24,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1299 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:19:24,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-02-06 02:19:24,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 499. [2025-02-06 02:19:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 386 states have (on average 1.5362694300518134) internal successors, (593), 386 states have internal predecessors, (593), 110 states have call successors, (110), 2 states have call predecessors, (110), 2 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-06 02:19:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 813 transitions. [2025-02-06 02:19:24,308 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 813 transitions. Word has length 363 [2025-02-06 02:19:24,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:24,310 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 813 transitions. [2025-02-06 02:19:24,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 813 transitions. [2025-02-06 02:19:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-02-06 02:19:24,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:24,313 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:24,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:19:24,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:24,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1217220821, now seen corresponding path program 1 times [2025-02-06 02:19:24,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:24,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370404657] [2025-02-06 02:19:24,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:24,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:24,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-02-06 02:19:24,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-02-06 02:19:24,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:24,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-02-06 02:19:24,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:24,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370404657] [2025-02-06 02:19:24,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370404657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:24,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:24,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:19:24,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515580456] [2025-02-06 02:19:24,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:24,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:19:24,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:24,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:19:24,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:19:24,918 INFO L87 Difference]: Start difference. First operand 499 states and 813 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:26,819 INFO L93 Difference]: Finished difference Result 5187 states and 8415 transitions. [2025-02-06 02:19:26,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 02:19:26,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 363 [2025-02-06 02:19:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:26,839 INFO L225 Difference]: With dead ends: 5187 [2025-02-06 02:19:26,839 INFO L226 Difference]: Without dead ends: 4691 [2025-02-06 02:19:26,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2025-02-06 02:19:26,842 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 3788 mSDsluCounter, 2599 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 646 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3788 SdHoareTripleChecker+Valid, 3203 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 646 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:26,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3788 Valid, 3203 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [646 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 02:19:26,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2025-02-06 02:19:27,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 3691. [2025-02-06 02:19:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 3082 states have (on average 1.581765087605451) internal successors, (4875), 3090 states have internal predecessors, (4875), 592 states have call successors, (592), 16 states have call predecessors, (592), 16 states have return successors, (592), 584 states have call predecessors, (592), 592 states have call successors, (592) [2025-02-06 02:19:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 6059 transitions. [2025-02-06 02:19:27,046 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 6059 transitions. Word has length 363 [2025-02-06 02:19:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:27,047 INFO L471 AbstractCegarLoop]: Abstraction has 3691 states and 6059 transitions. [2025-02-06 02:19:27,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 6059 transitions. [2025-02-06 02:19:27,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-02-06 02:19:27,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:27,052 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:27,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:19:27,052 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:27,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:27,053 INFO L85 PathProgramCache]: Analyzing trace with hash 589540215, now seen corresponding path program 1 times [2025-02-06 02:19:27,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:27,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855773511] [2025-02-06 02:19:27,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:27,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:27,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-02-06 02:19:27,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-02-06 02:19:27,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:27,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-02-06 02:19:27,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:27,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855773511] [2025-02-06 02:19:27,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855773511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:27,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:27,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:19:27,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404733191] [2025-02-06 02:19:27,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:27,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:19:27,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:27,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:19:27,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:19:27,653 INFO L87 Difference]: Start difference. First operand 3691 states and 6059 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-02-06 02:19:28,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:28,465 INFO L93 Difference]: Finished difference Result 12993 states and 21359 transitions. [2025-02-06 02:19:28,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:19:28,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 363 [2025-02-06 02:19:28,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:28,506 INFO L225 Difference]: With dead ends: 12993 [2025-02-06 02:19:28,507 INFO L226 Difference]: Without dead ends: 9305 [2025-02-06 02:19:28,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:19:28,517 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 641 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:28,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1624 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:19:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9305 states. [2025-02-06 02:19:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9305 to 8977. [2025-02-06 02:19:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8977 states, 7760 states have (on average 1.6016752577319588) internal successors, (12429), 7776 states have internal predecessors, (12429), 1184 states have call successors, (1184), 32 states have call predecessors, (1184), 32 states have return successors, (1184), 1168 states have call predecessors, (1184), 1184 states have call successors, (1184) [2025-02-06 02:19:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8977 states to 8977 states and 14797 transitions. [2025-02-06 02:19:29,004 INFO L78 Accepts]: Start accepts. Automaton has 8977 states and 14797 transitions. Word has length 363 [2025-02-06 02:19:29,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:29,006 INFO L471 AbstractCegarLoop]: Abstraction has 8977 states and 14797 transitions. [2025-02-06 02:19:29,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-02-06 02:19:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 8977 states and 14797 transitions. [2025-02-06 02:19:29,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-02-06 02:19:29,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:29,011 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:29,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:19:29,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:29,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:29,014 INFO L85 PathProgramCache]: Analyzing trace with hash 140336358, now seen corresponding path program 1 times [2025-02-06 02:19:29,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:29,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427264682] [2025-02-06 02:19:29,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:29,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:29,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-02-06 02:19:29,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-02-06 02:19:29,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:29,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-02-06 02:19:29,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:29,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427264682] [2025-02-06 02:19:29,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427264682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:29,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:29,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:19:29,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680998958] [2025-02-06 02:19:29,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:29,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:19:29,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:29,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:19:29,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:29,505 INFO L87 Difference]: Start difference. First operand 8977 states and 14797 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:30,259 INFO L93 Difference]: Finished difference Result 32809 states and 53375 transitions. [2025-02-06 02:19:30,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:19:30,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 364 [2025-02-06 02:19:30,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:30,342 INFO L225 Difference]: With dead ends: 32809 [2025-02-06 02:19:30,343 INFO L226 Difference]: Without dead ends: 23835 [2025-02-06 02:19:30,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:19:30,369 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 486 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:30,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1108 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:19:30,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23835 states. [2025-02-06 02:19:31,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23835 to 17375. [2025-02-06 02:19:31,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17375 states, 14942 states have (on average 1.5934948467407308) internal successors, (23810), 14974 states have internal predecessors, (23810), 2368 states have call successors, (2368), 64 states have call predecessors, (2368), 64 states have return successors, (2368), 2336 states have call predecessors, (2368), 2368 states have call successors, (2368) [2025-02-06 02:19:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17375 states to 17375 states and 28546 transitions. [2025-02-06 02:19:31,449 INFO L78 Accepts]: Start accepts. Automaton has 17375 states and 28546 transitions. Word has length 364 [2025-02-06 02:19:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:31,450 INFO L471 AbstractCegarLoop]: Abstraction has 17375 states and 28546 transitions. [2025-02-06 02:19:31,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 17375 states and 28546 transitions. [2025-02-06 02:19:31,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-02-06 02:19:31,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:31,459 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:31,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:19:31,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:31,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:31,459 INFO L85 PathProgramCache]: Analyzing trace with hash -185824685, now seen corresponding path program 1 times [2025-02-06 02:19:31,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:31,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523292571] [2025-02-06 02:19:31,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:31,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:31,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-02-06 02:19:31,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-02-06 02:19:31,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:31,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-02-06 02:19:32,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:32,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523292571] [2025-02-06 02:19:32,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523292571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:32,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:32,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:19:32,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604683359] [2025-02-06 02:19:32,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:32,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:19:32,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:32,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:19:32,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:32,011 INFO L87 Difference]: Start difference. First operand 17375 states and 28546 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:32,570 INFO L93 Difference]: Finished difference Result 44003 states and 72213 transitions. [2025-02-06 02:19:32,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:19:32,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 365 [2025-02-06 02:19:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:32,641 INFO L225 Difference]: With dead ends: 44003 [2025-02-06 02:19:32,642 INFO L226 Difference]: Without dead ends: 26631 [2025-02-06 02:19:32,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:19:32,672 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 135 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:32,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 951 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:19:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26631 states. [2025-02-06 02:19:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26631 to 22693. [2025-02-06 02:19:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22693 states, 20260 states have (on average 1.631441263573544) internal successors, (33053), 20292 states have internal predecessors, (33053), 2368 states have call successors, (2368), 64 states have call predecessors, (2368), 64 states have return successors, (2368), 2336 states have call predecessors, (2368), 2368 states have call successors, (2368) [2025-02-06 02:19:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22693 states to 22693 states and 37789 transitions. [2025-02-06 02:19:33,737 INFO L78 Accepts]: Start accepts. Automaton has 22693 states and 37789 transitions. Word has length 365 [2025-02-06 02:19:33,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:33,738 INFO L471 AbstractCegarLoop]: Abstraction has 22693 states and 37789 transitions. [2025-02-06 02:19:33,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:33,738 INFO L276 IsEmpty]: Start isEmpty. Operand 22693 states and 37789 transitions. [2025-02-06 02:19:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-02-06 02:19:33,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:33,748 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:33,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:19:33,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:33,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:33,749 INFO L85 PathProgramCache]: Analyzing trace with hash 870170353, now seen corresponding path program 1 times [2025-02-06 02:19:33,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:33,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016096599] [2025-02-06 02:19:33,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:33,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:33,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-02-06 02:19:33,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-02-06 02:19:33,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:33,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-02-06 02:19:34,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:34,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016096599] [2025-02-06 02:19:34,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016096599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:34,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:34,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:19:34,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801869935] [2025-02-06 02:19:34,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:34,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:19:34,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:34,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:19:34,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:19:34,220 INFO L87 Difference]: Start difference. First operand 22693 states and 37789 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:35,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:35,583 INFO L93 Difference]: Finished difference Result 62922 states and 104288 transitions. [2025-02-06 02:19:35,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:19:35,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 367 [2025-02-06 02:19:35,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:35,700 INFO L225 Difference]: With dead ends: 62922 [2025-02-06 02:19:35,700 INFO L226 Difference]: Without dead ends: 40232 [2025-02-06 02:19:35,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:19:35,745 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 597 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:35,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 2581 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:19:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40232 states. [2025-02-06 02:19:37,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40232 to 35245. [2025-02-06 02:19:37,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35245 states, 31539 states have (on average 1.6286502425568343) internal successors, (51366), 31588 states have internal predecessors, (51366), 3607 states have call successors, (3607), 98 states have call predecessors, (3607), 98 states have return successors, (3607), 3558 states have call predecessors, (3607), 3607 states have call successors, (3607) [2025-02-06 02:19:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35245 states to 35245 states and 58580 transitions. [2025-02-06 02:19:37,276 INFO L78 Accepts]: Start accepts. Automaton has 35245 states and 58580 transitions. Word has length 367 [2025-02-06 02:19:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:37,277 INFO L471 AbstractCegarLoop]: Abstraction has 35245 states and 58580 transitions. [2025-02-06 02:19:37,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 35245 states and 58580 transitions. [2025-02-06 02:19:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-02-06 02:19:37,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:37,286 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:37,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:19:37,287 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:37,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:37,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1380231061, now seen corresponding path program 1 times [2025-02-06 02:19:37,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:37,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174930784] [2025-02-06 02:19:37,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:37,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:37,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-02-06 02:19:37,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-02-06 02:19:37,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:37,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-02-06 02:19:37,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:37,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174930784] [2025-02-06 02:19:37,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174930784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:37,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:37,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:19:37,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66924605] [2025-02-06 02:19:37,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:37,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:19:37,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:37,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:19:37,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:37,469 INFO L87 Difference]: Start difference. First operand 35245 states and 58580 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:38,725 INFO L93 Difference]: Finished difference Result 79173 states and 131513 transitions. [2025-02-06 02:19:38,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:19:38,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 367 [2025-02-06 02:19:38,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:38,831 INFO L225 Difference]: With dead ends: 79173 [2025-02-06 02:19:38,831 INFO L226 Difference]: Without dead ends: 44029 [2025-02-06 02:19:38,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:38,890 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 615 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:38,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1104 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:19:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44029 states. [2025-02-06 02:19:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44029 to 42019. [2025-02-06 02:19:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42019 states, 37705 states have (on average 1.6307386288290677) internal successors, (61487), 37762 states have internal predecessors, (61487), 4199 states have call successors, (4199), 114 states have call predecessors, (4199), 114 states have return successors, (4199), 4142 states have call predecessors, (4199), 4199 states have call successors, (4199) [2025-02-06 02:19:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42019 states to 42019 states and 69885 transitions. [2025-02-06 02:19:41,038 INFO L78 Accepts]: Start accepts. Automaton has 42019 states and 69885 transitions. Word has length 367 [2025-02-06 02:19:41,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:41,040 INFO L471 AbstractCegarLoop]: Abstraction has 42019 states and 69885 transitions. [2025-02-06 02:19:41,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 42019 states and 69885 transitions. [2025-02-06 02:19:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-02-06 02:19:41,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:41,050 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:41,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:19:41,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:41,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:41,050 INFO L85 PathProgramCache]: Analyzing trace with hash -199204508, now seen corresponding path program 1 times [2025-02-06 02:19:41,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:41,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485469753] [2025-02-06 02:19:41,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:41,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:41,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-06 02:19:41,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-06 02:19:41,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:41,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-02-06 02:19:41,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:41,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485469753] [2025-02-06 02:19:41,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485469753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:41,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:41,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:19:41,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488549022] [2025-02-06 02:19:41,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:41,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:19:41,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:41,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:19:41,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:19:41,374 INFO L87 Difference]: Start difference. First operand 42019 states and 69885 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:42,644 INFO L93 Difference]: Finished difference Result 86547 states and 143658 transitions. [2025-02-06 02:19:42,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:19:42,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 368 [2025-02-06 02:19:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:42,753 INFO L225 Difference]: With dead ends: 86547 [2025-02-06 02:19:42,753 INFO L226 Difference]: Without dead ends: 44629 [2025-02-06 02:19:42,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:19:42,817 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 529 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:42,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1776 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:19:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44629 states. [2025-02-06 02:19:44,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44629 to 42679. [2025-02-06 02:19:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42679 states, 38365 states have (on average 1.6292714713931968) internal successors, (62507), 38422 states have internal predecessors, (62507), 4199 states have call successors, (4199), 114 states have call predecessors, (4199), 114 states have return successors, (4199), 4142 states have call predecessors, (4199), 4199 states have call successors, (4199) [2025-02-06 02:19:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42679 states to 42679 states and 70905 transitions. [2025-02-06 02:19:44,586 INFO L78 Accepts]: Start accepts. Automaton has 42679 states and 70905 transitions. Word has length 368 [2025-02-06 02:19:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:44,587 INFO L471 AbstractCegarLoop]: Abstraction has 42679 states and 70905 transitions. [2025-02-06 02:19:44,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 42679 states and 70905 transitions. [2025-02-06 02:19:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-02-06 02:19:44,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:44,601 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:44,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:19:44,602 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:44,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:44,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1458856418, now seen corresponding path program 1 times [2025-02-06 02:19:44,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:44,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079416966] [2025-02-06 02:19:44,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:44,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:44,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-06 02:19:44,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-06 02:19:44,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:44,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-02-06 02:19:44,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:44,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079416966] [2025-02-06 02:19:44,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079416966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:44,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:44,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:19:44,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222934907] [2025-02-06 02:19:44,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:44,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:19:44,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:44,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:19:44,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:44,842 INFO L87 Difference]: Start difference. First operand 42679 states and 70905 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:47,160 INFO L93 Difference]: Finished difference Result 99395 states and 162664 transitions. [2025-02-06 02:19:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:19:47,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 368 [2025-02-06 02:19:47,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:47,332 INFO L225 Difference]: With dead ends: 99395 [2025-02-06 02:19:47,332 INFO L226 Difference]: Without dead ends: 64251 [2025-02-06 02:19:47,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:19:47,384 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 712 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:47,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1252 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:19:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64251 states. [2025-02-06 02:19:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64251 to 46927. [2025-02-06 02:19:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46927 states, 42157 states have (on average 1.6271081908105416) internal successors, (68594), 42222 states have internal predecessors, (68594), 4639 states have call successors, (4639), 130 states have call predecessors, (4639), 130 states have return successors, (4639), 4574 states have call predecessors, (4639), 4639 states have call successors, (4639) [2025-02-06 02:19:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46927 states to 46927 states and 77872 transitions. [2025-02-06 02:19:50,162 INFO L78 Accepts]: Start accepts. Automaton has 46927 states and 77872 transitions. Word has length 368 [2025-02-06 02:19:50,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:50,162 INFO L471 AbstractCegarLoop]: Abstraction has 46927 states and 77872 transitions. [2025-02-06 02:19:50,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand 46927 states and 77872 transitions. [2025-02-06 02:19:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-02-06 02:19:50,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:50,175 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:50,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:19:50,176 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:50,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:50,176 INFO L85 PathProgramCache]: Analyzing trace with hash 729404159, now seen corresponding path program 1 times [2025-02-06 02:19:50,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:50,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134535218] [2025-02-06 02:19:50,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:50,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:50,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-06 02:19:50,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-06 02:19:50,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:50,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-02-06 02:19:50,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:50,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134535218] [2025-02-06 02:19:50,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134535218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:50,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:50,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:19:50,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155603312] [2025-02-06 02:19:50,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:50,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:19:50,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:50,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:19:50,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:19:50,557 INFO L87 Difference]: Start difference. First operand 46927 states and 77872 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-02-06 02:19:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:59,165 INFO L93 Difference]: Finished difference Result 505932 states and 834885 transitions. [2025-02-06 02:19:59,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 02:19:59,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 368 [2025-02-06 02:19:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:00,321 INFO L225 Difference]: With dead ends: 505932 [2025-02-06 02:20:00,321 INFO L226 Difference]: Without dead ends: 482893 [2025-02-06 02:20:00,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=269, Invalid=1213, Unknown=0, NotChecked=0, Total=1482 [2025-02-06 02:20:00,454 INFO L435 NwaCegarLoop]: 1207 mSDtfsCounter, 1897 mSDsluCounter, 5893 mSDsCounter, 0 mSdLazyCounter, 3414 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 7100 SdHoareTripleChecker+Invalid, 3808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 3414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:00,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 7100 Invalid, 3808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 3414 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 02:20:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482893 states.