./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-33.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 9f8ffce10679cb0f0915b9100941533aa878d3327a8e4914196d12bd2837e821 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:31:49,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:31:49,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:31:49,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:31:49,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:31:49,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:31:49,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:31:49,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:31:49,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:31:49,731 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:31:49,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:31:49,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:31:49,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:31:49,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:31:49,732 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:31:49,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:31:49,733 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:31:49,733 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:31:49,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:31:49,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:31:49,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:31:49,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:31:49,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:31:49,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:31:49,733 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:31:49,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:31:49,734 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:31:49,734 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:31:49,734 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:31:49,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:31:49,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:31:49,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:31:49,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:31:49,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:31:49,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:31:49,735 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:31:49,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:31:49,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:31:49,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:31:49,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:31:49,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:31:49,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:31:49,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:31:49,735 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 -> 9f8ffce10679cb0f0915b9100941533aa878d3327a8e4914196d12bd2837e821 [2025-03-04 00:31:49,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:31:49,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:31:49,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:31:49,980 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:31:49,980 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:31:49,981 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-33.i [2025-03-04 00:31:51,101 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e15b93417/6d76c074118a43a58a3d6f0eb6730b92/FLAG0287323a1 [2025-03-04 00:31:51,436 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:31:51,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-33.i [2025-03-04 00:31:51,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e15b93417/6d76c074118a43a58a3d6f0eb6730b92/FLAG0287323a1 [2025-03-04 00:31:51,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e15b93417/6d76c074118a43a58a3d6f0eb6730b92 [2025-03-04 00:31:51,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:31:51,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:31:51,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:31:51,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:31:51,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:31:51,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:31:51" (1/1) ... [2025-03-04 00:31:51,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:51, skipping insertion in model container [2025-03-04 00:31:51,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:31:51" (1/1) ... [2025-03-04 00:31:51,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:31:51,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-33.i[916,929] [2025-03-04 00:31:51,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:31:51,808 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:31:51,815 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-33.i[916,929] [2025-03-04 00:31:51,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:31:51,913 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:31:51,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:51 WrapperNode [2025-03-04 00:31:51,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:31:51,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:31:51,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:31:51,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:31:51,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:51" (1/1) ... [2025-03-04 00:31:51,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:51" (1/1) ... [2025-03-04 00:31:52,015 INFO L138 Inliner]: procedures = 26, calls = 109, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 859 [2025-03-04 00:31:52,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:31:52,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:31:52,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:31:52,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:31:52,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:51" (1/1) ... [2025-03-04 00:31:52,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:51" (1/1) ... [2025-03-04 00:31:52,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:51" (1/1) ... [2025-03-04 00:31:52,118 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:31:52,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:51" (1/1) ... [2025-03-04 00:31:52,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:51" (1/1) ... [2025-03-04 00:31:52,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:51" (1/1) ... [2025-03-04 00:31:52,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:51" (1/1) ... [2025-03-04 00:31:52,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:51" (1/1) ... [2025-03-04 00:31:52,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:51" (1/1) ... [2025-03-04 00:31:52,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:31:52,172 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:31:52,173 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:31:52,173 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:31:52,174 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:51" (1/1) ... [2025-03-04 00:31:52,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:31:52,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:52,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:31:52,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:31:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:31:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:31:52,215 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:31:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:31:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:31:52,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:31:52,331 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:31:52,333 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:31:53,213 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: havoc property_#t~bitwise62#1;havoc property_#t~bitwise63#1;havoc property_#t~short64#1;havoc property_#t~ite66#1;havoc property_#t~bitwise65#1;havoc property_#t~short67#1;havoc property_#t~bitwise68#1;havoc property_#t~short69#1;havoc property_#t~ite73#1;havoc property_#t~ite72#1;havoc property_#t~ite71#1;havoc property_#t~bitwise70#1;havoc property_#t~short74#1;havoc property_#t~ite77#1;havoc property_#t~ite76#1;havoc property_#t~bitwise75#1;havoc property_#t~short78#1; [2025-03-04 00:31:53,391 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-04 00:31:53,391 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:31:53,424 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:31:53,426 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:31:53,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:31:53 BoogieIcfgContainer [2025-03-04 00:31:53,426 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:31:53,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:31:53,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:31:53,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:31:53,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:31:51" (1/3) ... [2025-03-04 00:31:53,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d81f7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:31:53, skipping insertion in model container [2025-03-04 00:31:53,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:51" (2/3) ... [2025-03-04 00:31:53,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d81f7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:31:53, skipping insertion in model container [2025-03-04 00:31:53,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:31:53" (3/3) ... [2025-03-04 00:31:53,433 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-33.i [2025-03-04 00:31:53,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:31:53,445 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-33.i that has 2 procedures, 350 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:31:53,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:31:53,505 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;@9d4efa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:31:53,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:31:53,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 350 states, 251 states have (on average 1.545816733067729) internal successors, (388), 252 states have internal predecessors, (388), 96 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 00:31:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2025-03-04 00:31:53,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:53,535 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:53,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:53,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:53,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1347045419, now seen corresponding path program 1 times [2025-03-04 00:31:53,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:53,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916825218] [2025-03-04 00:31:53,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:53,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:53,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes. [2025-03-04 00:31:53,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements. [2025-03-04 00:31:53,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:53,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 18050 trivial. 0 not checked. [2025-03-04 00:31:54,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:54,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916825218] [2025-03-04 00:31:54,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916825218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:54,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611193257] [2025-03-04 00:31:54,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:54,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:54,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:54,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:31:54,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:31:54,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes. [2025-03-04 00:31:54,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements. [2025-03-04 00:31:54,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:54,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:54,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 1502 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:31:54,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 18050 trivial. 0 not checked. [2025-03-04 00:31:54,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:31:54,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611193257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:54,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:31:54,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:31:54,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462563938] [2025-03-04 00:31:54,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:54,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:31:54,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:54,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:31:54,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:31:54,642 INFO L87 Difference]: Start difference. First operand has 350 states, 251 states have (on average 1.545816733067729) internal successors, (388), 252 states have internal predecessors, (388), 96 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) Second operand has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (96), 2 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 2 states have call successors, (96) [2025-03-04 00:31:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:54,713 INFO L93 Difference]: Finished difference Result 694 states and 1251 transitions. [2025-03-04 00:31:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:31:54,715 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (96), 2 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 2 states have call successors, (96) Word has length 629 [2025-03-04 00:31:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:54,723 INFO L225 Difference]: With dead ends: 694 [2025-03-04 00:31:54,724 INFO L226 Difference]: Without dead ends: 347 [2025-03-04 00:31:54,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:31:54,733 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:54,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 561 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:31:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-04 00:31:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2025-03-04 00:31:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 249 states have (on average 1.5301204819277108) internal successors, (381), 249 states have internal predecessors, (381), 96 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 00:31:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 573 transitions. [2025-03-04 00:31:54,802 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 573 transitions. Word has length 629 [2025-03-04 00:31:54,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:54,803 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 573 transitions. [2025-03-04 00:31:54,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (96), 2 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 2 states have call successors, (96) [2025-03-04 00:31:54,803 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 573 transitions. [2025-03-04 00:31:54,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2025-03-04 00:31:54,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:54,815 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:54,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:31:55,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:31:55,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:55,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash 54139917, now seen corresponding path program 1 times [2025-03-04 00:31:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:55,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018068097] [2025-03-04 00:31:55,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:55,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:55,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes. [2025-03-04 00:31:55,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements. [2025-03-04 00:31:55,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:55,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:55,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:31:55,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:55,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018068097] [2025-03-04 00:31:55,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018068097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:55,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:55,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:31:55,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119565925] [2025-03-04 00:31:55,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:55,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:55,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:55,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:55,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:55,650 INFO L87 Difference]: Start difference. First operand 347 states and 573 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:31:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:55,844 INFO L93 Difference]: Finished difference Result 1034 states and 1711 transitions. [2025-03-04 00:31:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:55,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 629 [2025-03-04 00:31:55,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:55,853 INFO L225 Difference]: With dead ends: 1034 [2025-03-04 00:31:55,854 INFO L226 Difference]: Without dead ends: 690 [2025-03-04 00:31:55,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:55,856 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 556 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:55,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1081 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-04 00:31:55,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2025-03-04 00:31:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 493 states have (on average 1.5172413793103448) internal successors, (748), 493 states have internal predecessors, (748), 192 states have call successors, (192), 2 states have call predecessors, (192), 2 states have return successors, (192), 192 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-04 00:31:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1132 transitions. [2025-03-04 00:31:55,934 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1132 transitions. Word has length 629 [2025-03-04 00:31:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:55,935 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1132 transitions. [2025-03-04 00:31:55,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:31:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1132 transitions. [2025-03-04 00:31:55,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2025-03-04 00:31:55,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:55,943 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:55,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:31:55,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:55,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:55,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1009661196, now seen corresponding path program 1 times [2025-03-04 00:31:55,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:55,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066866220] [2025-03-04 00:31:55,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:55,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:55,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes. [2025-03-04 00:31:56,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements. [2025-03-04 00:31:56,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:56,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:56,503 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:31:56,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:56,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066866220] [2025-03-04 00:31:56,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066866220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:56,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:56,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:31:56,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675945005] [2025-03-04 00:31:56,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:56,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:56,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:56,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:56,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:56,509 INFO L87 Difference]: Start difference. First operand 688 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:31:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:56,716 INFO L93 Difference]: Finished difference Result 1834 states and 3016 transitions. [2025-03-04 00:31:56,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:56,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 629 [2025-03-04 00:31:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:56,730 INFO L225 Difference]: With dead ends: 1834 [2025-03-04 00:31:56,731 INFO L226 Difference]: Without dead ends: 1149 [2025-03-04 00:31:56,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:56,734 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 359 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:56,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1390 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:31:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2025-03-04 00:31:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1145. [2025-03-04 00:31:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 894 states have (on average 1.5480984340044743) internal successors, (1384), 896 states have internal predecessors, (1384), 246 states have call successors, (246), 4 states have call predecessors, (246), 4 states have return successors, (246), 244 states have call predecessors, (246), 246 states have call successors, (246) [2025-03-04 00:31:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1876 transitions. [2025-03-04 00:31:56,876 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1876 transitions. Word has length 629 [2025-03-04 00:31:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:56,879 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1876 transitions. [2025-03-04 00:31:56,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:31:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1876 transitions. [2025-03-04 00:31:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2025-03-04 00:31:56,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:56,892 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:56,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:31:56,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:56,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:56,893 INFO L85 PathProgramCache]: Analyzing trace with hash 126982790, now seen corresponding path program 1 times [2025-03-04 00:31:56,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:56,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687147507] [2025-03-04 00:31:56,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:56,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:56,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-03-04 00:31:56,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-03-04 00:31:56,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:56,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:31:57,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:57,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687147507] [2025-03-04 00:31:57,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687147507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:57,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:57,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:31:57,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472656796] [2025-03-04 00:31:57,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:57,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:57,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:57,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:57,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:57,204 INFO L87 Difference]: Start difference. First operand 1145 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:31:57,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:57,361 INFO L93 Difference]: Finished difference Result 3417 states and 5600 transitions. [2025-03-04 00:31:57,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:57,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 630 [2025-03-04 00:31:57,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:57,376 INFO L225 Difference]: With dead ends: 3417 [2025-03-04 00:31:57,376 INFO L226 Difference]: Without dead ends: 2275 [2025-03-04 00:31:57,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:57,381 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 544 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:57,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1084 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:57,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2025-03-04 00:31:57,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2265. [2025-03-04 00:31:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 1764 states have (on average 1.5317460317460319) internal successors, (2702), 1768 states have internal predecessors, (2702), 492 states have call successors, (492), 8 states have call predecessors, (492), 8 states have return successors, (492), 488 states have call predecessors, (492), 492 states have call successors, (492) [2025-03-04 00:31:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3686 transitions. [2025-03-04 00:31:57,517 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3686 transitions. Word has length 630 [2025-03-04 00:31:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:57,518 INFO L471 AbstractCegarLoop]: Abstraction has 2265 states and 3686 transitions. [2025-03-04 00:31:57,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:31:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3686 transitions. [2025-03-04 00:31:57,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-03-04 00:31:57,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:57,524 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:57,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:31:57,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:57,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:57,525 INFO L85 PathProgramCache]: Analyzing trace with hash -441017740, now seen corresponding path program 1 times [2025-03-04 00:31:57,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:57,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914939617] [2025-03-04 00:31:57,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:57,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:57,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-03-04 00:31:57,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-03-04 00:31:57,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:57,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:31:57,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:57,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914939617] [2025-03-04 00:31:57,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914939617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:57,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:57,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:31:57,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566780277] [2025-03-04 00:31:57,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:57,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:57,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:57,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:57,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:57,831 INFO L87 Difference]: Start difference. First operand 2265 states and 3686 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:31:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:58,025 INFO L93 Difference]: Finished difference Result 6311 states and 10232 transitions. [2025-03-04 00:31:58,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:58,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 631 [2025-03-04 00:31:58,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:58,046 INFO L225 Difference]: With dead ends: 6311 [2025-03-04 00:31:58,047 INFO L226 Difference]: Without dead ends: 4049 [2025-03-04 00:31:58,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:58,055 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 420 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:58,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1302 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:58,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4049 states. [2025-03-04 00:31:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4049 to 4043. [2025-03-04 00:31:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4043 states, 3186 states have (on average 1.5204017576898934) internal successors, (4844), 3198 states have internal predecessors, (4844), 840 states have call successors, (840), 16 states have call predecessors, (840), 16 states have return successors, (840), 828 states have call predecessors, (840), 840 states have call successors, (840) [2025-03-04 00:31:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4043 states to 4043 states and 6524 transitions. [2025-03-04 00:31:58,338 INFO L78 Accepts]: Start accepts. Automaton has 4043 states and 6524 transitions. Word has length 631 [2025-03-04 00:31:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:58,339 INFO L471 AbstractCegarLoop]: Abstraction has 4043 states and 6524 transitions. [2025-03-04 00:31:58,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:31:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 4043 states and 6524 transitions. [2025-03-04 00:31:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-03-04 00:31:58,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:58,347 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:58,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:31:58,347 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:58,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:58,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1231528755, now seen corresponding path program 1 times [2025-03-04 00:31:58,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:58,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91885702] [2025-03-04 00:31:58,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:58,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:58,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-03-04 00:31:58,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-03-04 00:31:58,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:58,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:58,616 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:31:58,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:58,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91885702] [2025-03-04 00:31:58,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91885702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:58,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:58,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:31:58,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353661784] [2025-03-04 00:31:58,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:58,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:58,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:58,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:58,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:58,619 INFO L87 Difference]: Start difference. First operand 4043 states and 6524 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:31:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:58,839 INFO L93 Difference]: Finished difference Result 8123 states and 13109 transitions. [2025-03-04 00:31:58,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:58,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 631 [2025-03-04 00:31:58,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:58,863 INFO L225 Difference]: With dead ends: 8123 [2025-03-04 00:31:58,864 INFO L226 Difference]: Without dead ends: 4083 [2025-03-04 00:31:58,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:58,876 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 532 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:58,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1401 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4083 states. [2025-03-04 00:31:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4083 to 4081. [2025-03-04 00:31:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4081 states, 3224 states have (on average 1.505272952853598) internal successors, (4853), 3236 states have internal predecessors, (4853), 840 states have call successors, (840), 16 states have call predecessors, (840), 16 states have return successors, (840), 828 states have call predecessors, (840), 840 states have call successors, (840) [2025-03-04 00:31:59,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4081 states to 4081 states and 6533 transitions. [2025-03-04 00:31:59,121 INFO L78 Accepts]: Start accepts. Automaton has 4081 states and 6533 transitions. Word has length 631 [2025-03-04 00:31:59,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:59,122 INFO L471 AbstractCegarLoop]: Abstraction has 4081 states and 6533 transitions. [2025-03-04 00:31:59,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:31:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 4081 states and 6533 transitions. [2025-03-04 00:31:59,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-03-04 00:31:59,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:59,130 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:59,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:31:59,130 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:59,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:59,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1680985457, now seen corresponding path program 1 times [2025-03-04 00:31:59,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:59,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295452741] [2025-03-04 00:31:59,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:59,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:59,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-03-04 00:31:59,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-03-04 00:31:59,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:59,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:31:59,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:59,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295452741] [2025-03-04 00:31:59,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295452741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:59,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:59,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:59,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914915109] [2025-03-04 00:31:59,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:59,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:59,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:59,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:59,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:59,760 INFO L87 Difference]: Start difference. First operand 4081 states and 6533 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, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:32:00,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:00,523 INFO L93 Difference]: Finished difference Result 12689 states and 20292 transitions. [2025-03-04 00:32:00,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:32:00,524 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, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 631 [2025-03-04 00:32:00,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:00,564 INFO L225 Difference]: With dead ends: 12689 [2025-03-04 00:32:00,565 INFO L226 Difference]: Without dead ends: 8611 [2025-03-04 00:32:00,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:32:00,581 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 689 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:00,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1883 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:32:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8611 states. [2025-03-04 00:32:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8611 to 6103. [2025-03-04 00:32:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6103 states, 4818 states have (on average 1.5024906600249066) internal successors, (7239), 4836 states have internal predecessors, (7239), 1260 states have call successors, (1260), 24 states have call predecessors, (1260), 24 states have return successors, (1260), 1242 states have call predecessors, (1260), 1260 states have call successors, (1260) [2025-03-04 00:32:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6103 states to 6103 states and 9759 transitions. [2025-03-04 00:32:00,983 INFO L78 Accepts]: Start accepts. Automaton has 6103 states and 9759 transitions. Word has length 631 [2025-03-04 00:32:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:00,984 INFO L471 AbstractCegarLoop]: Abstraction has 6103 states and 9759 transitions. [2025-03-04 00:32:00,984 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, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:32:00,985 INFO L276 IsEmpty]: Start isEmpty. Operand 6103 states and 9759 transitions. [2025-03-04 00:32:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-03-04 00:32:00,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:00,993 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:00,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:32:00,993 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:00,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash -903323665, now seen corresponding path program 1 times [2025-03-04 00:32:00,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:00,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915714084] [2025-03-04 00:32:00,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:00,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:01,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-03-04 00:32:01,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-03-04 00:32:01,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:01,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:32:02,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:02,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915714084] [2025-03-04 00:32:02,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915714084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:02,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:02,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:32:02,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687768492] [2025-03-04 00:32:02,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:02,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:32:02,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:02,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:32:02,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:32:02,271 INFO L87 Difference]: Start difference. First operand 6103 states and 9759 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:32:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:03,308 INFO L93 Difference]: Finished difference Result 18167 states and 29065 transitions. [2025-03-04 00:32:03,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:32:03,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 632 [2025-03-04 00:32:03,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:03,364 INFO L225 Difference]: With dead ends: 18167 [2025-03-04 00:32:03,364 INFO L226 Difference]: Without dead ends: 12067 [2025-03-04 00:32:03,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:32:03,382 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 1126 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:03,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 2169 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:32:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12067 states. [2025-03-04 00:32:03,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12067 to 6266. [2025-03-04 00:32:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6266 states, 4883 states have (on average 1.4962113454843333) internal successors, (7306), 4901 states have internal predecessors, (7306), 1356 states have call successors, (1356), 26 states have call predecessors, (1356), 26 states have return successors, (1356), 1338 states have call predecessors, (1356), 1356 states have call successors, (1356) [2025-03-04 00:32:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6266 states to 6266 states and 10018 transitions. [2025-03-04 00:32:03,907 INFO L78 Accepts]: Start accepts. Automaton has 6266 states and 10018 transitions. Word has length 632 [2025-03-04 00:32:03,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:03,908 INFO L471 AbstractCegarLoop]: Abstraction has 6266 states and 10018 transitions. [2025-03-04 00:32:03,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:32:03,909 INFO L276 IsEmpty]: Start isEmpty. Operand 6266 states and 10018 transitions. [2025-03-04 00:32:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-03-04 00:32:03,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:03,917 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:03,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:32:03,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:03,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1873614672, now seen corresponding path program 1 times [2025-03-04 00:32:03,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:03,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978708951] [2025-03-04 00:32:03,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:03,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:03,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-03-04 00:32:04,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-03-04 00:32:04,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:04,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:32:04,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:04,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978708951] [2025-03-04 00:32:04,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978708951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:04,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:04,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:32:04,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732963752] [2025-03-04 00:32:04,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:04,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:32:04,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:04,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:32:04,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:32:04,924 INFO L87 Difference]: Start difference. First operand 6266 states and 10018 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-03-04 00:32:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:06,340 INFO L93 Difference]: Finished difference Result 21449 states and 34183 transitions. [2025-03-04 00:32:06,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:32:06,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) Word has length 632 [2025-03-04 00:32:06,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:06,392 INFO L225 Difference]: With dead ends: 21449 [2025-03-04 00:32:06,393 INFO L226 Difference]: Without dead ends: 15349 [2025-03-04 00:32:06,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:32:06,415 INFO L435 NwaCegarLoop]: 1314 mSDtfsCounter, 1697 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:06,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 2826 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:32:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15349 states. [2025-03-04 00:32:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15349 to 13432. [2025-03-04 00:32:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13432 states, 10633 states have (on average 1.4975077588639143) internal successors, (15923), 10681 states have internal predecessors, (15923), 2736 states have call successors, (2736), 62 states have call predecessors, (2736), 62 states have return successors, (2736), 2688 states have call predecessors, (2736), 2736 states have call successors, (2736) [2025-03-04 00:32:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13432 states to 13432 states and 21395 transitions. [2025-03-04 00:32:07,383 INFO L78 Accepts]: Start accepts. Automaton has 13432 states and 21395 transitions. Word has length 632 [2025-03-04 00:32:07,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:07,384 INFO L471 AbstractCegarLoop]: Abstraction has 13432 states and 21395 transitions. [2025-03-04 00:32:07,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-03-04 00:32:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 13432 states and 21395 transitions. [2025-03-04 00:32:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-03-04 00:32:07,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:07,398 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:07,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:32:07,399 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:07,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:07,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1201689236, now seen corresponding path program 1 times [2025-03-04 00:32:07,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:07,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847488881] [2025-03-04 00:32:07,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:07,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:07,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-03-04 00:32:07,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-03-04 00:32:07,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:07,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:32:08,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:08,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847488881] [2025-03-04 00:32:08,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847488881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:08,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:32:08,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181788481] [2025-03-04 00:32:08,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:08,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:32:08,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:08,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:32:08,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:32:08,106 INFO L87 Difference]: Start difference. First operand 13432 states and 21395 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:32:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:08,836 INFO L93 Difference]: Finished difference Result 18362 states and 29243 transitions. [2025-03-04 00:32:08,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:32:08,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 632 [2025-03-04 00:32:08,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:08,884 INFO L225 Difference]: With dead ends: 18362 [2025-03-04 00:32:08,884 INFO L226 Difference]: Without dead ends: 14284 [2025-03-04 00:32:08,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:32:08,898 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 1004 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:08,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 1567 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:32:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14284 states. [2025-03-04 00:32:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14284 to 13422. [2025-03-04 00:32:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13422 states, 10622 states have (on average 1.4971756731312371) internal successors, (15903), 10670 states have internal predecessors, (15903), 2736 states have call successors, (2736), 63 states have call predecessors, (2736), 63 states have return successors, (2736), 2688 states have call predecessors, (2736), 2736 states have call successors, (2736) [2025-03-04 00:32:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13422 states to 13422 states and 21375 transitions. [2025-03-04 00:32:09,592 INFO L78 Accepts]: Start accepts. Automaton has 13422 states and 21375 transitions. Word has length 632 [2025-03-04 00:32:09,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:09,593 INFO L471 AbstractCegarLoop]: Abstraction has 13422 states and 21375 transitions. [2025-03-04 00:32:09,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:32:09,593 INFO L276 IsEmpty]: Start isEmpty. Operand 13422 states and 21375 transitions. [2025-03-04 00:32:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-03-04 00:32:09,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:09,606 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:09,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:32:09,606 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:09,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash -713618863, now seen corresponding path program 1 times [2025-03-04 00:32:09,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:09,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172073675] [2025-03-04 00:32:09,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:09,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:09,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-03-04 00:32:10,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-03-04 00:32:10,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:10,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:32:10,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:10,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172073675] [2025-03-04 00:32:10,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172073675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:10,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:10,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:32:10,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232850251] [2025-03-04 00:32:10,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:10,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:32:10,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:10,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:32:10,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:32:10,794 INFO L87 Difference]: Start difference. First operand 13422 states and 21375 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:32:11,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:11,486 INFO L93 Difference]: Finished difference Result 21974 states and 34978 transitions. [2025-03-04 00:32:11,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:32:11,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 632 [2025-03-04 00:32:11,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:11,545 INFO L225 Difference]: With dead ends: 21974 [2025-03-04 00:32:11,545 INFO L226 Difference]: Without dead ends: 15888 [2025-03-04 00:32:11,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:32:11,569 INFO L435 NwaCegarLoop]: 995 mSDtfsCounter, 769 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:11,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1809 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:32:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15888 states. [2025-03-04 00:32:12,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15888 to 14522. [2025-03-04 00:32:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14522 states, 11722 states have (on average 1.5008530967411704) internal successors, (17593), 11770 states have internal predecessors, (17593), 2736 states have call successors, (2736), 63 states have call predecessors, (2736), 63 states have return successors, (2736), 2688 states have call predecessors, (2736), 2736 states have call successors, (2736) [2025-03-04 00:32:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14522 states to 14522 states and 23065 transitions. [2025-03-04 00:32:12,250 INFO L78 Accepts]: Start accepts. Automaton has 14522 states and 23065 transitions. Word has length 632 [2025-03-04 00:32:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:12,251 INFO L471 AbstractCegarLoop]: Abstraction has 14522 states and 23065 transitions. [2025-03-04 00:32:12,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:32:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 14522 states and 23065 transitions. [2025-03-04 00:32:12,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-03-04 00:32:12,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:12,266 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:12,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:32:12,267 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:12,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:12,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1419970641, now seen corresponding path program 1 times [2025-03-04 00:32:12,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:12,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483855227] [2025-03-04 00:32:12,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:12,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:12,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-04 00:32:12,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-04 00:32:12,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:12,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:32:12,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:12,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483855227] [2025-03-04 00:32:12,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483855227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:12,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:12,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:32:12,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906468382] [2025-03-04 00:32:12,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:12,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:32:12,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:12,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:32:12,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:32:12,847 INFO L87 Difference]: Start difference. First operand 14522 states and 23065 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:32:13,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:13,667 INFO L93 Difference]: Finished difference Result 44067 states and 69712 transitions. [2025-03-04 00:32:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:32:13,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 633 [2025-03-04 00:32:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:13,773 INFO L225 Difference]: With dead ends: 44067 [2025-03-04 00:32:13,773 INFO L226 Difference]: Without dead ends: 29715 [2025-03-04 00:32:13,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:32:13,812 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 983 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:13,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 1612 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:32:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29715 states. [2025-03-04 00:32:14,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29715 to 27443. [2025-03-04 00:32:14,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27443 states, 23119 states have (on average 1.5117003330593883) internal successors, (34949), 23227 states have internal predecessors, (34949), 4200 states have call successors, (4200), 123 states have call predecessors, (4200), 123 states have return successors, (4200), 4092 states have call predecessors, (4200), 4200 states have call successors, (4200) [2025-03-04 00:32:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27443 states to 27443 states and 43349 transitions. [2025-03-04 00:32:14,985 INFO L78 Accepts]: Start accepts. Automaton has 27443 states and 43349 transitions. Word has length 633 [2025-03-04 00:32:14,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:14,986 INFO L471 AbstractCegarLoop]: Abstraction has 27443 states and 43349 transitions. [2025-03-04 00:32:14,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:32:14,987 INFO L276 IsEmpty]: Start isEmpty. Operand 27443 states and 43349 transitions. [2025-03-04 00:32:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-03-04 00:32:15,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:15,005 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:15,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:32:15,006 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:15,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:15,006 INFO L85 PathProgramCache]: Analyzing trace with hash -458365553, now seen corresponding path program 1 times [2025-03-04 00:32:15,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:15,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419491086] [2025-03-04 00:32:15,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:15,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:15,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-04 00:32:15,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-04 00:32:15,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:15,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:32:15,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:15,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419491086] [2025-03-04 00:32:15,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419491086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:15,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:15,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:32:15,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131931568] [2025-03-04 00:32:15,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:15,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:32:15,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:15,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:32:15,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:32:15,260 INFO L87 Difference]: Start difference. First operand 27443 states and 43349 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:32:16,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:16,449 INFO L93 Difference]: Finished difference Result 65593 states and 103446 transitions. [2025-03-04 00:32:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:32:16,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 633 [2025-03-04 00:32:16,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:16,624 INFO L225 Difference]: With dead ends: 65593 [2025-03-04 00:32:16,624 INFO L226 Difference]: Without dead ends: 38069 [2025-03-04 00:32:16,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:32:16,659 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 302 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:16,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1239 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:32:16,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38069 states. [2025-03-04 00:32:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38069 to 28323. [2025-03-04 00:32:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28323 states, 24498 states have (on average 1.5240427790023676) internal successors, (37336), 24586 states have internal predecessors, (37336), 3712 states have call successors, (3712), 112 states have call predecessors, (3712), 112 states have return successors, (3712), 3624 states have call predecessors, (3712), 3712 states have call successors, (3712) [2025-03-04 00:32:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28323 states to 28323 states and 44760 transitions. [2025-03-04 00:32:17,919 INFO L78 Accepts]: Start accepts. Automaton has 28323 states and 44760 transitions. Word has length 633 [2025-03-04 00:32:17,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:17,920 INFO L471 AbstractCegarLoop]: Abstraction has 28323 states and 44760 transitions. [2025-03-04 00:32:17,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:32:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 28323 states and 44760 transitions. [2025-03-04 00:32:17,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-03-04 00:32:17,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:17,950 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:17,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:32:17,950 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:17,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash -867189778, now seen corresponding path program 1 times [2025-03-04 00:32:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:17,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004556306] [2025-03-04 00:32:17,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:17,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-04 00:32:18,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-04 00:32:18,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:18,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:32:20,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:20,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004556306] [2025-03-04 00:32:20,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004556306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:20,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:20,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:32:20,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111303728] [2025-03-04 00:32:20,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:20,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:32:20,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:20,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:32:20,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:32:20,617 INFO L87 Difference]: Start difference. First operand 28323 states and 44760 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-03-04 00:32:25,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:25,559 INFO L93 Difference]: Finished difference Result 131674 states and 206168 transitions. [2025-03-04 00:32:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:32:25,560 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) Word has length 633 [2025-03-04 00:32:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:25,876 INFO L225 Difference]: With dead ends: 131674 [2025-03-04 00:32:25,876 INFO L226 Difference]: Without dead ends: 103525 [2025-03-04 00:32:25,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:32:25,929 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 2939 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2939 SdHoareTripleChecker+Valid, 3442 SdHoareTripleChecker+Invalid, 2482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:25,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2939 Valid, 3442 Invalid, 2482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-04 00:32:25,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103525 states. [2025-03-04 00:32:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103525 to 88097. [2025-03-04 00:32:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88097 states, 82092 states have (on average 1.551905179554646) internal successors, (127399), 82400 states have internal predecessors, (127399), 5592 states have call successors, (5592), 412 states have call predecessors, (5592), 412 states have return successors, (5592), 5284 states have call predecessors, (5592), 5592 states have call successors, (5592) [2025-03-04 00:32:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88097 states to 88097 states and 138583 transitions. [2025-03-04 00:32:28,966 INFO L78 Accepts]: Start accepts. Automaton has 88097 states and 138583 transitions. Word has length 633 [2025-03-04 00:32:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:28,968 INFO L471 AbstractCegarLoop]: Abstraction has 88097 states and 138583 transitions. [2025-03-04 00:32:28,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-03-04 00:32:28,968 INFO L276 IsEmpty]: Start isEmpty. Operand 88097 states and 138583 transitions. [2025-03-04 00:32:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-03-04 00:32:29,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:29,031 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:29,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:32:29,031 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:29,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:29,032 INFO L85 PathProgramCache]: Analyzing trace with hash 596429421, now seen corresponding path program 1 times [2025-03-04 00:32:29,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:29,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836643967] [2025-03-04 00:32:29,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:29,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:29,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-04 00:32:29,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-04 00:32:29,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:29,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:32:30,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:30,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836643967] [2025-03-04 00:32:30,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836643967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:30,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:30,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:32:30,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164366437] [2025-03-04 00:32:30,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:30,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:32:30,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:30,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:32:30,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:32:30,053 INFO L87 Difference]: Start difference. First operand 88097 states and 138583 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:32:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:32,442 INFO L93 Difference]: Finished difference Result 180146 states and 283013 transitions. [2025-03-04 00:32:32,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:32:32,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 633 [2025-03-04 00:32:32,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:32,628 INFO L225 Difference]: With dead ends: 180146 [2025-03-04 00:32:32,628 INFO L226 Difference]: Without dead ends: 92223 [2025-03-04 00:32:32,719 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-04 00:32:32,719 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 341 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:32,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1921 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:32:32,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92223 states. [2025-03-04 00:32:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92223 to 87809. [2025-03-04 00:32:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87809 states, 81804 states have (on average 1.5468070021025866) internal successors, (126535), 82112 states have internal predecessors, (126535), 5592 states have call successors, (5592), 412 states have call predecessors, (5592), 412 states have return successors, (5592), 5284 states have call predecessors, (5592), 5592 states have call successors, (5592) [2025-03-04 00:32:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87809 states to 87809 states and 137719 transitions. [2025-03-04 00:32:35,575 INFO L78 Accepts]: Start accepts. Automaton has 87809 states and 137719 transitions. Word has length 633 [2025-03-04 00:32:35,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:35,576 INFO L471 AbstractCegarLoop]: Abstraction has 87809 states and 137719 transitions. [2025-03-04 00:32:35,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-04 00:32:35,576 INFO L276 IsEmpty]: Start isEmpty. Operand 87809 states and 137719 transitions. [2025-03-04 00:32:35,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-03-04 00:32:35,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:35,639 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:35,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:32:35,640 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:35,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:35,640 INFO L85 PathProgramCache]: Analyzing trace with hash 35204904, now seen corresponding path program 1 times [2025-03-04 00:32:35,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:35,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233715146] [2025-03-04 00:32:35,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:35,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:35,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-04 00:32:36,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-04 00:32:36,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:36,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:32:41,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:41,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233715146] [2025-03-04 00:32:41,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233715146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:41,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:41,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 00:32:41,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472771062] [2025-03-04 00:32:41,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:41,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:32:41,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:41,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:32:41,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:32:41,425 INFO L87 Difference]: Start difference. First operand 87809 states and 137719 transitions. Second operand has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-03-04 00:32:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:50,487 INFO L93 Difference]: Finished difference Result 286633 states and 449355 transitions. [2025-03-04 00:32:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 00:32:50,488 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) Word has length 633 [2025-03-04 00:32:50,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:51,102 INFO L225 Difference]: With dead ends: 286633 [2025-03-04 00:32:51,102 INFO L226 Difference]: Without dead ends: 198998 [2025-03-04 00:32:51,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:32:51,207 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 3787 mSDsluCounter, 4832 mSDsCounter, 0 mSdLazyCounter, 3057 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3787 SdHoareTripleChecker+Valid, 5581 SdHoareTripleChecker+Invalid, 3365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 3057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:51,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3787 Valid, 5581 Invalid, 3365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 3057 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 00:32:51,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198998 states. [2025-03-04 00:32:57,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198998 to 173682. [2025-03-04 00:32:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173682 states, 162813 states have (on average 1.544821359473752) internal successors, (251517), 163429 states have internal predecessors, (251517), 10128 states have call successors, (10128), 740 states have call predecessors, (10128), 740 states have return successors, (10128), 9512 states have call predecessors, (10128), 10128 states have call successors, (10128) [2025-03-04 00:32:57,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173682 states to 173682 states and 271773 transitions. [2025-03-04 00:32:57,684 INFO L78 Accepts]: Start accepts. Automaton has 173682 states and 271773 transitions. Word has length 633 [2025-03-04 00:32:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:57,685 INFO L471 AbstractCegarLoop]: Abstraction has 173682 states and 271773 transitions. [2025-03-04 00:32:57,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-03-04 00:32:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 173682 states and 271773 transitions. [2025-03-04 00:32:57,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-03-04 00:32:57,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:57,755 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:57,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 00:32:57,756 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:57,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:57,756 INFO L85 PathProgramCache]: Analyzing trace with hash -260218040, now seen corresponding path program 1 times [2025-03-04 00:32:57,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:57,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691204899] [2025-03-04 00:32:57,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:57,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:57,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-04 00:32:57,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-04 00:32:57,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:57,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-03-04 00:32:59,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:59,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691204899] [2025-03-04 00:32:59,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691204899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:59,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:59,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:32:59,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729788226] [2025-03-04 00:32:59,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:59,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:32:59,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:59,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:32:59,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:32:59,028 INFO L87 Difference]: Start difference. First operand 173682 states and 271773 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96)