./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 330035e885fa245249a9985bfeff9cf400ee4543a6b7e2fb380a386ceeec5a9f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:13:59,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:13:59,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:13:59,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:13:59,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:13:59,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:13:59,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:13:59,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:13:59,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:13:59,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:13:59,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:13:59,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:13:59,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:13:59,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:13:59,165 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:13:59,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:13:59,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:13:59,166 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:13:59,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:13:59,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:13:59,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:13:59,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:13:59,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:13:59,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:13:59,166 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:13:59,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:13:59,167 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:13:59,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:13:59,167 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 330035e885fa245249a9985bfeff9cf400ee4543a6b7e2fb380a386ceeec5a9f [2025-03-17 02:13:59,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:13:59,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:13:59,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:13:59,413 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:13:59,414 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:13:59,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.i [2025-03-17 02:14:00,689 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd6f2197/bb2aedeaa2e6422ca0a3c1f24d3cd2c3/FLAG517ca5a3e [2025-03-17 02:14:00,932 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:14:00,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.i [2025-03-17 02:14:00,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd6f2197/bb2aedeaa2e6422ca0a3c1f24d3cd2c3/FLAG517ca5a3e [2025-03-17 02:14:01,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd6f2197/bb2aedeaa2e6422ca0a3c1f24d3cd2c3 [2025-03-17 02:14:01,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:14:01,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:14:01,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:14:01,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:14:01,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:14:01,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:14:01" (1/1) ... [2025-03-17 02:14:01,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2095208b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:01, skipping insertion in model container [2025-03-17 02:14:01,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:14:01" (1/1) ... [2025-03-17 02:14:01,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:14:01,440 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.i[919,932] [2025-03-17 02:14:01,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:14:01,542 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:14:01,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.i[919,932] [2025-03-17 02:14:01,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:14:01,588 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:14:01,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:01 WrapperNode [2025-03-17 02:14:01,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:14:01,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:14:01,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:14:01,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:14:01,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:01" (1/1) ... [2025-03-17 02:14:01,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:01" (1/1) ... [2025-03-17 02:14:01,631 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 305 [2025-03-17 02:14:01,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:14:01,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:14:01,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:14:01,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:14:01,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:01" (1/1) ... [2025-03-17 02:14:01,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:01" (1/1) ... [2025-03-17 02:14:01,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:01" (1/1) ... [2025-03-17 02:14:01,668 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:14:01,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:01" (1/1) ... [2025-03-17 02:14:01,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:01" (1/1) ... [2025-03-17 02:14:01,685 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:01" (1/1) ... [2025-03-17 02:14:01,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:01" (1/1) ... [2025-03-17 02:14:01,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:01" (1/1) ... [2025-03-17 02:14:01,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:01" (1/1) ... [2025-03-17 02:14:01,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:14:01,707 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:14:01,707 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:14:01,707 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:14:01,708 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:01" (1/1) ... [2025-03-17 02:14:01,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:14:01,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:14:01,735 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:14:01,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:14:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:14:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:14:01,753 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:14:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:14:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:14:01,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:14:01,830 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:14:01,831 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:14:02,240 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc property_#t~bitwise34#1;havoc property_#t~short35#1; [2025-03-17 02:14:02,296 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 02:14:02,297 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:14:02,312 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:14:02,312 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:14:02,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:14:02 BoogieIcfgContainer [2025-03-17 02:14:02,312 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:14:02,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:14:02,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:14:02,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:14:02,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:14:01" (1/3) ... [2025-03-17 02:14:02,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699b430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:14:02, skipping insertion in model container [2025-03-17 02:14:02,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:01" (2/3) ... [2025-03-17 02:14:02,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699b430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:14:02, skipping insertion in model container [2025-03-17 02:14:02,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:14:02" (3/3) ... [2025-03-17 02:14:02,319 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.i [2025-03-17 02:14:02,329 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:14:02,331 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.i that has 2 procedures, 129 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:14:02,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:14:02,398 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;@42b4dd7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:14:02,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:14:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 02:14:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-17 02:14:02,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:14:02,413 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:14:02,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:14:02,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:14:02,420 INFO L85 PathProgramCache]: Analyzing trace with hash 993175149, now seen corresponding path program 1 times [2025-03-17 02:14:02,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:14:02,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601896939] [2025-03-17 02:14:02,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:14:02,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:14:02,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-17 02:14:02,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-17 02:14:02,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:14:02,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:14:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-17 02:14:02,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:14:02,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601896939] [2025-03-17 02:14:02,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601896939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:14:02,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140638292] [2025-03-17 02:14:02,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:14:02,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:14:02,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:14:02,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:14:02,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:14:02,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-17 02:14:03,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-17 02:14:03,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:14:03,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:14:03,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:14:03,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:14:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-17 02:14:03,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:14:03,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140638292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:14:03,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:14:03,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:14:03,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117926200] [2025-03-17 02:14:03,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:14:03,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:14:03,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:14:03,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:14:03,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:14:03,086 INFO L87 Difference]: Start difference. First operand has 129 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 02:14:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:14:03,145 INFO L93 Difference]: Finished difference Result 255 states and 466 transitions. [2025-03-17 02:14:03,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:14:03,146 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 303 [2025-03-17 02:14:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:14:03,153 INFO L225 Difference]: With dead ends: 255 [2025-03-17 02:14:03,153 INFO L226 Difference]: Without dead ends: 127 [2025-03-17 02:14:03,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:14:03,157 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:14:03,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:14:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-17 02:14:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-17 02:14:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 02:14:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 205 transitions. [2025-03-17 02:14:03,207 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 205 transitions. Word has length 303 [2025-03-17 02:14:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:14:03,208 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 205 transitions. [2025-03-17 02:14:03,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 02:14:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 205 transitions. [2025-03-17 02:14:03,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-17 02:14:03,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:14:03,213 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:14:03,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:14:03,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:14:03,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:14:03,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:14:03,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1425824329, now seen corresponding path program 1 times [2025-03-17 02:14:03,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:14:03,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299085987] [2025-03-17 02:14:03,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:14:03,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:14:03,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-17 02:14:03,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-17 02:14:03,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:14:03,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:14:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 02:14:04,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:14:04,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299085987] [2025-03-17 02:14:04,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299085987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:14:04,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:14:04,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:14:04,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898793234] [2025-03-17 02:14:04,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:14:04,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:14:04,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:14:04,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:14:04,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:14:04,304 INFO L87 Difference]: Start difference. First operand 127 states and 205 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:14:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:14:04,588 INFO L93 Difference]: Finished difference Result 380 states and 615 transitions. [2025-03-17 02:14:04,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:14:04,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 303 [2025-03-17 02:14:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:14:04,595 INFO L225 Difference]: With dead ends: 380 [2025-03-17 02:14:04,595 INFO L226 Difference]: Without dead ends: 254 [2025-03-17 02:14:04,596 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-03-17 02:14:04,597 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 122 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:14:04,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 483 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:14:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-17 02:14:04,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2025-03-17 02:14:04,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 149 states have (on average 1.4026845637583893) internal successors, (209), 149 states have internal predecessors, (209), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 02:14:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 409 transitions. [2025-03-17 02:14:04,666 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 409 transitions. Word has length 303 [2025-03-17 02:14:04,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:14:04,667 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 409 transitions. [2025-03-17 02:14:04,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:14:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 409 transitions. [2025-03-17 02:14:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 02:14:04,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:14:04,672 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:14:04,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:14:04,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:14:04,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:14:04,673 INFO L85 PathProgramCache]: Analyzing trace with hash 500413534, now seen corresponding path program 1 times [2025-03-17 02:14:04,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:14:04,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689953228] [2025-03-17 02:14:04,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:14:04,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:14:04,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 02:14:04,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 02:14:04,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:14:04,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:14:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 02:14:05,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:14:05,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689953228] [2025-03-17 02:14:05,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689953228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:14:05,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:14:05,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:14:05,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162440024] [2025-03-17 02:14:05,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:14:05,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:14:05,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:14:05,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:14:05,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:14:05,153 INFO L87 Difference]: Start difference. First operand 252 states and 409 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:14:05,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:14:05,242 INFO L93 Difference]: Finished difference Result 569 states and 912 transitions. [2025-03-17 02:14:05,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:14:05,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 02:14:05,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:14:05,245 INFO L225 Difference]: With dead ends: 569 [2025-03-17 02:14:05,246 INFO L226 Difference]: Without dead ends: 318 [2025-03-17 02:14:05,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:14:05,247 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 41 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:14:05,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 591 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:14:05,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-17 02:14:05,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2025-03-17 02:14:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 201 states have (on average 1.3980099502487562) internal successors, (281), 203 states have internal predecessors, (281), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-17 02:14:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 497 transitions. [2025-03-17 02:14:05,284 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 497 transitions. Word has length 304 [2025-03-17 02:14:05,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:14:05,285 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 497 transitions. [2025-03-17 02:14:05,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:14:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 497 transitions. [2025-03-17 02:14:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 02:14:05,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:14:05,290 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:14:05,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:14:05,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:14:05,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:14:05,292 INFO L85 PathProgramCache]: Analyzing trace with hash 696927039, now seen corresponding path program 1 times [2025-03-17 02:14:05,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:14:05,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204368212] [2025-03-17 02:14:05,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:14:05,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:14:05,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 02:14:05,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 02:14:05,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:14:05,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:14:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 02:14:14,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:14:14,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204368212] [2025-03-17 02:14:14,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204368212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:14:14,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:14:14,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 02:14:14,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35434166] [2025-03-17 02:14:14,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:14:14,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 02:14:14,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:14:14,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 02:14:14,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:14:14,543 INFO L87 Difference]: Start difference. First operand 314 states and 497 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:14:17,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:14:17,037 INFO L93 Difference]: Finished difference Result 998 states and 1548 transitions. [2025-03-17 02:14:17,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 02:14:17,037 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 02:14:17,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:14:17,042 INFO L225 Difference]: With dead ends: 998 [2025-03-17 02:14:17,043 INFO L226 Difference]: Without dead ends: 685 [2025-03-17 02:14:17,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-17 02:14:17,045 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 590 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 02:14:17,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1120 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 02:14:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-17 02:14:17,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 461. [2025-03-17 02:14:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 297 states have (on average 1.4175084175084176) internal successors, (421), 299 states have internal predecessors, (421), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-17 02:14:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 737 transitions. [2025-03-17 02:14:17,101 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 737 transitions. Word has length 304 [2025-03-17 02:14:17,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:14:17,102 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 737 transitions. [2025-03-17 02:14:17,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:14:17,102 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 737 transitions. [2025-03-17 02:14:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 02:14:17,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:14:17,105 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:14:17,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:14:17,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:14:17,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:14:17,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1100024320, now seen corresponding path program 1 times [2025-03-17 02:14:17,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:14:17,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455570606] [2025-03-17 02:14:17,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:14:17,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:14:17,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 02:14:17,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 02:14:17,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:14:17,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:14:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 02:14:25,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:14:25,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455570606] [2025-03-17 02:14:25,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455570606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:14:25,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:14:25,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 02:14:25,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458863205] [2025-03-17 02:14:25,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:14:25,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 02:14:25,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:14:25,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 02:14:25,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:14:25,236 INFO L87 Difference]: Start difference. First operand 461 states and 737 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:14:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:14:28,570 INFO L93 Difference]: Finished difference Result 978 states and 1521 transitions. [2025-03-17 02:14:28,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 02:14:28,571 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 02:14:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:14:28,582 INFO L225 Difference]: With dead ends: 978 [2025-03-17 02:14:28,582 INFO L226 Difference]: Without dead ends: 665 [2025-03-17 02:14:28,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-03-17 02:14:28,584 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 510 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 02:14:28,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1115 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 02:14:28,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-17 02:14:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 461. [2025-03-17 02:14:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 297 states have (on average 1.4175084175084176) internal successors, (421), 299 states have internal predecessors, (421), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-17 02:14:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 737 transitions. [2025-03-17 02:14:28,664 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 737 transitions. Word has length 304 [2025-03-17 02:14:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:14:28,667 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 737 transitions. [2025-03-17 02:14:28,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:14:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 737 transitions. [2025-03-17 02:14:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 02:14:28,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:14:28,671 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:14:28,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:14:28,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:14:28,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:14:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash 826009758, now seen corresponding path program 1 times [2025-03-17 02:14:28,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:14:28,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38068425] [2025-03-17 02:14:28,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:14:28,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:14:28,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 02:14:28,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 02:14:28,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:14:28,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:14:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 02:14:29,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:14:29,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38068425] [2025-03-17 02:14:29,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38068425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:14:29,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:14:29,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:14:29,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090699555] [2025-03-17 02:14:29,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:14:29,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:14:29,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:14:29,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:14:29,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:14:29,884 INFO L87 Difference]: Start difference. First operand 461 states and 737 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 02:14:30,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:14:30,711 INFO L93 Difference]: Finished difference Result 944 states and 1483 transitions. [2025-03-17 02:14:30,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:14:30,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 304 [2025-03-17 02:14:30,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:14:30,715 INFO L225 Difference]: With dead ends: 944 [2025-03-17 02:14:30,715 INFO L226 Difference]: Without dead ends: 631 [2025-03-17 02:14:30,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-17 02:14:30,717 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 339 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 02:14:30,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1061 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 02:14:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-03-17 02:14:30,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 473. [2025-03-17 02:14:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 309 states have (on average 1.4077669902912622) internal successors, (435), 311 states have internal predecessors, (435), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-17 02:14:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 751 transitions. [2025-03-17 02:14:30,762 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 751 transitions. Word has length 304 [2025-03-17 02:14:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:14:30,762 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 751 transitions. [2025-03-17 02:14:30,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 02:14:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 751 transitions. [2025-03-17 02:14:30,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 02:14:30,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:14:30,764 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:14:30,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:14:30,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:14:30,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:14:30,765 INFO L85 PathProgramCache]: Analyzing trace with hash 191368414, now seen corresponding path program 1 times [2025-03-17 02:14:30,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:14:30,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714742330] [2025-03-17 02:14:30,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:14:30,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:14:30,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 02:14:30,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 02:14:30,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:14:30,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:14:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 02:14:38,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:14:38,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714742330] [2025-03-17 02:14:38,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714742330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:14:38,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:14:38,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 02:14:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480021945] [2025-03-17 02:14:38,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:14:38,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 02:14:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:14:38,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 02:14:38,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:14:38,394 INFO L87 Difference]: Start difference. First operand 473 states and 751 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:14:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:14:40,593 INFO L93 Difference]: Finished difference Result 962 states and 1494 transitions. [2025-03-17 02:14:40,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 02:14:40,597 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 02:14:40,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:14:40,600 INFO L225 Difference]: With dead ends: 962 [2025-03-17 02:14:40,601 INFO L226 Difference]: Without dead ends: 649 [2025-03-17 02:14:40,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2025-03-17 02:14:40,604 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 325 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:14:40,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1088 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 02:14:40,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-17 02:14:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 475. [2025-03-17 02:14:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 311 states have (on average 1.4115755627009647) internal successors, (439), 313 states have internal predecessors, (439), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-17 02:14:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 755 transitions. [2025-03-17 02:14:40,665 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 755 transitions. Word has length 304 [2025-03-17 02:14:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:14:40,666 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 755 transitions. [2025-03-17 02:14:40,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:14:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 755 transitions. [2025-03-17 02:14:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 02:14:40,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:14:40,669 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:14:40,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:14:40,669 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:14:40,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:14:40,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1605582945, now seen corresponding path program 1 times [2025-03-17 02:14:40,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:14:40,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250836920] [2025-03-17 02:14:40,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:14:40,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:14:40,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 02:14:40,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 02:14:40,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:14:40,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:14:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 02:14:48,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:14:48,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250836920] [2025-03-17 02:14:48,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250836920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:14:48,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:14:48,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 02:14:48,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792848251] [2025-03-17 02:14:48,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:14:48,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 02:14:48,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:14:48,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 02:14:48,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:14:48,024 INFO L87 Difference]: Start difference. First operand 475 states and 755 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:14:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:14:50,402 INFO L93 Difference]: Finished difference Result 1251 states and 1958 transitions. [2025-03-17 02:14:50,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 02:14:50,403 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 02:14:50,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:14:50,407 INFO L225 Difference]: With dead ends: 1251 [2025-03-17 02:14:50,408 INFO L226 Difference]: Without dead ends: 938 [2025-03-17 02:14:50,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-03-17 02:14:50,409 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 313 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:14:50,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1060 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 02:14:50,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-03-17 02:14:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 780. [2025-03-17 02:14:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 504 states have (on average 1.4087301587301588) internal successors, (710), 508 states have internal predecessors, (710), 266 states have call successors, (266), 9 states have call predecessors, (266), 9 states have return successors, (266), 262 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-17 02:14:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1242 transitions. [2025-03-17 02:14:50,482 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1242 transitions. Word has length 304 [2025-03-17 02:14:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:14:50,485 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1242 transitions. [2025-03-17 02:14:50,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:14:50,485 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1242 transitions. [2025-03-17 02:14:50,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 02:14:50,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:14:50,487 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:14:50,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 02:14:50,487 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:14:50,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:14:50,487 INFO L85 PathProgramCache]: Analyzing trace with hash -354156596, now seen corresponding path program 1 times [2025-03-17 02:14:50,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:14:50,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398367709] [2025-03-17 02:14:50,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:14:50,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:14:50,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 02:14:50,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 02:14:50,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:14:50,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:14:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 02:14:59,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:14:59,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398367709] [2025-03-17 02:14:59,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398367709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:14:59,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:14:59,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:14:59,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608791631] [2025-03-17 02:14:59,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:14:59,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:14:59,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:14:59,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:14:59,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:14:59,048 INFO L87 Difference]: Start difference. First operand 780 states and 1242 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:14:59,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:14:59,518 INFO L93 Difference]: Finished difference Result 1427 states and 2222 transitions. [2025-03-17 02:14:59,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:14:59,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 02:14:59,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:14:59,526 INFO L225 Difference]: With dead ends: 1427 [2025-03-17 02:14:59,526 INFO L226 Difference]: Without dead ends: 1114 [2025-03-17 02:14:59,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:14:59,528 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 261 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:14:59,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 790 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:14:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2025-03-17 02:14:59,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 812. [2025-03-17 02:14:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 536 states have (on average 1.4179104477611941) internal successors, (760), 540 states have internal predecessors, (760), 266 states have call successors, (266), 9 states have call predecessors, (266), 9 states have return successors, (266), 262 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-17 02:14:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1292 transitions. [2025-03-17 02:14:59,594 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1292 transitions. Word has length 305 [2025-03-17 02:14:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:14:59,596 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1292 transitions. [2025-03-17 02:14:59,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:14:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1292 transitions. [2025-03-17 02:14:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 02:14:59,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:14:59,597 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:14:59,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 02:14:59,598 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:14:59,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:14:59,598 INFO L85 PathProgramCache]: Analyzing trace with hash -157643091, now seen corresponding path program 1 times [2025-03-17 02:14:59,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:14:59,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248449501] [2025-03-17 02:14:59,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:14:59,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:14:59,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 02:14:59,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 02:14:59,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:14:59,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:15:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 02:15:04,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:15:04,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248449501] [2025-03-17 02:15:04,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248449501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:15:04,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:15:04,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 02:15:04,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100314086] [2025-03-17 02:15:04,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:15:04,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 02:15:04,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:15:04,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 02:15:04,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:15:04,638 INFO L87 Difference]: Start difference. First operand 812 states and 1292 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:15:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:15:07,053 INFO L93 Difference]: Finished difference Result 1609 states and 2479 transitions. [2025-03-17 02:15:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 02:15:07,053 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 02:15:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:15:07,059 INFO L225 Difference]: With dead ends: 1609 [2025-03-17 02:15:07,060 INFO L226 Difference]: Without dead ends: 1270 [2025-03-17 02:15:07,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-17 02:15:07,062 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 518 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 02:15:07,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1118 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 02:15:07,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2025-03-17 02:15:07,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 820. [2025-03-17 02:15:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 544 states have (on average 1.4191176470588236) internal successors, (772), 548 states have internal predecessors, (772), 266 states have call successors, (266), 9 states have call predecessors, (266), 9 states have return successors, (266), 262 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-17 02:15:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1304 transitions. [2025-03-17 02:15:07,130 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1304 transitions. Word has length 305 [2025-03-17 02:15:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:15:07,130 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1304 transitions. [2025-03-17 02:15:07,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:15:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1304 transitions. [2025-03-17 02:15:07,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 02:15:07,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:15:07,133 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:15:07,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 02:15:07,133 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:15:07,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:15:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2143859341, now seen corresponding path program 1 times [2025-03-17 02:15:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:15:07,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585987025] [2025-03-17 02:15:07,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:15:07,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:15:07,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 02:15:07,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 02:15:07,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:15:07,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:15:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 02:15:11,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:15:11,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585987025] [2025-03-17 02:15:11,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585987025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:15:11,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:15:11,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:15:11,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713731249] [2025-03-17 02:15:11,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:15:11,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:15:11,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:15:11,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:15:11,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:15:11,169 INFO L87 Difference]: Start difference. First operand 820 states and 1304 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:15:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:15:11,769 INFO L93 Difference]: Finished difference Result 1423 states and 2219 transitions. [2025-03-17 02:15:11,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:15:11,781 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 02:15:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:15:11,786 INFO L225 Difference]: With dead ends: 1423 [2025-03-17 02:15:11,786 INFO L226 Difference]: Without dead ends: 1084 [2025-03-17 02:15:11,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:15:11,788 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 176 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:15:11,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 921 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 02:15:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2025-03-17 02:15:11,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 820. [2025-03-17 02:15:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 544 states have (on average 1.4191176470588236) internal successors, (772), 548 states have internal predecessors, (772), 266 states have call successors, (266), 9 states have call predecessors, (266), 9 states have return successors, (266), 262 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-17 02:15:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1304 transitions. [2025-03-17 02:15:11,905 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1304 transitions. Word has length 305 [2025-03-17 02:15:11,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:15:11,905 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1304 transitions. [2025-03-17 02:15:11,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:15:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1304 transitions. [2025-03-17 02:15:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 02:15:11,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:15:11,907 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:15:11,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 02:15:11,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:15:11,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:15:11,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1954594450, now seen corresponding path program 1 times [2025-03-17 02:15:11,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:15:11,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953840153] [2025-03-17 02:15:11,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:15:11,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:15:11,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 02:15:12,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 02:15:12,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:15:12,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:15:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 02:15:16,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:15:16,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953840153] [2025-03-17 02:15:16,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953840153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:15:16,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:15:16,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 02:15:16,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116612154] [2025-03-17 02:15:16,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:15:16,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 02:15:16,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:15:16,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 02:15:16,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:15:16,932 INFO L87 Difference]: Start difference. First operand 820 states and 1304 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:15:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:15:21,587 INFO L93 Difference]: Finished difference Result 1559 states and 2398 transitions. [2025-03-17 02:15:21,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 02:15:21,588 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 02:15:21,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:15:21,595 INFO L225 Difference]: With dead ends: 1559 [2025-03-17 02:15:21,595 INFO L226 Difference]: Without dead ends: 1220 [2025-03-17 02:15:21,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2025-03-17 02:15:21,597 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 432 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 02:15:21,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1254 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 02:15:21,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2025-03-17 02:15:21,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 820. [2025-03-17 02:15:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 544 states have (on average 1.4191176470588236) internal successors, (772), 548 states have internal predecessors, (772), 266 states have call successors, (266), 9 states have call predecessors, (266), 9 states have return successors, (266), 262 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-17 02:15:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1304 transitions. [2025-03-17 02:15:21,664 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1304 transitions. Word has length 305 [2025-03-17 02:15:21,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:15:21,664 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1304 transitions. [2025-03-17 02:15:21,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:15:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1304 transitions. [2025-03-17 02:15:21,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 02:15:21,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:15:21,666 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:15:21,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 02:15:21,666 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:15:21,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:15:21,666 INFO L85 PathProgramCache]: Analyzing trace with hash -663201716, now seen corresponding path program 1 times [2025-03-17 02:15:21,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:15:21,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469685119] [2025-03-17 02:15:21,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:15:21,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:15:21,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 02:15:21,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 02:15:21,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:15:21,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:15:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 02:15:26,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:15:26,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469685119] [2025-03-17 02:15:26,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469685119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:15:26,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:15:26,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 02:15:26,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167029081] [2025-03-17 02:15:26,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:15:26,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 02:15:26,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:15:26,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 02:15:26,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:15:26,798 INFO L87 Difference]: Start difference. First operand 820 states and 1304 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:15:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:15:28,930 INFO L93 Difference]: Finished difference Result 1499 states and 2322 transitions. [2025-03-17 02:15:28,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 02:15:28,930 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 02:15:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:15:28,935 INFO L225 Difference]: With dead ends: 1499 [2025-03-17 02:15:28,935 INFO L226 Difference]: Without dead ends: 1160 [2025-03-17 02:15:28,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-17 02:15:28,938 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 457 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:15:28,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1103 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 02:15:28,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2025-03-17 02:15:28,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 822. [2025-03-17 02:15:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 546 states have (on average 1.4212454212454213) internal successors, (776), 550 states have internal predecessors, (776), 266 states have call successors, (266), 9 states have call predecessors, (266), 9 states have return successors, (266), 262 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-17 02:15:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1308 transitions. [2025-03-17 02:15:29,004 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1308 transitions. Word has length 305 [2025-03-17 02:15:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:15:29,005 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1308 transitions. [2025-03-17 02:15:29,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 02:15:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1308 transitions. [2025-03-17 02:15:29,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 02:15:29,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:15:29,007 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:15:29,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 02:15:29,007 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:15:29,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:15:29,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1834814221, now seen corresponding path program 1 times [2025-03-17 02:15:29,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:15:29,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402372130] [2025-03-17 02:15:29,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:15:29,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:15:29,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 02:15:29,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 02:15:29,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:15:29,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat