./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20b89f8a60d2f6d2584628c0d5624c8090542a805d1f710cb23a05b88ce8a600 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:21:33,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:21:33,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:21:33,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:21:33,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:21:33,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:21:33,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:21:33,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:21:33,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:21:33,548 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:21:33,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:21:33,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:21:33,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:21:33,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:21:33,549 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:21:33,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:21:33,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:21:33,549 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:21:33,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:21:33,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:21:33,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:21:33,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:21:33,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:21:33,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:21:33,549 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:21:33,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:21:33,549 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:21:33,549 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:21:33,550 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:21:33,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:21:33,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:21:33,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:21:33,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:21:33,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:21:33,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:21:33,550 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:21:33,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:21:33,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:21:33,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:21:33,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:21:33,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:21:33,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:21:33,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:21:33,552 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 -> 20b89f8a60d2f6d2584628c0d5624c8090542a805d1f710cb23a05b88ce8a600 [2025-03-17 00:21:33,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:21:33,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:21:33,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:21:33,824 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:21:33,824 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:21:33,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i [2025-03-17 00:21:34,964 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52c225e5d/bc3b1ec9d3804d158711adf8be410405/FLAG00d774608 [2025-03-17 00:21:35,181 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:21:35,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i [2025-03-17 00:21:35,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52c225e5d/bc3b1ec9d3804d158711adf8be410405/FLAG00d774608 [2025-03-17 00:21:35,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52c225e5d/bc3b1ec9d3804d158711adf8be410405 [2025-03-17 00:21:35,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:21:35,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:21:35,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:21:35,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:21:35,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:21:35,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:21:35" (1/1) ... [2025-03-17 00:21:35,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:35, skipping insertion in model container [2025-03-17 00:21:35,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:21:35" (1/1) ... [2025-03-17 00:21:35,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:21:35,671 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i[915,928] [2025-03-17 00:21:35,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:21:35,753 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:21:35,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i[915,928] [2025-03-17 00:21:35,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:21:35,808 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:21:35,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:35 WrapperNode [2025-03-17 00:21:35,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:21:35,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:21:35,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:21:35,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:21:35,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:35" (1/1) ... [2025-03-17 00:21:35,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:35" (1/1) ... [2025-03-17 00:21:35,867 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2025-03-17 00:21:35,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:21:35,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:21:35,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:21:35,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:21:35,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:35" (1/1) ... [2025-03-17 00:21:35,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:35" (1/1) ... [2025-03-17 00:21:35,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:35" (1/1) ... [2025-03-17 00:21:35,906 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:21:35,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:35" (1/1) ... [2025-03-17 00:21:35,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:35" (1/1) ... [2025-03-17 00:21:35,913 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:35" (1/1) ... [2025-03-17 00:21:35,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:35" (1/1) ... [2025-03-17 00:21:35,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:35" (1/1) ... [2025-03-17 00:21:35,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:35" (1/1) ... [2025-03-17 00:21:35,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:21:35,924 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:21:35,924 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:21:35,924 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:21:35,925 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:35" (1/1) ... [2025-03-17 00:21:35,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:21:35,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:21:35,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:21:35,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:21:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:21:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:21:35,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:21:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:21:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:21:35,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:21:36,041 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:21:36,042 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:21:36,361 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L183: havoc property_#t~bitwise26#1;havoc property_#t~short27#1; [2025-03-17 00:21:36,400 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 00:21:36,401 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:21:36,412 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:21:36,413 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:21:36,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:36 BoogieIcfgContainer [2025-03-17 00:21:36,413 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:21:36,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:21:36,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:21:36,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:21:36,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:21:35" (1/3) ... [2025-03-17 00:21:36,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d86f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:21:36, skipping insertion in model container [2025-03-17 00:21:36,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:35" (2/3) ... [2025-03-17 00:21:36,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d86f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:21:36, skipping insertion in model container [2025-03-17 00:21:36,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:36" (3/3) ... [2025-03-17 00:21:36,420 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-81.i [2025-03-17 00:21:36,430 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:21:36,431 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-81.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:21:36,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:21:36,480 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;@53808b45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:21:36,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:21:36,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 60 states have (on average 1.4) internal successors, (84), 61 states have internal predecessors, (84), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 00:21:36,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-17 00:21:36,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:21:36,494 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:21:36,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:21:36,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:21:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1170789602, now seen corresponding path program 1 times [2025-03-17 00:21:36,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:21:36,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300817748] [2025-03-17 00:21:36,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:21:36,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:21:36,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-17 00:21:36,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-17 00:21:36,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:21:36,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:21:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked. [2025-03-17 00:21:36,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:21:36,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300817748] [2025-03-17 00:21:36,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300817748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:21:36,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367731552] [2025-03-17 00:21:36,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:21:36,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:21:36,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:21:36,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:21:36,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:21:36,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-17 00:21:37,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-17 00:21:37,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:21:37,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:21:37,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:21:37,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:21:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked. [2025-03-17 00:21:37,044 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:21:37,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367731552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:21:37,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:21:37,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:21:37,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142196923] [2025-03-17 00:21:37,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:21:37,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:21:37,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:21:37,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:21:37,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:21:37,065 INFO L87 Difference]: Start difference. First operand has 104 states, 60 states have (on average 1.4) internal successors, (84), 61 states have internal predecessors, (84), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-17 00:21:37,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:21:37,089 INFO L93 Difference]: Finished difference Result 205 states and 371 transitions. [2025-03-17 00:21:37,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:21:37,091 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) Word has length 248 [2025-03-17 00:21:37,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:21:37,095 INFO L225 Difference]: With dead ends: 205 [2025-03-17 00:21:37,095 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 00:21:37,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:21:37,103 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:21:37,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:21:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 00:21:37,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 00:21:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 00:21:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 162 transitions. [2025-03-17 00:21:37,143 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 162 transitions. Word has length 248 [2025-03-17 00:21:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:21:37,143 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 162 transitions. [2025-03-17 00:21:37,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-17 00:21:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 162 transitions. [2025-03-17 00:21:37,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-17 00:21:37,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:21:37,147 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:21:37,155 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-17 00:21:37,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:21:37,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:21:37,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:21:37,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2030413635, now seen corresponding path program 1 times [2025-03-17 00:21:37,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:21:37,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526064217] [2025-03-17 00:21:37,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:21:37,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:21:37,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-17 00:21:37,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-17 00:21:37,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:21:37,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:21:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-03-17 00:21:37,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:21:37,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526064217] [2025-03-17 00:21:37,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526064217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:21:37,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:21:37,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:21:37,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736321500] [2025-03-17 00:21:37,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:21:37,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:21:37,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:21:37,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:21:37,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:21:37,974 INFO L87 Difference]: Start difference. First operand 102 states and 162 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:21:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:21:38,088 INFO L93 Difference]: Finished difference Result 237 states and 371 transitions. [2025-03-17 00:21:38,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:21:38,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 248 [2025-03-17 00:21:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:21:38,093 INFO L225 Difference]: With dead ends: 237 [2025-03-17 00:21:38,093 INFO L226 Difference]: Without dead ends: 136 [2025-03-17 00:21:38,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:21:38,096 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 41 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:21:38,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 465 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:21:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-17 00:21:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2025-03-17 00:21:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 86 states have internal predecessors, (116), 45 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 00:21:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 206 transitions. [2025-03-17 00:21:38,121 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 206 transitions. Word has length 248 [2025-03-17 00:21:38,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:21:38,122 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 206 transitions. [2025-03-17 00:21:38,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:21:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 206 transitions. [2025-03-17 00:21:38,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-17 00:21:38,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:21:38,126 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:21:38,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:21:38,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:21:38,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:21:38,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1833900130, now seen corresponding path program 1 times [2025-03-17 00:21:38,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:21:38,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839600211] [2025-03-17 00:21:38,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:21:38,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:21:38,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-17 00:21:38,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-17 00:21:38,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:21:38,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:21:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-03-17 00:21:47,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:21:47,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839600211] [2025-03-17 00:21:47,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839600211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:21:47,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:21:47,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 00:21:47,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051345988] [2025-03-17 00:21:47,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:21:47,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 00:21:47,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:21:47,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 00:21:47,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:21:47,246 INFO L87 Difference]: Start difference. First operand 133 states and 206 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-17 00:21:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:21:49,594 INFO L93 Difference]: Finished difference Result 472 states and 715 transitions. [2025-03-17 00:21:49,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 00:21:49,595 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) Word has length 248 [2025-03-17 00:21:49,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:21:49,602 INFO L225 Difference]: With dead ends: 472 [2025-03-17 00:21:49,603 INFO L226 Difference]: Without dead ends: 340 [2025-03-17 00:21:49,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-03-17 00:21:49,604 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 759 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:21:49,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 777 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 00:21:49,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-17 00:21:49,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 223. [2025-03-17 00:21:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 133 states have (on average 1.3383458646616542) internal successors, (178), 134 states have internal predecessors, (178), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 00:21:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 350 transitions. [2025-03-17 00:21:49,654 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 350 transitions. Word has length 248 [2025-03-17 00:21:49,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:21:49,655 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 350 transitions. [2025-03-17 00:21:49,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-17 00:21:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 350 transitions. [2025-03-17 00:21:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-17 00:21:49,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:21:49,657 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:21:49,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:21:49,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:21:49,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:21:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash 664115807, now seen corresponding path program 1 times [2025-03-17 00:21:49,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:21:49,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580919769] [2025-03-17 00:21:49,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:21:49,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:21:49,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-17 00:21:49,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-17 00:21:49,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:21:49,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:21:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-03-17 00:21:56,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:21:56,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580919769] [2025-03-17 00:21:56,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580919769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:21:56,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:21:56,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:21:56,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099705952] [2025-03-17 00:21:56,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:21:56,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:21:56,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:21:56,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:21:56,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:21:56,046 INFO L87 Difference]: Start difference. First operand 223 states and 350 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:21:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:21:57,403 INFO L93 Difference]: Finished difference Result 395 states and 608 transitions. [2025-03-17 00:21:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:21:57,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 248 [2025-03-17 00:21:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:21:57,411 INFO L225 Difference]: With dead ends: 395 [2025-03-17 00:21:57,411 INFO L226 Difference]: Without dead ends: 263 [2025-03-17 00:21:57,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:21:57,412 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 140 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:21:57,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 855 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:21:57,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-17 00:21:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 143. [2025-03-17 00:21:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 95 states have (on average 1.368421052631579) internal successors, (130), 96 states have internal predecessors, (130), 45 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 00:21:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 220 transitions. [2025-03-17 00:21:57,426 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 220 transitions. Word has length 248 [2025-03-17 00:21:57,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:21:57,426 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 220 transitions. [2025-03-17 00:21:57,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:21:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 220 transitions. [2025-03-17 00:21:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-17 00:21:57,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:21:57,428 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:21:57,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:21:57,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:21:57,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:21:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1704817411, now seen corresponding path program 1 times [2025-03-17 00:21:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:21:57,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895763372] [2025-03-17 00:21:57,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:21:57,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:21:57,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-17 00:21:57,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-17 00:21:57,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:21:57,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:21:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-03-17 00:21:58,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:21:58,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895763372] [2025-03-17 00:21:58,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895763372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:21:58,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:21:58,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:21:58,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445526716] [2025-03-17 00:21:58,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:21:58,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:21:58,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:21:58,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:21:58,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:21:58,301 INFO L87 Difference]: Start difference. First operand 143 states and 220 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-17 00:21:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:21:59,015 INFO L93 Difference]: Finished difference Result 458 states and 703 transitions. [2025-03-17 00:21:59,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:21:59,017 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) Word has length 248 [2025-03-17 00:21:59,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:21:59,020 INFO L225 Difference]: With dead ends: 458 [2025-03-17 00:21:59,020 INFO L226 Difference]: Without dead ends: 316 [2025-03-17 00:21:59,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:21:59,022 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 292 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:21:59,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 806 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:21:59,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-17 00:21:59,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 227. [2025-03-17 00:21:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 138 states have internal predecessors, (183), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 00:21:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 355 transitions. [2025-03-17 00:21:59,047 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 355 transitions. Word has length 248 [2025-03-17 00:21:59,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:21:59,047 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 355 transitions. [2025-03-17 00:21:59,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-17 00:21:59,048 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 355 transitions. [2025-03-17 00:21:59,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 00:21:59,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:21:59,049 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:21:59,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:21:59,050 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:21:59,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:21:59,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1500387507, now seen corresponding path program 1 times [2025-03-17 00:21:59,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:21:59,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218688133] [2025-03-17 00:21:59,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:21:59,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:21:59,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 00:21:59,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 00:21:59,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:21:59,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-03-17 00:22:04,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:22:04,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218688133] [2025-03-17 00:22:04,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218688133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:04,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:04,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:22:04,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494935852] [2025-03-17 00:22:04,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:04,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:22:04,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:22:04,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:22:04,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:22:04,942 INFO L87 Difference]: Start difference. First operand 227 states and 355 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:05,417 INFO L93 Difference]: Finished difference Result 494 states and 750 transitions. [2025-03-17 00:22:05,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:22:05,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 249 [2025-03-17 00:22:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:05,420 INFO L225 Difference]: With dead ends: 494 [2025-03-17 00:22:05,420 INFO L226 Difference]: Without dead ends: 352 [2025-03-17 00:22:05,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:22:05,422 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 194 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:05,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 716 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:22:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-17 00:22:05,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 240. [2025-03-17 00:22:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 150 states have (on average 1.3533333333333333) internal successors, (203), 151 states have internal predecessors, (203), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 00:22:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 375 transitions. [2025-03-17 00:22:05,447 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 375 transitions. Word has length 249 [2025-03-17 00:22:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:05,448 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 375 transitions. [2025-03-17 00:22:05,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 375 transitions. [2025-03-17 00:22:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 00:22:05,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:05,451 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:05,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:22:05,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:05,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:05,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1303874002, now seen corresponding path program 1 times [2025-03-17 00:22:05,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:22:05,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624912439] [2025-03-17 00:22:05,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:05,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:22:05,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 00:22:05,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 00:22:05,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:05,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-03-17 00:22:09,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:22:09,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624912439] [2025-03-17 00:22:09,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624912439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:09,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:09,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:22:09,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333705207] [2025-03-17 00:22:09,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:09,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:22:09,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:22:09,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:22:09,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:22:09,384 INFO L87 Difference]: Start difference. First operand 240 states and 375 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:10,037 INFO L93 Difference]: Finished difference Result 509 states and 770 transitions. [2025-03-17 00:22:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:22:10,038 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 249 [2025-03-17 00:22:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:10,040 INFO L225 Difference]: With dead ends: 509 [2025-03-17 00:22:10,040 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 00:22:10,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:22:10,041 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 251 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:10,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 563 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:22:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 00:22:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 240. [2025-03-17 00:22:10,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 150 states have (on average 1.3533333333333333) internal successors, (203), 151 states have internal predecessors, (203), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 00:22:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 375 transitions. [2025-03-17 00:22:10,066 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 375 transitions. Word has length 249 [2025-03-17 00:22:10,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:10,066 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 375 transitions. [2025-03-17 00:22:10,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 375 transitions. [2025-03-17 00:22:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 00:22:10,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:10,069 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:10,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:22:10,069 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:10,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:10,069 INFO L85 PathProgramCache]: Analyzing trace with hash 997628430, now seen corresponding path program 1 times [2025-03-17 00:22:10,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:22:10,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346415944] [2025-03-17 00:22:10,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:10,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:22:10,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 00:22:10,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 00:22:10,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:10,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:13,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-03-17 00:22:13,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:22:13,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346415944] [2025-03-17 00:22:13,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346415944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:13,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:13,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 00:22:13,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301625942] [2025-03-17 00:22:13,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:13,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 00:22:13,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:22:13,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 00:22:13,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:22:13,899 INFO L87 Difference]: Start difference. First operand 240 states and 375 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-17 00:22:14,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:14,874 INFO L93 Difference]: Finished difference Result 560 states and 846 transitions. [2025-03-17 00:22:14,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 00:22:14,875 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) Word has length 249 [2025-03-17 00:22:14,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:14,877 INFO L225 Difference]: With dead ends: 560 [2025-03-17 00:22:14,877 INFO L226 Difference]: Without dead ends: 405 [2025-03-17 00:22:14,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2025-03-17 00:22:14,879 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 347 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:14,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 952 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:22:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-17 00:22:14,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 244. [2025-03-17 00:22:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 155 states have internal predecessors, (209), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 00:22:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 381 transitions. [2025-03-17 00:22:14,896 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 381 transitions. Word has length 249 [2025-03-17 00:22:14,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:14,896 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 381 transitions. [2025-03-17 00:22:14,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-17 00:22:14,897 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 381 transitions. [2025-03-17 00:22:14,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 00:22:14,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:14,898 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:14,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:22:14,898 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:14,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:14,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1194141935, now seen corresponding path program 1 times [2025-03-17 00:22:14,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:22:14,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16002278] [2025-03-17 00:22:14,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:14,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:22:14,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 00:22:14,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 00:22:14,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:14,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:19,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-03-17 00:22:19,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:22:19,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16002278] [2025-03-17 00:22:19,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16002278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:19,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:19,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 00:22:19,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397807801] [2025-03-17 00:22:19,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:19,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:22:19,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:22:19,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:22:19,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:22:19,926 INFO L87 Difference]: Start difference. First operand 244 states and 381 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:23,755 INFO L93 Difference]: Finished difference Result 525 states and 791 transitions. [2025-03-17 00:22:23,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 00:22:23,756 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 249 [2025-03-17 00:22:23,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:23,758 INFO L225 Difference]: With dead ends: 525 [2025-03-17 00:22:23,758 INFO L226 Difference]: Without dead ends: 370 [2025-03-17 00:22:23,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:22:23,759 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 146 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:23,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1043 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 00:22:23,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-17 00:22:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 244. [2025-03-17 00:22:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 155 states have internal predecessors, (209), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 00:22:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 381 transitions. [2025-03-17 00:22:23,784 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 381 transitions. Word has length 249 [2025-03-17 00:22:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:23,785 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 381 transitions. [2025-03-17 00:22:23,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 381 transitions. [2025-03-17 00:22:23,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 00:22:23,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:23,786 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:23,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:22:23,787 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:23,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:23,787 INFO L85 PathProgramCache]: Analyzing trace with hash 492069805, now seen corresponding path program 1 times [2025-03-17 00:22:23,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:22:23,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858969862] [2025-03-17 00:22:23,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:23,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:22:23,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 00:22:23,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 00:22:23,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:23,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-03-17 00:22:24,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:22:24,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858969862] [2025-03-17 00:22:24,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858969862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:24,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:24,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:22:24,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382743139] [2025-03-17 00:22:24,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:24,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:22:24,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:22:24,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:22:24,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:22:24,384 INFO L87 Difference]: Start difference. First operand 244 states and 381 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:24,921 INFO L93 Difference]: Finished difference Result 492 states and 750 transitions. [2025-03-17 00:22:24,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:22:24,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 249 [2025-03-17 00:22:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:24,925 INFO L225 Difference]: With dead ends: 492 [2025-03-17 00:22:24,925 INFO L226 Difference]: Without dead ends: 336 [2025-03-17 00:22:24,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:22:24,926 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 225 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:24,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 631 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:22:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-17 00:22:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 242. [2025-03-17 00:22:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 152 states have (on average 1.361842105263158) internal successors, (207), 153 states have internal predecessors, (207), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 00:22:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 379 transitions. [2025-03-17 00:22:24,949 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 379 transitions. Word has length 249 [2025-03-17 00:22:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:24,949 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 379 transitions. [2025-03-17 00:22:24,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 379 transitions. [2025-03-17 00:22:24,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 00:22:24,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:24,950 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:24,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:22:24,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:24,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:24,951 INFO L85 PathProgramCache]: Analyzing trace with hash 7164302, now seen corresponding path program 1 times [2025-03-17 00:22:24,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:22:24,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657355394] [2025-03-17 00:22:24,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:24,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:22:24,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 00:22:24,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 00:22:24,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:24,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-03-17 00:22:31,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:22:31,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657355394] [2025-03-17 00:22:31,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657355394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:31,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:31,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 00:22:31,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432852208] [2025-03-17 00:22:31,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:31,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 00:22:31,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:22:31,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 00:22:31,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:22:31,615 INFO L87 Difference]: Start difference. First operand 242 states and 379 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:32,279 INFO L93 Difference]: Finished difference Result 555 states and 838 transitions. [2025-03-17 00:22:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 00:22:32,280 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 249 [2025-03-17 00:22:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:32,283 INFO L225 Difference]: With dead ends: 555 [2025-03-17 00:22:32,284 INFO L226 Difference]: Without dead ends: 399 [2025-03-17 00:22:32,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:22:32,285 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 428 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:32,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 744 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:22:32,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-17 00:22:32,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 247. [2025-03-17 00:22:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 157 states have (on average 1.375796178343949) internal successors, (216), 158 states have internal predecessors, (216), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 00:22:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 388 transitions. [2025-03-17 00:22:32,311 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 388 transitions. Word has length 249 [2025-03-17 00:22:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:32,312 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 388 transitions. [2025-03-17 00:22:32,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 388 transitions. [2025-03-17 00:22:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 00:22:32,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:32,314 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:32,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:22:32,314 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:32,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:32,315 INFO L85 PathProgramCache]: Analyzing trace with hash 203677807, now seen corresponding path program 1 times [2025-03-17 00:22:32,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:22:32,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704632498] [2025-03-17 00:22:32,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:32,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:22:32,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 00:22:32,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 00:22:32,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:32,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:32,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-03-17 00:22:32,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:22:32,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704632498] [2025-03-17 00:22:32,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704632498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:32,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:32,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:22:32,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184836902] [2025-03-17 00:22:32,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:32,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:22:32,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:22:32,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:22:32,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:22:32,461 INFO L87 Difference]: Start difference. First operand 247 states and 388 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:32,523 INFO L93 Difference]: Finished difference Result 434 states and 666 transitions. [2025-03-17 00:22:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:22:32,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 249 [2025-03-17 00:22:32,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:32,526 INFO L225 Difference]: With dead ends: 434 [2025-03-17 00:22:32,526 INFO L226 Difference]: Without dead ends: 278 [2025-03-17 00:22:32,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:22:32,527 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 58 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:32,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 466 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:22:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-17 00:22:32,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 235. [2025-03-17 00:22:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 148 states have (on average 1.364864864864865) internal successors, (202), 148 states have internal predecessors, (202), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 00:22:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 366 transitions. [2025-03-17 00:22:32,547 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 366 transitions. Word has length 249 [2025-03-17 00:22:32,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:32,547 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 366 transitions. [2025-03-17 00:22:32,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 366 transitions. [2025-03-17 00:22:32,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 00:22:32,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:32,549 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:32,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:22:32,550 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:32,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:32,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1789787057, now seen corresponding path program 1 times [2025-03-17 00:22:32,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:22:32,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647235981] [2025-03-17 00:22:32,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:32,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:22:32,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 00:22:32,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 00:22:32,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:32,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-03-17 00:22:37,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:22:37,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647235981] [2025-03-17 00:22:37,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647235981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:37,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:37,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 00:22:37,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671662416] [2025-03-17 00:22:37,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:37,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:22:37,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:22:37,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:22:37,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:22:37,765 INFO L87 Difference]: Start difference. First operand 235 states and 366 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:38,686 INFO L93 Difference]: Finished difference Result 452 states and 686 transitions. [2025-03-17 00:22:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 00:22:38,686 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 249 [2025-03-17 00:22:38,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:38,688 INFO L225 Difference]: With dead ends: 452 [2025-03-17 00:22:38,688 INFO L226 Difference]: Without dead ends: 312 [2025-03-17 00:22:38,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-17 00:22:38,689 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 206 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:38,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 799 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:22:38,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-17 00:22:38,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 235. [2025-03-17 00:22:38,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 148 states have (on average 1.364864864864865) internal successors, (202), 148 states have internal predecessors, (202), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 00:22:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 366 transitions. [2025-03-17 00:22:38,709 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 366 transitions. Word has length 249 [2025-03-17 00:22:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:38,710 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 366 transitions. [2025-03-17 00:22:38,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 366 transitions. [2025-03-17 00:22:38,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 00:22:38,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:38,712 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:38,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:22:38,712 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:38,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:38,712 INFO L85 PathProgramCache]: Analyzing trace with hash 136247021, now seen corresponding path program 1 times [2025-03-17 00:22:38,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:22:38,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38909138] [2025-03-17 00:22:38,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:38,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:22:38,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 00:22:38,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 00:22:38,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:38,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:39,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-03-17 00:22:39,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:22:39,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38909138] [2025-03-17 00:22:39,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38909138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:39,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:39,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 00:22:39,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198167830] [2025-03-17 00:22:39,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:39,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:22:39,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:22:39,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:22:39,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:22:39,059 INFO L87 Difference]: Start difference. First operand 235 states and 366 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:39,603 INFO L93 Difference]: Finished difference Result 455 states and 690 transitions. [2025-03-17 00:22:39,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:22:39,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 249 [2025-03-17 00:22:39,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:39,606 INFO L225 Difference]: With dead ends: 455 [2025-03-17 00:22:39,606 INFO L226 Difference]: Without dead ends: 315 [2025-03-17 00:22:39,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:22:39,607 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 183 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:39,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 818 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:22:39,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-17 00:22:39,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 237. [2025-03-17 00:22:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 150 states have (on average 1.36) internal successors, (204), 150 states have internal predecessors, (204), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 00:22:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 368 transitions. [2025-03-17 00:22:39,628 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 368 transitions. Word has length 249 [2025-03-17 00:22:39,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:39,628 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 368 transitions. [2025-03-17 00:22:39,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 368 transitions. [2025-03-17 00:22:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 00:22:39,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:39,629 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:39,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 00:22:39,630 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:39,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:39,630 INFO L85 PathProgramCache]: Analyzing trace with hash -369311604, now seen corresponding path program 1 times [2025-03-17 00:22:39,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:22:39,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795748537] [2025-03-17 00:22:39,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:39,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:22:39,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 00:22:39,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 00:22:39,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:39,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-03-17 00:22:39,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:22:39,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795748537] [2025-03-17 00:22:39,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795748537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:39,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:39,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:22:39,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303492259] [2025-03-17 00:22:39,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:39,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:22:39,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:22:39,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:22:39,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:22:39,973 INFO L87 Difference]: Start difference. First operand 237 states and 368 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:40,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:40,351 INFO L93 Difference]: Finished difference Result 405 states and 623 transitions. [2025-03-17 00:22:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:22:40,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 249 [2025-03-17 00:22:40,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:40,353 INFO L225 Difference]: With dead ends: 405 [2025-03-17 00:22:40,353 INFO L226 Difference]: Without dead ends: 265 [2025-03-17 00:22:40,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:22:40,354 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 130 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:40,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 642 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:22:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-17 00:22:40,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 235. [2025-03-17 00:22:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 148 states have (on average 1.3581081081081081) internal successors, (201), 148 states have internal predecessors, (201), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 00:22:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 365 transitions. [2025-03-17 00:22:40,378 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 365 transitions. Word has length 249 [2025-03-17 00:22:40,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:40,378 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 365 transitions. [2025-03-17 00:22:40,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-17 00:22:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 365 transitions. [2025-03-17 00:22:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-17 00:22:40,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:40,380 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:40,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 00:22:40,380 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:40,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:40,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2027134396, now seen corresponding path program 1 times [2025-03-17 00:22:40,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:22:40,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59934179] [2025-03-17 00:22:40,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:40,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:22:40,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-17 00:22:40,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-17 00:22:40,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:40,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:59,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-03-17 00:22:59,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:22:59,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59934179] [2025-03-17 00:22:59,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59934179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:59,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:59,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:22:59,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883101522] [2025-03-17 00:22:59,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:59,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:22:59,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:22:59,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:22:59,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:22:59,541 INFO L87 Difference]: Start difference. First operand 235 states and 365 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)