./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-2.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 8d5a9dc649f7d9ee20b528a56ea1dacc56986892fbe7bb53a5fab357faf2d873 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:06:02,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:06:02,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:06:02,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:06:02,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:06:02,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:06:02,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:06:02,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:06:02,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:06:02,640 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:06:02,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:06:02,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:06:02,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:06:02,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:06:02,642 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:06:02,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:06:02,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:06:02,642 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:06:02,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:06:02,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:06:02,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:06:02,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:06:02,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:06:02,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:06:02,643 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:06:02,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:06:02,643 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:06:02,643 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:06:02,643 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:06:02,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:06:02,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:06:02,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:06:02,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:06:02,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:06:02,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:06:02,644 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:06:02,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:06:02,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:06:02,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:06:02,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:06:02,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:06:02,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:06:02,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:06:02,645 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 -> 8d5a9dc649f7d9ee20b528a56ea1dacc56986892fbe7bb53a5fab357faf2d873 [2025-03-03 20:06:02,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:06:02,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:06:02,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:06:02,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:06:02,873 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:06:02,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-2.i [2025-03-03 20:06:03,955 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82382c079/11cfddfac97741dd8d53b60e1f09e710/FLAG7598d56d6 [2025-03-03 20:06:04,208 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:06:04,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-2.i [2025-03-03 20:06:04,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82382c079/11cfddfac97741dd8d53b60e1f09e710/FLAG7598d56d6 [2025-03-03 20:06:04,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82382c079/11cfddfac97741dd8d53b60e1f09e710 [2025-03-03 20:06:04,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:06:04,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:06:04,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:06:04,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:06:04,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:06:04,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:06:04" (1/1) ... [2025-03-03 20:06:04,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f2962fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:04, skipping insertion in model container [2025-03-03 20:06:04,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:06:04" (1/1) ... [2025-03-03 20:06:04,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:06:04,371 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_fillercodesize_ps-cn-500_file-2.i[915,928] [2025-03-03 20:06:04,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:06:04,503 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:06:04,510 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_fillercodesize_ps-cn-500_file-2.i[915,928] [2025-03-03 20:06:04,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:06:04,572 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:06:04,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:04 WrapperNode [2025-03-03 20:06:04,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:06:04,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:06:04,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:06:04,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:06:04,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:04" (1/1) ... [2025-03-03 20:06:04,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:04" (1/1) ... [2025-03-03 20:06:04,658 INFO L138 Inliner]: procedures = 26, calls = 112, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 818 [2025-03-03 20:06:04,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:06:04,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:06:04,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:06:04,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:06:04,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:04" (1/1) ... [2025-03-03 20:06:04,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:04" (1/1) ... [2025-03-03 20:06:04,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:04" (1/1) ... [2025-03-03 20:06:04,714 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-03 20:06:04,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:04" (1/1) ... [2025-03-03 20:06:04,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:04" (1/1) ... [2025-03-03 20:06:04,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:04" (1/1) ... [2025-03-03 20:06:04,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:04" (1/1) ... [2025-03-03 20:06:04,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:04" (1/1) ... [2025-03-03 20:06:04,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:04" (1/1) ... [2025-03-03 20:06:04,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:06:04,775 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:06:04,776 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:06:04,776 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:06:04,777 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:04" (1/1) ... [2025-03-03 20:06:04,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:06:04,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:06:04,802 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-03 20:06:04,804 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-03 20:06:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:06:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:06:04,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:06:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:06:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:06:04,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:06:04,946 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:06:04,948 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:06:05,822 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 20:06:05,823 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:06:05,852 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:06:05,852 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 20:06:05,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:06:05 BoogieIcfgContainer [2025-03-03 20:06:05,853 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:06:05,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:06:05,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:06:05,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:06:05,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:06:04" (1/3) ... [2025-03-03 20:06:05,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a70f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:06:05, skipping insertion in model container [2025-03-03 20:06:05,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:04" (2/3) ... [2025-03-03 20:06:05,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a70f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:06:05, skipping insertion in model container [2025-03-03 20:06:05,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:06:05" (3/3) ... [2025-03-03 20:06:05,861 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-2.i [2025-03-03 20:06:05,871 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:06:05,874 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-2.i that has 2 procedures, 334 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:06:05,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:06:05,943 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;@47bdf047, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:06:05,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:06:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 232 states have (on average 1.581896551724138) internal successors, (367), 233 states have internal predecessors, (367), 99 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 20:06:05,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-03 20:06:05,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:05,970 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:05,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:05,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:05,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1535950885, now seen corresponding path program 1 times [2025-03-03 20:06:05,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:05,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275440334] [2025-03-03 20:06:05,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:05,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:06,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-03 20:06:06,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-03 20:06:06,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:06,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 19208 trivial. 0 not checked. [2025-03-03 20:06:06,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:06,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275440334] [2025-03-03 20:06:06,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275440334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:06:06,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477931792] [2025-03-03 20:06:06,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:06,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:06:06,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:06:06,606 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-03 20:06:06,607 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-03 20:06:06,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-03 20:06:06,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-03 20:06:06,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:06,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:06,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:06:06,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:06:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 19208 trivial. 0 not checked. [2025-03-03 20:06:07,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:06:07,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477931792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:07,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:06:07,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:06:07,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422282320] [2025-03-03 20:06:07,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:07,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:06:07,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:07,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:06:07,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:06:07,057 INFO L87 Difference]: Start difference. First operand has 334 states, 232 states have (on average 1.581896551724138) internal successors, (367), 233 states have internal predecessors, (367), 99 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (99), 2 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 2 states have call successors, (99) [2025-03-03 20:06:07,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:07,137 INFO L93 Difference]: Finished difference Result 661 states and 1222 transitions. [2025-03-03 20:06:07,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:06:07,140 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (99), 2 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 2 states have call successors, (99) Word has length 642 [2025-03-03 20:06:07,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:07,147 INFO L225 Difference]: With dead ends: 661 [2025-03-03 20:06:07,148 INFO L226 Difference]: Without dead ends: 330 [2025-03-03 20:06:07,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 643 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-03 20:06:07,157 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:07,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:07,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-03 20:06:07,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-03-03 20:06:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 229 states have (on average 1.5458515283842795) internal successors, (354), 229 states have internal predecessors, (354), 99 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 20:06:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 552 transitions. [2025-03-03 20:06:07,240 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 552 transitions. Word has length 642 [2025-03-03 20:06:07,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:07,240 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 552 transitions. [2025-03-03 20:06:07,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (99), 2 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 2 states have call successors, (99) [2025-03-03 20:06:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 552 transitions. [2025-03-03 20:06:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-03 20:06:07,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:07,256 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:07,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:06:07,457 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-03 20:06:07,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:07,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:07,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1887949195, now seen corresponding path program 1 times [2025-03-03 20:06:07,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:07,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260112387] [2025-03-03 20:06:07,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:07,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:07,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-03 20:06:07,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-03 20:06:07,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:07,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:08,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:08,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260112387] [2025-03-03 20:06:08,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260112387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:08,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:08,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:08,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785691571] [2025-03-03 20:06:08,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:08,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:08,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:08,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:08,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:08,105 INFO L87 Difference]: Start difference. First operand 330 states and 552 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:08,220 INFO L93 Difference]: Finished difference Result 851 states and 1429 transitions. [2025-03-03 20:06:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:08,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 643 [2025-03-03 20:06:08,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:08,227 INFO L225 Difference]: With dead ends: 851 [2025-03-03 20:06:08,227 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 20:06:08,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:08,230 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 334 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:08,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1084 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:08,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 20:06:08,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 521. [2025-03-03 20:06:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 392 states have (on average 1.5841836734693877) internal successors, (621), 393 states have internal predecessors, (621), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-03 20:06:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 873 transitions. [2025-03-03 20:06:08,289 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 873 transitions. Word has length 643 [2025-03-03 20:06:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:08,291 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 873 transitions. [2025-03-03 20:06:08,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 873 transitions. [2025-03-03 20:06:08,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-03 20:06:08,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:08,297 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:08,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:06:08,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:08,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:08,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2091465269, now seen corresponding path program 1 times [2025-03-03 20:06:08,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:08,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563993214] [2025-03-03 20:06:08,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:08,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-03 20:06:08,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-03 20:06:08,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:08,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:08,628 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:08,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:08,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563993214] [2025-03-03 20:06:08,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563993214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:08,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:08,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:08,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676187046] [2025-03-03 20:06:08,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:08,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:08,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:08,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:08,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:08,633 INFO L87 Difference]: Start difference. First operand 521 states and 873 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:08,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:08,733 INFO L93 Difference]: Finished difference Result 1046 states and 1748 transitions. [2025-03-03 20:06:08,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:08,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 643 [2025-03-03 20:06:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:08,740 INFO L225 Difference]: With dead ends: 1046 [2025-03-03 20:06:08,740 INFO L226 Difference]: Without dead ends: 528 [2025-03-03 20:06:08,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:08,743 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 280 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:08,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1123 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-03 20:06:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 453. [2025-03-03 20:06:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 351 states have (on average 1.601139601139601) internal successors, (562), 351 states have internal predecessors, (562), 99 states have call successors, (99), 2 states have call predecessors, (99), 2 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 20:06:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 760 transitions. [2025-03-03 20:06:08,777 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 760 transitions. Word has length 643 [2025-03-03 20:06:08,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:08,778 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 760 transitions. [2025-03-03 20:06:08,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 760 transitions. [2025-03-03 20:06:08,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-03 20:06:08,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:08,798 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:08,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:06:08,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:08,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:08,800 INFO L85 PathProgramCache]: Analyzing trace with hash 874356076, now seen corresponding path program 1 times [2025-03-03 20:06:08,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:08,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370323746] [2025-03-03 20:06:08,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:08,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:08,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-03 20:06:08,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-03 20:06:08,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:08,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:09,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:09,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370323746] [2025-03-03 20:06:09,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370323746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:09,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:09,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:09,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147888346] [2025-03-03 20:06:09,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:09,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:09,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:09,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:09,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:09,082 INFO L87 Difference]: Start difference. First operand 453 states and 760 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:09,154 INFO L93 Difference]: Finished difference Result 1164 states and 1947 transitions. [2025-03-03 20:06:09,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:09,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 643 [2025-03-03 20:06:09,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:09,161 INFO L225 Difference]: With dead ends: 1164 [2025-03-03 20:06:09,162 INFO L226 Difference]: Without dead ends: 714 [2025-03-03 20:06:09,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:09,163 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 303 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:09,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1314 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-03 20:06:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 711. [2025-03-03 20:06:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 545 states have (on average 1.5853211009174313) internal successors, (864), 546 states have internal predecessors, (864), 161 states have call successors, (161), 4 states have call predecessors, (161), 4 states have return successors, (161), 160 states have call predecessors, (161), 161 states have call successors, (161) [2025-03-03 20:06:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1186 transitions. [2025-03-03 20:06:09,206 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1186 transitions. Word has length 643 [2025-03-03 20:06:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:09,207 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1186 transitions. [2025-03-03 20:06:09,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1186 transitions. [2025-03-03 20:06:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-03 20:06:09,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:09,211 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:09,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:06:09,211 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:09,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:09,212 INFO L85 PathProgramCache]: Analyzing trace with hash 633815947, now seen corresponding path program 1 times [2025-03-03 20:06:09,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:09,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942709424] [2025-03-03 20:06:09,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:09,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:09,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-03 20:06:09,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-03 20:06:09,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:09,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:09,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:09,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942709424] [2025-03-03 20:06:09,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942709424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:09,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:09,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:09,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776260716] [2025-03-03 20:06:09,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:09,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:09,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:09,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:09,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:09,438 INFO L87 Difference]: Start difference. First operand 711 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:09,493 INFO L93 Difference]: Finished difference Result 1423 states and 2377 transitions. [2025-03-03 20:06:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:09,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 643 [2025-03-03 20:06:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:09,501 INFO L225 Difference]: With dead ends: 1423 [2025-03-03 20:06:09,501 INFO L226 Difference]: Without dead ends: 715 [2025-03-03 20:06:09,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:09,504 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 0 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:09,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1061 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:09,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-03-03 20:06:09,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2025-03-03 20:06:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 549 states have (on average 1.5810564663023678) internal successors, (868), 550 states have internal predecessors, (868), 161 states have call successors, (161), 4 states have call predecessors, (161), 4 states have return successors, (161), 160 states have call predecessors, (161), 161 states have call successors, (161) [2025-03-03 20:06:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1190 transitions. [2025-03-03 20:06:09,550 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1190 transitions. Word has length 643 [2025-03-03 20:06:09,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:09,553 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1190 transitions. [2025-03-03 20:06:09,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1190 transitions. [2025-03-03 20:06:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-03-03 20:06:09,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:09,558 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:09,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:06:09,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:09,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:09,561 INFO L85 PathProgramCache]: Analyzing trace with hash -998938122, now seen corresponding path program 1 times [2025-03-03 20:06:09,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:09,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505134112] [2025-03-03 20:06:09,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:09,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:09,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-03-03 20:06:09,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-03-03 20:06:09,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:09,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:09,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:09,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505134112] [2025-03-03 20:06:09,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505134112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:09,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:09,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:06:09,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899470428] [2025-03-03 20:06:09,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:09,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:06:09,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:09,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:06:09,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:06:09,962 INFO L87 Difference]: Start difference. First operand 715 states and 1190 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:10,082 INFO L93 Difference]: Finished difference Result 1432 states and 2380 transitions. [2025-03-03 20:06:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:06:10,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 644 [2025-03-03 20:06:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:10,091 INFO L225 Difference]: With dead ends: 1432 [2025-03-03 20:06:10,091 INFO L226 Difference]: Without dead ends: 720 [2025-03-03 20:06:10,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:06:10,093 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 296 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:10,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1804 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-03-03 20:06:10,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 543. [2025-03-03 20:06:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 440 states have (on average 1.606818181818182) internal successors, (707), 440 states have internal predecessors, (707), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 20:06:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 905 transitions. [2025-03-03 20:06:10,117 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 905 transitions. Word has length 644 [2025-03-03 20:06:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:10,118 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 905 transitions. [2025-03-03 20:06:10,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 905 transitions. [2025-03-03 20:06:10,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-03-03 20:06:10,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:10,125 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:10,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:06:10,125 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:10,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:10,126 INFO L85 PathProgramCache]: Analyzing trace with hash -939441634, now seen corresponding path program 1 times [2025-03-03 20:06:10,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:10,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138836740] [2025-03-03 20:06:10,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:10,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:10,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-03-03 20:06:10,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-03-03 20:06:10,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:10,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:10,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:10,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138836740] [2025-03-03 20:06:10,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138836740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:10,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:10,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:06:10,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817489090] [2025-03-03 20:06:10,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:10,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:06:10,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:10,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:06:10,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:06:10,513 INFO L87 Difference]: Start difference. First operand 543 states and 905 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:10,788 INFO L93 Difference]: Finished difference Result 1777 states and 2970 transitions. [2025-03-03 20:06:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:06:10,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 645 [2025-03-03 20:06:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:10,795 INFO L225 Difference]: With dead ends: 1777 [2025-03-03 20:06:10,795 INFO L226 Difference]: Without dead ends: 1237 [2025-03-03 20:06:10,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:06:10,797 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 1012 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:10,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1654 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:06:10,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2025-03-03 20:06:10,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1150. [2025-03-03 20:06:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1031 states have (on average 1.6595538312318139) internal successors, (1711), 1032 states have internal predecessors, (1711), 114 states have call successors, (114), 4 states have call predecessors, (114), 4 states have return successors, (114), 113 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-03 20:06:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1939 transitions. [2025-03-03 20:06:10,833 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1939 transitions. Word has length 645 [2025-03-03 20:06:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:10,835 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1939 transitions. [2025-03-03 20:06:10,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:10,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1939 transitions. [2025-03-03 20:06:10,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-03-03 20:06:10,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:10,840 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:10,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:06:10,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:10,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1569900259, now seen corresponding path program 1 times [2025-03-03 20:06:10,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:10,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057836099] [2025-03-03 20:06:10,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:10,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:10,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-03-03 20:06:10,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-03-03 20:06:10,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:10,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:11,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:11,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057836099] [2025-03-03 20:06:11,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057836099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:11,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:11,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:06:11,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456253660] [2025-03-03 20:06:11,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:11,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:06:11,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:11,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:06:11,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:06:11,462 INFO L87 Difference]: Start difference. First operand 1150 states and 1939 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:11,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:11,608 INFO L93 Difference]: Finished difference Result 3456 states and 5835 transitions. [2025-03-03 20:06:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:06:11,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 645 [2025-03-03 20:06:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:11,620 INFO L225 Difference]: With dead ends: 3456 [2025-03-03 20:06:11,620 INFO L226 Difference]: Without dead ends: 2309 [2025-03-03 20:06:11,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:06:11,623 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 346 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:11,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1562 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2025-03-03 20:06:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2307. [2025-03-03 20:06:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2070 states have (on average 1.655072463768116) internal successors, (3426), 2072 states have internal predecessors, (3426), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 226 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-03 20:06:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3882 transitions. [2025-03-03 20:06:11,704 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3882 transitions. Word has length 645 [2025-03-03 20:06:11,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:11,706 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3882 transitions. [2025-03-03 20:06:11,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3882 transitions. [2025-03-03 20:06:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2025-03-03 20:06:11,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:11,712 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:11,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:06:11,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:11,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash 655955434, now seen corresponding path program 1 times [2025-03-03 20:06:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:11,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495705541] [2025-03-03 20:06:11,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:11,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:11,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 646 statements into 1 equivalence classes. [2025-03-03 20:06:11,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 646 of 646 statements. [2025-03-03 20:06:11,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:11,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:12,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:12,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495705541] [2025-03-03 20:06:12,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495705541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:12,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:12,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:06:12,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304496304] [2025-03-03 20:06:12,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:12,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:06:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:12,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:06:12,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:06:12,214 INFO L87 Difference]: Start difference. First operand 2307 states and 3882 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:12,316 INFO L93 Difference]: Finished difference Result 4611 states and 7761 transitions. [2025-03-03 20:06:12,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:12,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 646 [2025-03-03 20:06:12,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:12,328 INFO L225 Difference]: With dead ends: 4611 [2025-03-03 20:06:12,328 INFO L226 Difference]: Without dead ends: 2307 [2025-03-03 20:06:12,332 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-03 20:06:12,334 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 384 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:12,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 525 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:12,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-03 20:06:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-03-03 20:06:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2070 states have (on average 1.6434782608695653) internal successors, (3402), 2072 states have internal predecessors, (3402), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 226 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-03 20:06:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3858 transitions. [2025-03-03 20:06:12,436 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3858 transitions. Word has length 646 [2025-03-03 20:06:12,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:12,437 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3858 transitions. [2025-03-03 20:06:12,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3858 transitions. [2025-03-03 20:06:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2025-03-03 20:06:12,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:12,446 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:12,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:06:12,446 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:12,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1480112132, now seen corresponding path program 1 times [2025-03-03 20:06:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:12,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072795473] [2025-03-03 20:06:12,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:12,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:12,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-03-03 20:06:12,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-03-03 20:06:12,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:12,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:12,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:12,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072795473] [2025-03-03 20:06:12,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072795473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:12,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:12,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:12,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806391418] [2025-03-03 20:06:12,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:12,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:12,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:12,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:12,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:12,820 INFO L87 Difference]: Start difference. First operand 2307 states and 3858 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:12,939 INFO L93 Difference]: Finished difference Result 4611 states and 7713 transitions. [2025-03-03 20:06:12,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:12,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 647 [2025-03-03 20:06:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:12,952 INFO L225 Difference]: With dead ends: 4611 [2025-03-03 20:06:12,952 INFO L226 Difference]: Without dead ends: 2307 [2025-03-03 20:06:12,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:12,956 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 336 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:12,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 525 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:12,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-03 20:06:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-03-03 20:06:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2070 states have (on average 1.6241545893719807) internal successors, (3362), 2072 states have internal predecessors, (3362), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 226 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-03 20:06:13,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3818 transitions. [2025-03-03 20:06:13,037 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3818 transitions. Word has length 647 [2025-03-03 20:06:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:13,038 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3818 transitions. [2025-03-03 20:06:13,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3818 transitions. [2025-03-03 20:06:13,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2025-03-03 20:06:13,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:13,043 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:13,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:06:13,044 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:13,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:13,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1443808417, now seen corresponding path program 1 times [2025-03-03 20:06:13,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:13,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924344273] [2025-03-03 20:06:13,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:13,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:13,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-03-03 20:06:13,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-03-03 20:06:13,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:13,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:13,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:13,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924344273] [2025-03-03 20:06:13,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924344273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:13,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:13,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:06:13,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382478003] [2025-03-03 20:06:13,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:13,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:06:13,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:13,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:06:13,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:06:13,941 INFO L87 Difference]: Start difference. First operand 2307 states and 3818 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-03-03 20:06:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:14,597 INFO L93 Difference]: Finished difference Result 4645 states and 7680 transitions. [2025-03-03 20:06:14,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:06:14,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) Word has length 648 [2025-03-03 20:06:14,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:14,608 INFO L225 Difference]: With dead ends: 4645 [2025-03-03 20:06:14,609 INFO L226 Difference]: Without dead ends: 2341 [2025-03-03 20:06:14,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:06:14,613 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 1235 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:14,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 1139 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:06:14,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2025-03-03 20:06:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 1837. [2025-03-03 20:06:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1600 states have (on average 1.60625) internal successors, (2570), 1602 states have internal predecessors, (2570), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 226 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-03 20:06:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 3026 transitions. [2025-03-03 20:06:14,692 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 3026 transitions. Word has length 648 [2025-03-03 20:06:14,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:14,693 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 3026 transitions. [2025-03-03 20:06:14,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-03-03 20:06:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 3026 transitions. [2025-03-03 20:06:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-03-03 20:06:14,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:14,698 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:14,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:06:14,698 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:14,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1722556977, now seen corresponding path program 1 times [2025-03-03 20:06:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:14,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632302822] [2025-03-03 20:06:14,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:14,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:14,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-03-03 20:06:14,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-03-03 20:06:14,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:14,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:15,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:15,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632302822] [2025-03-03 20:06:15,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632302822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:15,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:15,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:15,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028933955] [2025-03-03 20:06:15,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:15,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:15,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:15,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:15,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:15,052 INFO L87 Difference]: Start difference. First operand 1837 states and 3026 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:15,192 INFO L93 Difference]: Finished difference Result 5409 states and 8904 transitions. [2025-03-03 20:06:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:15,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 649 [2025-03-03 20:06:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:15,207 INFO L225 Difference]: With dead ends: 5409 [2025-03-03 20:06:15,208 INFO L226 Difference]: Without dead ends: 3575 [2025-03-03 20:06:15,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:15,213 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 478 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:15,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1426 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3575 states. [2025-03-03 20:06:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3575 to 2307. [2025-03-03 20:06:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2070 states have (on average 1.6231884057971016) internal successors, (3360), 2072 states have internal predecessors, (3360), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 226 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-03 20:06:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3816 transitions. [2025-03-03 20:06:15,316 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3816 transitions. Word has length 649 [2025-03-03 20:06:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:15,317 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3816 transitions. [2025-03-03 20:06:15,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3816 transitions. [2025-03-03 20:06:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-03-03 20:06:15,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:15,322 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:15,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:06:15,322 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:15,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:15,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1823468944, now seen corresponding path program 1 times [2025-03-03 20:06:15,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:15,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143712296] [2025-03-03 20:06:15,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:15,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:15,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-03-03 20:06:15,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-03-03 20:06:15,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:15,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:16,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:16,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143712296] [2025-03-03 20:06:16,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143712296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:16,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:16,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:06:16,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27371047] [2025-03-03 20:06:16,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:16,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:06:16,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:16,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:06:16,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:06:16,567 INFO L87 Difference]: Start difference. First operand 2307 states and 3816 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-03-03 20:06:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:17,294 INFO L93 Difference]: Finished difference Result 4983 states and 8234 transitions. [2025-03-03 20:06:17,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:06:17,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) Word has length 649 [2025-03-03 20:06:17,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:17,306 INFO L225 Difference]: With dead ends: 4983 [2025-03-03 20:06:17,306 INFO L226 Difference]: Without dead ends: 2679 [2025-03-03 20:06:17,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:06:17,310 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 992 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:17,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 979 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:06:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2025-03-03 20:06:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 1890. [2025-03-03 20:06:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1624 states have (on average 1.5960591133004927) internal successors, (2592), 1627 states have internal predecessors, (2592), 255 states have call successors, (255), 10 states have call predecessors, (255), 10 states have return successors, (255), 252 states have call predecessors, (255), 255 states have call successors, (255) [2025-03-03 20:06:17,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 3102 transitions. [2025-03-03 20:06:17,434 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 3102 transitions. Word has length 649 [2025-03-03 20:06:17,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:17,436 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 3102 transitions. [2025-03-03 20:06:17,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-03-03 20:06:17,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 3102 transitions. [2025-03-03 20:06:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-03-03 20:06:17,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:17,446 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:17,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:06:17,447 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:17,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:17,447 INFO L85 PathProgramCache]: Analyzing trace with hash -919555450, now seen corresponding path program 1 times [2025-03-03 20:06:17,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:17,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586175391] [2025-03-03 20:06:17,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:17,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:17,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-03-03 20:06:17,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-03-03 20:06:17,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:17,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:18,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:18,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586175391] [2025-03-03 20:06:18,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586175391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:18,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:18,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:06:18,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941545372] [2025-03-03 20:06:18,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:18,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:06:18,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:18,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:06:18,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:06:18,164 INFO L87 Difference]: Start difference. First operand 1890 states and 3102 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-03-03 20:06:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:18,450 INFO L93 Difference]: Finished difference Result 5558 states and 9144 transitions. [2025-03-03 20:06:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:18,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) Word has length 649 [2025-03-03 20:06:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:18,465 INFO L225 Difference]: With dead ends: 5558 [2025-03-03 20:06:18,466 INFO L226 Difference]: Without dead ends: 3724 [2025-03-03 20:06:18,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:06:18,471 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 682 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:18,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1063 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:06:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2025-03-03 20:06:18,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3722. [2025-03-03 20:06:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3722 states, 3220 states have (on average 1.5987577639751553) internal successors, (5148), 3225 states have internal predecessors, (5148), 483 states have call successors, (483), 18 states have call predecessors, (483), 18 states have return successors, (483), 478 states have call predecessors, (483), 483 states have call successors, (483) [2025-03-03 20:06:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 6114 transitions. [2025-03-03 20:06:18,621 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 6114 transitions. Word has length 649 [2025-03-03 20:06:18,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:18,622 INFO L471 AbstractCegarLoop]: Abstraction has 3722 states and 6114 transitions. [2025-03-03 20:06:18,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-03-03 20:06:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 6114 transitions. [2025-03-03 20:06:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-03 20:06:18,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:18,627 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:18,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:06:18,628 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:18,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:18,628 INFO L85 PathProgramCache]: Analyzing trace with hash -820930091, now seen corresponding path program 1 times [2025-03-03 20:06:18,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:18,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053514139] [2025-03-03 20:06:18,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:18,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:18,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-03 20:06:18,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-03 20:06:18,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:18,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:19,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:19,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053514139] [2025-03-03 20:06:19,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053514139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:19,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:19,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:06:19,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900014976] [2025-03-03 20:06:19,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:19,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:06:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:19,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:06:19,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:06:19,546 INFO L87 Difference]: Start difference. First operand 3722 states and 6114 transitions. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:21,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:21,146 INFO L93 Difference]: Finished difference Result 17844 states and 29303 transitions. [2025-03-03 20:06:21,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:06:21,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 650 [2025-03-03 20:06:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:21,190 INFO L225 Difference]: With dead ends: 17844 [2025-03-03 20:06:21,190 INFO L226 Difference]: Without dead ends: 14178 [2025-03-03 20:06:21,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:06:21,202 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 1374 mSDsluCounter, 2893 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 3669 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:21,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 3669 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 20:06:21,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14178 states. [2025-03-03 20:06:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14178 to 8194. [2025-03-03 20:06:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8194 states, 7488 states have (on average 1.607905982905983) internal successors, (12040), 7501 states have internal predecessors, (12040), 675 states have call successors, (675), 30 states have call predecessors, (675), 30 states have return successors, (675), 662 states have call predecessors, (675), 675 states have call successors, (675) [2025-03-03 20:06:21,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8194 states to 8194 states and 13390 transitions. [2025-03-03 20:06:21,549 INFO L78 Accepts]: Start accepts. Automaton has 8194 states and 13390 transitions. Word has length 650 [2025-03-03 20:06:21,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:21,550 INFO L471 AbstractCegarLoop]: Abstraction has 8194 states and 13390 transitions. [2025-03-03 20:06:21,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:21,550 INFO L276 IsEmpty]: Start isEmpty. Operand 8194 states and 13390 transitions. [2025-03-03 20:06:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-03 20:06:21,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:21,560 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:21,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 20:06:21,561 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:21,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:21,562 INFO L85 PathProgramCache]: Analyzing trace with hash 345766228, now seen corresponding path program 1 times [2025-03-03 20:06:21,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:21,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94405995] [2025-03-03 20:06:21,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:21,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-03 20:06:21,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-03 20:06:21,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:21,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:22,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:22,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94405995] [2025-03-03 20:06:22,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94405995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:22,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:22,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:06:22,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603375813] [2025-03-03 20:06:22,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:22,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:06:22,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:22,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:06:22,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:06:22,245 INFO L87 Difference]: Start difference. First operand 8194 states and 13390 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-03-03 20:06:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:23,641 INFO L93 Difference]: Finished difference Result 27062 states and 44220 transitions. [2025-03-03 20:06:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:06:23,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) Word has length 650 [2025-03-03 20:06:23,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:23,695 INFO L225 Difference]: With dead ends: 27062 [2025-03-03 20:06:23,695 INFO L226 Difference]: Without dead ends: 22992 [2025-03-03 20:06:23,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:06:23,710 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 955 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 3119 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:23,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 3119 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:06:23,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22992 states. [2025-03-03 20:06:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22992 to 22965. [2025-03-03 20:06:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22965 states, 21107 states have (on average 1.6079499692045294) internal successors, (33939), 21148 states have internal predecessors, (33939), 1773 states have call successors, (1773), 84 states have call predecessors, (1773), 84 states have return successors, (1773), 1732 states have call predecessors, (1773), 1773 states have call successors, (1773) [2025-03-03 20:06:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22965 states to 22965 states and 37485 transitions. [2025-03-03 20:06:24,501 INFO L78 Accepts]: Start accepts. Automaton has 22965 states and 37485 transitions. Word has length 650 [2025-03-03 20:06:24,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:24,502 INFO L471 AbstractCegarLoop]: Abstraction has 22965 states and 37485 transitions. [2025-03-03 20:06:24,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-03-03 20:06:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 22965 states and 37485 transitions. [2025-03-03 20:06:24,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-03 20:06:24,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:24,529 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:24,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 20:06:24,529 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:24,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1718863197, now seen corresponding path program 1 times [2025-03-03 20:06:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:24,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432932972] [2025-03-03 20:06:24,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:24,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-03 20:06:24,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-03 20:06:24,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:24,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 189 proven. 105 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-03-03 20:06:25,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:25,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432932972] [2025-03-03 20:06:25,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432932972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:06:25,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209602518] [2025-03-03 20:06:25,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:25,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:06:25,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:06:25,165 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:06:25,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:06:25,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-03 20:06:25,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-03 20:06:25,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:25,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:25,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 1468 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:06:25,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:06:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 9044 proven. 105 refuted. 0 times theorem prover too weak. 10255 trivial. 0 not checked. [2025-03-03 20:06:25,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:06:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 189 proven. 105 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-03-03 20:06:26,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209602518] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:06:26,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:06:26,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 20:06:26,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856319939] [2025-03-03 20:06:26,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:06:26,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:06:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:26,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:06:26,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:06:26,258 INFO L87 Difference]: Start difference. First operand 22965 states and 37485 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 2 states have call successors, (134), 2 states have call predecessors, (134), 4 states have return successors, (135), 2 states have call predecessors, (135), 2 states have call successors, (135) [2025-03-03 20:06:27,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:27,193 INFO L93 Difference]: Finished difference Result 40175 states and 65590 transitions. [2025-03-03 20:06:27,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:06:27,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 2 states have call successors, (134), 2 states have call predecessors, (134), 4 states have return successors, (135), 2 states have call predecessors, (135), 2 states have call successors, (135) Word has length 650 [2025-03-03 20:06:27,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:27,246 INFO L225 Difference]: With dead ends: 40175 [2025-03-03 20:06:27,247 INFO L226 Difference]: Without dead ends: 17301 [2025-03-03 20:06:27,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1307 GetRequests, 1297 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:06:27,277 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 345 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:27,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1053 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:06:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17301 states. [2025-03-03 20:06:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17301 to 17117. [2025-03-03 20:06:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17117 states, 15251 states have (on average 1.5943216838240115) internal successors, (24315), 15292 states have internal predecessors, (24315), 1773 states have call successors, (1773), 92 states have call predecessors, (1773), 92 states have return successors, (1773), 1732 states have call predecessors, (1773), 1773 states have call successors, (1773) [2025-03-03 20:06:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17117 states to 17117 states and 27861 transitions. [2025-03-03 20:06:28,089 INFO L78 Accepts]: Start accepts. Automaton has 17117 states and 27861 transitions. Word has length 650 [2025-03-03 20:06:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:28,097 INFO L471 AbstractCegarLoop]: Abstraction has 17117 states and 27861 transitions. [2025-03-03 20:06:28,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 2 states have call successors, (134), 2 states have call predecessors, (134), 4 states have return successors, (135), 2 states have call predecessors, (135), 2 states have call successors, (135) [2025-03-03 20:06:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 17117 states and 27861 transitions. [2025-03-03 20:06:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-03 20:06:28,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:28,132 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:28,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 20:06:28,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 20:06:28,334 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:28,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:28,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1733342418, now seen corresponding path program 1 times [2025-03-03 20:06:28,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:28,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154561473] [2025-03-03 20:06:28,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:28,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:28,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-03 20:06:28,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-03 20:06:28,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:28,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:28,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:28,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154561473] [2025-03-03 20:06:28,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154561473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:28,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:28,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:28,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083656204] [2025-03-03 20:06:28,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:28,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:28,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:28,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:28,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:28,588 INFO L87 Difference]: Start difference. First operand 17117 states and 27861 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:29,168 INFO L93 Difference]: Finished difference Result 34161 states and 55623 transitions. [2025-03-03 20:06:29,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:29,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 650 [2025-03-03 20:06:29,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:29,218 INFO L225 Difference]: With dead ends: 34161 [2025-03-03 20:06:29,218 INFO L226 Difference]: Without dead ends: 17135 [2025-03-03 20:06:29,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:29,239 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 314 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:29,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1092 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17135 states. [2025-03-03 20:06:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17135 to 17117. [2025-03-03 20:06:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17117 states, 15251 states have (on average 1.5911743492230017) internal successors, (24267), 15292 states have internal predecessors, (24267), 1773 states have call successors, (1773), 92 states have call predecessors, (1773), 92 states have return successors, (1773), 1732 states have call predecessors, (1773), 1773 states have call successors, (1773) [2025-03-03 20:06:30,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17117 states to 17117 states and 27813 transitions. [2025-03-03 20:06:30,139 INFO L78 Accepts]: Start accepts. Automaton has 17117 states and 27813 transitions. Word has length 650 [2025-03-03 20:06:30,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:30,141 INFO L471 AbstractCegarLoop]: Abstraction has 17117 states and 27813 transitions. [2025-03-03 20:06:30,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:30,141 INFO L276 IsEmpty]: Start isEmpty. Operand 17117 states and 27813 transitions. [2025-03-03 20:06:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-03-03 20:06:30,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:30,215 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:30,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 20:06:30,215 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:30,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:30,216 INFO L85 PathProgramCache]: Analyzing trace with hash -421685755, now seen corresponding path program 1 times [2025-03-03 20:06:30,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:30,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343280162] [2025-03-03 20:06:30,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:30,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:30,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-03 20:06:30,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-03 20:06:30,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:30,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:30,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:30,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343280162] [2025-03-03 20:06:30,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343280162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:30,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:30,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:30,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850432917] [2025-03-03 20:06:30,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:30,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:30,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:30,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:30,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:30,421 INFO L87 Difference]: Start difference. First operand 17117 states and 27813 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:30,891 INFO L93 Difference]: Finished difference Result 25671 states and 41758 transitions. [2025-03-03 20:06:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:30,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 651 [2025-03-03 20:06:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:30,941 INFO L225 Difference]: With dead ends: 25671 [2025-03-03 20:06:30,941 INFO L226 Difference]: Without dead ends: 17149 [2025-03-03 20:06:30,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:30,959 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 0 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:30,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1040 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:30,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17149 states. [2025-03-03 20:06:31,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17149 to 17149. [2025-03-03 20:06:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17149 states, 15283 states have (on average 1.5899365307858404) internal successors, (24299), 15324 states have internal predecessors, (24299), 1773 states have call successors, (1773), 92 states have call predecessors, (1773), 92 states have return successors, (1773), 1732 states have call predecessors, (1773), 1773 states have call successors, (1773) [2025-03-03 20:06:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17149 states to 17149 states and 27845 transitions. [2025-03-03 20:06:31,589 INFO L78 Accepts]: Start accepts. Automaton has 17149 states and 27845 transitions. Word has length 651 [2025-03-03 20:06:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:31,590 INFO L471 AbstractCegarLoop]: Abstraction has 17149 states and 27845 transitions. [2025-03-03 20:06:31,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 17149 states and 27845 transitions. [2025-03-03 20:06:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-03-03 20:06:31,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:31,603 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:31,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 20:06:31,603 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:31,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:31,604 INFO L85 PathProgramCache]: Analyzing trace with hash 987226069, now seen corresponding path program 1 times [2025-03-03 20:06:31,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:31,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980488887] [2025-03-03 20:06:31,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:31,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:31,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-03 20:06:31,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-03 20:06:31,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:31,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980488887] [2025-03-03 20:06:31,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980488887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:31,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:31,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:31,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487202222] [2025-03-03 20:06:31,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:31,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:31,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:31,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:31,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:31,829 INFO L87 Difference]: Start difference. First operand 17149 states and 27845 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:32,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:32,945 INFO L93 Difference]: Finished difference Result 51265 states and 83271 transitions. [2025-03-03 20:06:32,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:32,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 651 [2025-03-03 20:06:32,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:33,040 INFO L225 Difference]: With dead ends: 51265 [2025-03-03 20:06:33,040 INFO L226 Difference]: Without dead ends: 34207 [2025-03-03 20:06:33,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:33,073 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 314 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:33,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1065 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34207 states. [2025-03-03 20:06:34,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34207 to 34205. [2025-03-03 20:06:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34205 states, 30523 states have (on average 1.587622448645284) internal successors, (48459), 30604 states have internal predecessors, (48459), 3501 states have call successors, (3501), 180 states have call predecessors, (3501), 180 states have return successors, (3501), 3420 states have call predecessors, (3501), 3501 states have call successors, (3501) [2025-03-03 20:06:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34205 states to 34205 states and 55461 transitions. [2025-03-03 20:06:34,694 INFO L78 Accepts]: Start accepts. Automaton has 34205 states and 55461 transitions. Word has length 651 [2025-03-03 20:06:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:34,695 INFO L471 AbstractCegarLoop]: Abstraction has 34205 states and 55461 transitions. [2025-03-03 20:06:34,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 34205 states and 55461 transitions. [2025-03-03 20:06:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2025-03-03 20:06:34,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:34,713 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:34,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 20:06:34,713 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:34,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:34,714 INFO L85 PathProgramCache]: Analyzing trace with hash -591503947, now seen corresponding path program 1 times [2025-03-03 20:06:34,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:34,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48776132] [2025-03-03 20:06:34,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:34,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:34,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 652 statements into 1 equivalence classes. [2025-03-03 20:06:34,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 652 of 652 statements. [2025-03-03 20:06:34,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:34,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48776132] [2025-03-03 20:06:34,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48776132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:34,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:34,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733275435] [2025-03-03 20:06:34,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:34,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:34,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:34,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:34,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:34,981 INFO L87 Difference]: Start difference. First operand 34205 states and 55461 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:36,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:36,015 INFO L93 Difference]: Finished difference Result 68337 states and 110823 transitions. [2025-03-03 20:06:36,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:36,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 652 [2025-03-03 20:06:36,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:36,091 INFO L225 Difference]: With dead ends: 68337 [2025-03-03 20:06:36,092 INFO L226 Difference]: Without dead ends: 34223 [2025-03-03 20:06:36,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:36,140 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 309 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:36,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1056 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34223 states. [2025-03-03 20:06:37,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34223 to 34205. [2025-03-03 20:06:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34205 states, 30523 states have (on average 1.5860498640369558) internal successors, (48411), 30604 states have internal predecessors, (48411), 3501 states have call successors, (3501), 180 states have call predecessors, (3501), 180 states have return successors, (3501), 3420 states have call predecessors, (3501), 3501 states have call successors, (3501) [2025-03-03 20:06:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34205 states to 34205 states and 55413 transitions. [2025-03-03 20:06:37,448 INFO L78 Accepts]: Start accepts. Automaton has 34205 states and 55413 transitions. Word has length 652 [2025-03-03 20:06:37,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:37,448 INFO L471 AbstractCegarLoop]: Abstraction has 34205 states and 55413 transitions. [2025-03-03 20:06:37,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:37,449 INFO L276 IsEmpty]: Start isEmpty. Operand 34205 states and 55413 transitions. [2025-03-03 20:06:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-03-03 20:06:37,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:37,470 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:37,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 20:06:37,470 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:37,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:37,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1217857409, now seen corresponding path program 1 times [2025-03-03 20:06:37,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:37,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689998546] [2025-03-03 20:06:37,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:37,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:37,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-03-03 20:06:37,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-03-03 20:06:37,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:37,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:38,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:38,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689998546] [2025-03-03 20:06:38,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689998546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:38,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:38,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:06:38,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037646449] [2025-03-03 20:06:38,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:38,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:06:38,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:38,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:06:38,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:06:38,309 INFO L87 Difference]: Start difference. First operand 34205 states and 55413 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:41,651 INFO L93 Difference]: Finished difference Result 85571 states and 138480 transitions. [2025-03-03 20:06:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:06:41,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 653 [2025-03-03 20:06:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:41,782 INFO L225 Difference]: With dead ends: 85571 [2025-03-03 20:06:41,782 INFO L226 Difference]: Without dead ends: 51457 [2025-03-03 20:06:41,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:06:41,846 INFO L435 NwaCegarLoop]: 932 mSDtfsCounter, 969 mSDsluCounter, 2856 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 3788 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:41,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 3788 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:06:41,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51457 states. [2025-03-03 20:06:43,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51457 to 48893. [2025-03-03 20:06:43,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48893 states, 44131 states have (on average 1.588248623416646) internal successors, (70091), 44260 states have internal predecessors, (70091), 4509 states have call successors, (4509), 252 states have call predecessors, (4509), 252 states have return successors, (4509), 4380 states have call predecessors, (4509), 4509 states have call successors, (4509) [2025-03-03 20:06:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48893 states to 48893 states and 79109 transitions. [2025-03-03 20:06:43,869 INFO L78 Accepts]: Start accepts. Automaton has 48893 states and 79109 transitions. Word has length 653 [2025-03-03 20:06:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:43,870 INFO L471 AbstractCegarLoop]: Abstraction has 48893 states and 79109 transitions. [2025-03-03 20:06:43,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 48893 states and 79109 transitions. [2025-03-03 20:06:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-03-03 20:06:43,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:43,894 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:43,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 20:06:43,894 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:43,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:43,895 INFO L85 PathProgramCache]: Analyzing trace with hash -350805184, now seen corresponding path program 1 times [2025-03-03 20:06:43,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:43,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146033554] [2025-03-03 20:06:43,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:43,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:43,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-03-03 20:06:44,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-03-03 20:06:44,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:44,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:44,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:44,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146033554] [2025-03-03 20:06:44,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146033554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:44,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:44,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:06:44,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317585560] [2025-03-03 20:06:44,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:44,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:06:44,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:44,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:06:44,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:06:44,380 INFO L87 Difference]: Start difference. First operand 48893 states and 79109 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:47,308 INFO L93 Difference]: Finished difference Result 163059 states and 260856 transitions. [2025-03-03 20:06:47,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:06:47,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 653 [2025-03-03 20:06:47,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:47,561 INFO L225 Difference]: With dead ends: 163059 [2025-03-03 20:06:47,561 INFO L226 Difference]: Without dead ends: 103241 [2025-03-03 20:06:47,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:06:47,656 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 593 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:47,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1573 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:06:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103241 states. [2025-03-03 20:06:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103241 to 58253. [2025-03-03 20:06:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58253 states, 53491 states have (on average 1.576844702847208) internal successors, (84347), 53620 states have internal predecessors, (84347), 4509 states have call successors, (4509), 252 states have call predecessors, (4509), 252 states have return successors, (4509), 4380 states have call predecessors, (4509), 4509 states have call successors, (4509) [2025-03-03 20:06:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58253 states to 58253 states and 93365 transitions. [2025-03-03 20:06:50,781 INFO L78 Accepts]: Start accepts. Automaton has 58253 states and 93365 transitions. Word has length 653 [2025-03-03 20:06:50,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:50,781 INFO L471 AbstractCegarLoop]: Abstraction has 58253 states and 93365 transitions. [2025-03-03 20:06:50,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 58253 states and 93365 transitions. [2025-03-03 20:06:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-03-03 20:06:50,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:50,811 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:50,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 20:06:50,811 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:50,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash -824108798, now seen corresponding path program 1 times [2025-03-03 20:06:50,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:50,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477161704] [2025-03-03 20:06:50,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:50,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:50,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-03-03 20:06:50,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-03-03 20:06:50,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:50,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:50,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:50,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477161704] [2025-03-03 20:06:50,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477161704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:50,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:50,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:50,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912477205] [2025-03-03 20:06:50,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:50,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:50,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:50,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:50,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:50,951 INFO L87 Difference]: Start difference. First operand 58253 states and 93365 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:54,577 INFO L93 Difference]: Finished difference Result 158737 states and 254199 transitions. [2025-03-03 20:06:54,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:54,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 653 [2025-03-03 20:06:54,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:54,785 INFO L225 Difference]: With dead ends: 158737 [2025-03-03 20:06:54,785 INFO L226 Difference]: Without dead ends: 100575 [2025-03-03 20:06:54,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:54,848 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 476 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:54,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1031 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100575 states. [2025-03-03 20:06:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100575 to 74549. [2025-03-03 20:06:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74549 states, 69787 states have (on average 1.5724848467479617) internal successors, (109739), 69916 states have internal predecessors, (109739), 4509 states have call successors, (4509), 252 states have call predecessors, (4509), 252 states have return successors, (4509), 4380 states have call predecessors, (4509), 4509 states have call successors, (4509) [2025-03-03 20:06:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74549 states to 74549 states and 118757 transitions. [2025-03-03 20:06:57,889 INFO L78 Accepts]: Start accepts. Automaton has 74549 states and 118757 transitions. Word has length 653 [2025-03-03 20:06:57,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:57,890 INFO L471 AbstractCegarLoop]: Abstraction has 74549 states and 118757 transitions. [2025-03-03 20:06:57,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:06:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 74549 states and 118757 transitions. [2025-03-03 20:06:57,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-03-03 20:06:57,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:57,931 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:57,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 20:06:57,932 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:57,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:57,933 INFO L85 PathProgramCache]: Analyzing trace with hash 844382691, now seen corresponding path program 1 times [2025-03-03 20:06:57,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:57,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280665582] [2025-03-03 20:06:57,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:57,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:57,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-03-03 20:06:58,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-03-03 20:06:58,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:58,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:06:58,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:58,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280665582] [2025-03-03 20:06:58,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280665582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:58,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:58,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 20:06:58,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787699467] [2025-03-03 20:06:58,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:58,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 20:06:58,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:58,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 20:06:58,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:06:58,988 INFO L87 Difference]: Start difference. First operand 74549 states and 118757 transitions. Second operand has 12 states, 12 states have (on average 13.416666666666666) internal successors, (161), 12 states have internal predecessors, (161), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99)