./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-74.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 5c28cf38da1de1456241ac4a939c49e0441da83e6b9d5831b12e3d1a178d244e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:10:47,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:10:47,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:10:47,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:10:47,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:10:47,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:10:47,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:10:47,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:10:47,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:10:47,423 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:10:47,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:10:47,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:10:47,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:10:47,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:10:47,424 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:10:47,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:10:47,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:10:47,424 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:10:47,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:10:47,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:10:47,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:10:47,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:10:47,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:10:47,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:10:47,424 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:10:47,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:10:47,424 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:10:47,424 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:10:47,425 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:10:47,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:10:47,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:10:47,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:10:47,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:47,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:10:47,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:10:47,425 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:10:47,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:10:47,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:10:47,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:10:47,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:10:47,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:10:47,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:10:47,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:10:47,427 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 -> 5c28cf38da1de1456241ac4a939c49e0441da83e6b9d5831b12e3d1a178d244e [2025-03-03 20:10:47,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:10:47,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:10:47,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:10:47,629 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:10:47,629 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:10:47,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-74.i [2025-03-03 20:10:48,733 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3dfd35c/0f0ee0f40dfd46cab29bab382b1f3ca2/FLAG67e36a580 [2025-03-03 20:10:49,029 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:10:49,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-74.i [2025-03-03 20:10:49,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3dfd35c/0f0ee0f40dfd46cab29bab382b1f3ca2/FLAG67e36a580 [2025-03-03 20:10:49,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3dfd35c/0f0ee0f40dfd46cab29bab382b1f3ca2 [2025-03-03 20:10:49,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:10:49,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:10:49,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:49,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:10:49,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:10:49,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49, skipping insertion in model container [2025-03-03 20:10:49,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:10:49,467 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-74.i[916,929] [2025-03-03 20:10:49,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:49,670 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:10:49,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-74.i[916,929] [2025-03-03 20:10:49,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:49,770 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:10:49,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49 WrapperNode [2025-03-03 20:10:49,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:49,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:49,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:10:49,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:10:49,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,859 INFO L138 Inliner]: procedures = 26, calls = 127, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 860 [2025-03-03 20:10:49,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:49,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:10:49,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:10:49,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:10:49,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,921 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:10:49,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,947 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:10:49,979 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:10:49,979 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:10:49,979 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:10:49,980 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:49,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:50,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:10:50,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:10:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:10:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:10:50,028 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:10:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:10:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:10:50,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:10:50,156 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:10:50,158 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:10:51,082 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L752: havoc property_#t~ite82#1;havoc property_#t~bitwise81#1;havoc property_#t~short83#1; [2025-03-03 20:10:51,259 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 20:10:51,259 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:10:51,289 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:10:51,294 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 20:10:51,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:51 BoogieIcfgContainer [2025-03-03 20:10:51,295 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:10:51,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:10:51,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:10:51,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:10:51,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:10:49" (1/3) ... [2025-03-03 20:10:51,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a95a1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:51, skipping insertion in model container [2025-03-03 20:10:51,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (2/3) ... [2025-03-03 20:10:51,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a95a1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:51, skipping insertion in model container [2025-03-03 20:10:51,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:51" (3/3) ... [2025-03-03 20:10:51,303 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-74.i [2025-03-03 20:10:51,314 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:10:51,318 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-74.i that has 2 procedures, 359 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:10:51,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:10:51,386 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;@457fbde9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:10:51,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:10:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 359 states, 242 states have (on average 1.5826446280991735) internal successors, (383), 243 states have internal predecessors, (383), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-03 20:10:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-03-03 20:10:51,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:51,420 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:51,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:51,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:51,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1501477245, now seen corresponding path program 1 times [2025-03-03 20:10:51,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:51,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684131486] [2025-03-03 20:10:51,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:51,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:51,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-03-03 20:10:51,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-03-03 20:10:51,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:51,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:10:52,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:52,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684131486] [2025-03-03 20:10:52,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684131486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:52,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:52,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:10:52,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345750877] [2025-03-03 20:10:52,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:52,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:10:52,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:52,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:10:52,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:10:52,122 INFO L87 Difference]: Start difference. First operand has 359 states, 242 states have (on average 1.5826446280991735) internal successors, (383), 243 states have internal predecessors, (383), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) Second operand has 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:52,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:52,203 INFO L93 Difference]: Finished difference Result 711 states and 1329 transitions. [2025-03-03 20:10:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:10:52,205 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 728 [2025-03-03 20:10:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:52,219 INFO L225 Difference]: With dead ends: 711 [2025-03-03 20:10:52,220 INFO L226 Difference]: Without dead ends: 355 [2025-03-03 20:10:52,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:10:52,230 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:52,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 587 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:52,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-03 20:10:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-03-03 20:10:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 239 states have (on average 1.5606694560669456) internal successors, (373), 239 states have internal predecessors, (373), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-03 20:10:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 601 transitions. [2025-03-03 20:10:52,321 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 601 transitions. Word has length 728 [2025-03-03 20:10:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:52,325 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 601 transitions. [2025-03-03 20:10:52,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 601 transitions. [2025-03-03 20:10:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-03-03 20:10:52,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:52,337 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:52,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 20:10:52,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:52,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:52,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1116110462, now seen corresponding path program 1 times [2025-03-03 20:10:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:52,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503337958] [2025-03-03 20:10:52,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:52,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:52,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-03-03 20:10:52,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-03-03 20:10:52,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:52,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:10:53,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:53,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503337958] [2025-03-03 20:10:53,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503337958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:53,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:53,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:53,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663363188] [2025-03-03 20:10:53,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:53,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:53,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:53,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:53,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:53,117 INFO L87 Difference]: Start difference. First operand 355 states and 601 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:53,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:53,254 INFO L93 Difference]: Finished difference Result 1049 states and 1779 transitions. [2025-03-03 20:10:53,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:53,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 728 [2025-03-03 20:10:53,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:53,264 INFO L225 Difference]: With dead ends: 1049 [2025-03-03 20:10:53,264 INFO L226 Difference]: Without dead ends: 697 [2025-03-03 20:10:53,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:53,266 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 575 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:53,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1499 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-03-03 20:10:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 448. [2025-03-03 20:10:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 332 states have (on average 1.644578313253012) internal successors, (546), 332 states have internal predecessors, (546), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-03 20:10:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 774 transitions. [2025-03-03 20:10:53,331 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 774 transitions. Word has length 728 [2025-03-03 20:10:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:53,334 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 774 transitions. [2025-03-03 20:10:53,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 774 transitions. [2025-03-03 20:10:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-03 20:10:53,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:53,350 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:53,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:10:53,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:53,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1652732929, now seen corresponding path program 1 times [2025-03-03 20:10:53,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:53,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787071393] [2025-03-03 20:10:53,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:53,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:53,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-03 20:10:53,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-03 20:10:53,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:53,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:10:53,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:53,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787071393] [2025-03-03 20:10:53,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787071393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:53,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:53,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:53,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716824445] [2025-03-03 20:10:53,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:53,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:53,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:53,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:53,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:53,689 INFO L87 Difference]: Start difference. First operand 448 states and 774 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:53,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:53,788 INFO L93 Difference]: Finished difference Result 1336 states and 2312 transitions. [2025-03-03 20:10:53,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:53,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-03-03 20:10:53,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:53,800 INFO L225 Difference]: With dead ends: 1336 [2025-03-03 20:10:53,801 INFO L226 Difference]: Without dead ends: 891 [2025-03-03 20:10:53,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:53,803 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 579 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:53,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1157 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:53,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-03-03 20:10:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2025-03-03 20:10:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 658 states have (on average 1.635258358662614) internal successors, (1076), 658 states have internal predecessors, (1076), 228 states have call successors, (228), 2 states have call predecessors, (228), 2 states have return successors, (228), 228 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-03 20:10:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1532 transitions. [2025-03-03 20:10:53,883 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1532 transitions. Word has length 729 [2025-03-03 20:10:53,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:53,886 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1532 transitions. [2025-03-03 20:10:53,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:53,886 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1532 transitions. [2025-03-03 20:10:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-03 20:10:53,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:53,892 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:53,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:10:53,893 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:53,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:53,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1412192800, now seen corresponding path program 1 times [2025-03-03 20:10:53,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:53,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492535826] [2025-03-03 20:10:53,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:53,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:53,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-03 20:10:53,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-03 20:10:53,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:53,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:10:54,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:54,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492535826] [2025-03-03 20:10:54,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492535826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:54,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:54,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957951173] [2025-03-03 20:10:54,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:54,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:54,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:54,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:54,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:54,175 INFO L87 Difference]: Start difference. First operand 889 states and 1532 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:54,270 INFO L93 Difference]: Finished difference Result 2383 states and 4130 transitions. [2025-03-03 20:10:54,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:54,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-03-03 20:10:54,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:54,279 INFO L225 Difference]: With dead ends: 2383 [2025-03-03 20:10:54,279 INFO L226 Difference]: Without dead ends: 1497 [2025-03-03 20:10:54,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:54,283 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 311 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:54,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1151 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-03-03 20:10:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1493. [2025-03-03 20:10:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1204 states have (on average 1.6777408637873754) internal successors, (2020), 1206 states have internal predecessors, (2020), 284 states have call successors, (284), 4 states have call predecessors, (284), 4 states have return successors, (284), 282 states have call predecessors, (284), 284 states have call successors, (284) [2025-03-03 20:10:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2588 transitions. [2025-03-03 20:10:54,368 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2588 transitions. Word has length 729 [2025-03-03 20:10:54,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:54,369 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 2588 transitions. [2025-03-03 20:10:54,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2588 transitions. [2025-03-03 20:10:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-03 20:10:54,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:54,375 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:54,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:10:54,375 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:54,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash -597911041, now seen corresponding path program 1 times [2025-03-03 20:10:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:54,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324243569] [2025-03-03 20:10:54,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:54,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-03 20:10:54,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-03 20:10:54,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:54,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:10:54,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:54,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324243569] [2025-03-03 20:10:54,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324243569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:54,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:54,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171301719] [2025-03-03 20:10:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:54,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:54,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:54,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:54,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:54,617 INFO L87 Difference]: Start difference. First operand 1493 states and 2588 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:54,739 INFO L93 Difference]: Finished difference Result 4221 states and 7298 transitions. [2025-03-03 20:10:54,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:54,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-03-03 20:10:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:54,754 INFO L225 Difference]: With dead ends: 4221 [2025-03-03 20:10:54,754 INFO L226 Difference]: Without dead ends: 2731 [2025-03-03 20:10:54,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:54,759 INFO L435 NwaCegarLoop]: 1034 mSDtfsCounter, 526 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:54,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1614 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2025-03-03 20:10:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 1541. [2025-03-03 20:10:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1252 states have (on average 1.6757188498402555) internal successors, (2098), 1254 states have internal predecessors, (2098), 284 states have call successors, (284), 4 states have call predecessors, (284), 4 states have return successors, (284), 282 states have call predecessors, (284), 284 states have call successors, (284) [2025-03-03 20:10:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2666 transitions. [2025-03-03 20:10:54,926 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2666 transitions. Word has length 729 [2025-03-03 20:10:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:54,927 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 2666 transitions. [2025-03-03 20:10:54,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2666 transitions. [2025-03-03 20:10:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-03 20:10:54,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:54,932 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:54,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:10:54,932 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:54,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:54,933 INFO L85 PathProgramCache]: Analyzing trace with hash -852647586, now seen corresponding path program 1 times [2025-03-03 20:10:54,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:54,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547593007] [2025-03-03 20:10:54,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:54,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:54,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-03 20:10:55,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-03 20:10:55,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:55,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:10:55,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:55,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547593007] [2025-03-03 20:10:55,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547593007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:55,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:55,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:55,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463351132] [2025-03-03 20:10:55,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:55,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:55,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:55,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:55,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:55,198 INFO L87 Difference]: Start difference. First operand 1541 states and 2666 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:55,318 INFO L93 Difference]: Finished difference Result 4071 states and 7004 transitions. [2025-03-03 20:10:55,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:55,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-03-03 20:10:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:55,332 INFO L225 Difference]: With dead ends: 4071 [2025-03-03 20:10:55,332 INFO L226 Difference]: Without dead ends: 2533 [2025-03-03 20:10:55,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:55,337 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 344 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:55,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1150 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:55,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2025-03-03 20:10:55,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 2529. [2025-03-03 20:10:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2529 states, 2020 states have (on average 1.6504950495049504) internal successors, (3334), 2026 states have internal predecessors, (3334), 500 states have call successors, (500), 8 states have call predecessors, (500), 8 states have return successors, (500), 494 states have call predecessors, (500), 500 states have call successors, (500) [2025-03-03 20:10:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 4334 transitions. [2025-03-03 20:10:55,511 INFO L78 Accepts]: Start accepts. Automaton has 2529 states and 4334 transitions. Word has length 729 [2025-03-03 20:10:55,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:55,512 INFO L471 AbstractCegarLoop]: Abstraction has 2529 states and 4334 transitions. [2025-03-03 20:10:55,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 4334 transitions. [2025-03-03 20:10:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-03 20:10:55,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:55,519 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:55,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:10:55,519 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:55,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1365110367, now seen corresponding path program 1 times [2025-03-03 20:10:55,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:55,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029459191] [2025-03-03 20:10:55,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:55,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-03 20:10:55,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-03 20:10:55,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:55,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:10:55,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:55,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029459191] [2025-03-03 20:10:55,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029459191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:55,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:55,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:55,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080632000] [2025-03-03 20:10:55,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:55,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:55,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:55,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:55,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:55,730 INFO L87 Difference]: Start difference. First operand 2529 states and 4334 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:55,850 INFO L93 Difference]: Finished difference Result 5313 states and 9026 transitions. [2025-03-03 20:10:55,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:55,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-03-03 20:10:55,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:55,865 INFO L225 Difference]: With dead ends: 5313 [2025-03-03 20:10:55,865 INFO L226 Difference]: Without dead ends: 2787 [2025-03-03 20:10:55,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:55,872 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 46 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:55,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1159 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2787 states. [2025-03-03 20:10:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2787 to 2777. [2025-03-03 20:10:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2777 states, 2196 states have (on average 1.616575591985428) internal successors, (3550), 2210 states have internal predecessors, (3550), 564 states have call successors, (564), 16 states have call predecessors, (564), 16 states have return successors, (564), 550 states have call predecessors, (564), 564 states have call successors, (564) [2025-03-03 20:10:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 4678 transitions. [2025-03-03 20:10:56,050 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 4678 transitions. Word has length 729 [2025-03-03 20:10:56,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:56,052 INFO L471 AbstractCegarLoop]: Abstraction has 2777 states and 4678 transitions. [2025-03-03 20:10:56,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 4678 transitions. [2025-03-03 20:10:56,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-03 20:10:56,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:56,059 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:56,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:10:56,060 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:56,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash -442344096, now seen corresponding path program 1 times [2025-03-03 20:10:56,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:56,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016823153] [2025-03-03 20:10:56,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:56,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:56,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-03 20:10:56,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-03 20:10:56,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:56,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:10:56,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:56,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016823153] [2025-03-03 20:10:56,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016823153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:56,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:56,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:10:56,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546170506] [2025-03-03 20:10:56,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:56,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:10:56,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:56,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:10:56,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:10:56,425 INFO L87 Difference]: Start difference. First operand 2777 states and 4678 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 2 states have call predecessors, (114), 2 states have call successors, (114) [2025-03-03 20:10:56,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:56,547 INFO L93 Difference]: Finished difference Result 5447 states and 9181 transitions. [2025-03-03 20:10:56,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:56,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 2 states have call predecessors, (114), 2 states have call successors, (114) Word has length 729 [2025-03-03 20:10:56,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:56,563 INFO L225 Difference]: With dead ends: 5447 [2025-03-03 20:10:56,563 INFO L226 Difference]: Without dead ends: 2673 [2025-03-03 20:10:56,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:10:56,570 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 510 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:56,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 573 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2025-03-03 20:10:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2673. [2025-03-03 20:10:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2092 states have (on average 1.6032504780114722) internal successors, (3354), 2106 states have internal predecessors, (3354), 564 states have call successors, (564), 16 states have call predecessors, (564), 16 states have return successors, (564), 550 states have call predecessors, (564), 564 states have call successors, (564) [2025-03-03 20:10:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 4482 transitions. [2025-03-03 20:10:56,739 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 4482 transitions. Word has length 729 [2025-03-03 20:10:56,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:56,740 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 4482 transitions. [2025-03-03 20:10:56,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 2 states have call predecessors, (114), 2 states have call successors, (114) [2025-03-03 20:10:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 4482 transitions. [2025-03-03 20:10:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-03-03 20:10:56,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:56,746 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:56,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:10:56,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:56,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:56,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2014957367, now seen corresponding path program 1 times [2025-03-03 20:10:56,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:56,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985855305] [2025-03-03 20:10:56,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:56,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:56,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-03-03 20:10:56,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-03-03 20:10:56,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:56,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:10:57,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:57,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985855305] [2025-03-03 20:10:57,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985855305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:57,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:57,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:10:57,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283787049] [2025-03-03 20:10:57,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:57,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:10:57,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:57,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:10:57,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:10:57,263 INFO L87 Difference]: Start difference. First operand 2673 states and 4482 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:57,934 INFO L93 Difference]: Finished difference Result 10675 states and 17903 transitions. [2025-03-03 20:10:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:10:57,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 730 [2025-03-03 20:10:57,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:57,979 INFO L225 Difference]: With dead ends: 10675 [2025-03-03 20:10:57,979 INFO L226 Difference]: Without dead ends: 8005 [2025-03-03 20:10:57,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:10:57,990 INFO L435 NwaCegarLoop]: 1221 mSDtfsCounter, 1174 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 2137 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:57,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 2137 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:10:57,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8005 states. [2025-03-03 20:10:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8005 to 5413. [2025-03-03 20:10:58,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5413 states, 4252 states have (on average 1.5964252116650988) internal successors, (6788), 4280 states have internal predecessors, (6788), 1128 states have call successors, (1128), 32 states have call predecessors, (1128), 32 states have return successors, (1128), 1100 states have call predecessors, (1128), 1128 states have call successors, (1128) [2025-03-03 20:10:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5413 states to 5413 states and 9044 transitions. [2025-03-03 20:10:58,442 INFO L78 Accepts]: Start accepts. Automaton has 5413 states and 9044 transitions. Word has length 730 [2025-03-03 20:10:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:58,443 INFO L471 AbstractCegarLoop]: Abstraction has 5413 states and 9044 transitions. [2025-03-03 20:10:58,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:10:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5413 states and 9044 transitions. [2025-03-03 20:10:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-03-03 20:10:58,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:58,452 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:58,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:10:58,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:58,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:58,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2025273384, now seen corresponding path program 1 times [2025-03-03 20:10:58,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:58,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659130416] [2025-03-03 20:10:58,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:58,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:58,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-03-03 20:10:58,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-03-03 20:10:58,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:58,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:10:59,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:59,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659130416] [2025-03-03 20:10:59,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659130416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:59,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:59,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:10:59,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626129794] [2025-03-03 20:10:59,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:59,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:10:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:59,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:10:59,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:10:59,673 INFO L87 Difference]: Start difference. First operand 5413 states and 9044 transitions. Second operand has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 3 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 3 states have call predecessors, (114), 3 states have call successors, (114) [2025-03-03 20:11:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:04,132 INFO L93 Difference]: Finished difference Result 20461 states and 33579 transitions. [2025-03-03 20:11:04,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 20:11:04,133 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 3 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 3 states have call predecessors, (114), 3 states have call successors, (114) Word has length 730 [2025-03-03 20:11:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:04,196 INFO L225 Difference]: With dead ends: 20461 [2025-03-03 20:11:04,196 INFO L226 Difference]: Without dead ends: 15051 [2025-03-03 20:11:04,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:11:04,214 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 3921 mSDsluCounter, 2947 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 1747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3921 SdHoareTripleChecker+Valid, 3619 SdHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1747 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:04,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3921 Valid, 3619 Invalid, 3329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1747 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-03 20:11:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15051 states. [2025-03-03 20:11:05,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15051 to 12686. [2025-03-03 20:11:05,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12686 states, 9293 states have (on average 1.5236199289788013) internal successors, (14159), 9366 states have internal predecessors, (14159), 3254 states have call successors, (3254), 138 states have call predecessors, (3254), 138 states have return successors, (3254), 3181 states have call predecessors, (3254), 3254 states have call successors, (3254) [2025-03-03 20:11:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12686 states to 12686 states and 20667 transitions. [2025-03-03 20:11:05,226 INFO L78 Accepts]: Start accepts. Automaton has 12686 states and 20667 transitions. Word has length 730 [2025-03-03 20:11:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:05,228 INFO L471 AbstractCegarLoop]: Abstraction has 12686 states and 20667 transitions. [2025-03-03 20:11:05,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 3 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 3 states have call predecessors, (114), 3 states have call successors, (114) [2025-03-03 20:11:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 12686 states and 20667 transitions. [2025-03-03 20:11:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-03-03 20:11:05,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:05,241 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:05,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:11:05,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:05,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:05,242 INFO L85 PathProgramCache]: Analyzing trace with hash 324532905, now seen corresponding path program 1 times [2025-03-03 20:11:05,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:05,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407266812] [2025-03-03 20:11:05,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:05,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:05,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-03-03 20:11:05,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-03-03 20:11:05,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:05,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:06,676 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:06,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:06,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407266812] [2025-03-03 20:11:06,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407266812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:06,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:06,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:11:06,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879445177] [2025-03-03 20:11:06,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:06,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:11:06,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:06,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:11:06,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:11:06,678 INFO L87 Difference]: Start difference. First operand 12686 states and 20667 transitions. Second operand has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 3 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 3 states have call predecessors, (114), 3 states have call successors, (114) [2025-03-03 20:11:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:09,569 INFO L93 Difference]: Finished difference Result 25725 states and 42120 transitions. [2025-03-03 20:11:09,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:11:09,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 3 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 3 states have call predecessors, (114), 3 states have call successors, (114) Word has length 730 [2025-03-03 20:11:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:09,621 INFO L225 Difference]: With dead ends: 25725 [2025-03-03 20:11:09,622 INFO L226 Difference]: Without dead ends: 13135 [2025-03-03 20:11:09,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:11:09,653 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 2307 mSDsluCounter, 3498 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 835 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2307 SdHoareTripleChecker+Valid, 4175 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 835 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:09,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2307 Valid, 4175 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [835 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 20:11:09,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13135 states. [2025-03-03 20:11:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13135 to 10781. [2025-03-03 20:11:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10781 states, 8076 states have (on average 1.5517582961862308) internal successors, (12532), 8133 states have internal predecessors, (12532), 2604 states have call successors, (2604), 100 states have call predecessors, (2604), 100 states have return successors, (2604), 2547 states have call predecessors, (2604), 2604 states have call successors, (2604) [2025-03-03 20:11:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10781 states to 10781 states and 17740 transitions. [2025-03-03 20:11:10,463 INFO L78 Accepts]: Start accepts. Automaton has 10781 states and 17740 transitions. Word has length 730 [2025-03-03 20:11:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:10,464 INFO L471 AbstractCegarLoop]: Abstraction has 10781 states and 17740 transitions. [2025-03-03 20:11:10,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 3 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 3 states have call predecessors, (114), 3 states have call successors, (114) [2025-03-03 20:11:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 10781 states and 17740 transitions. [2025-03-03 20:11:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-03-03 20:11:10,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:10,476 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:10,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:11:10,476 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:10,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:10,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1784733255, now seen corresponding path program 1 times [2025-03-03 20:11:10,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:10,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167546517] [2025-03-03 20:11:10,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:10,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-03-03 20:11:10,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-03-03 20:11:10,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:10,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:11,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:11,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167546517] [2025-03-03 20:11:11,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167546517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:11,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:11,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:11:11,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707372295] [2025-03-03 20:11:11,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:11,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:11:11,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:11,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:11:11,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:11,009 INFO L87 Difference]: Start difference. First operand 10781 states and 17740 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:13,617 INFO L93 Difference]: Finished difference Result 46697 states and 75768 transitions. [2025-03-03 20:11:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:11:13,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 730 [2025-03-03 20:11:13,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:13,739 INFO L225 Difference]: With dead ends: 46697 [2025-03-03 20:11:13,739 INFO L226 Difference]: Without dead ends: 36055 [2025-03-03 20:11:13,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:11:13,773 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 1019 mSDsluCounter, 2035 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:13,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 2819 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:11:13,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36055 states. [2025-03-03 20:11:16,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36055 to 36033. [2025-03-03 20:11:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36033 states, 25936 states have (on average 1.493985194324491) internal successors, (38748), 26177 states have internal predecessors, (38748), 9708 states have call successors, (9708), 388 states have call predecessors, (9708), 388 states have return successors, (9708), 9467 states have call predecessors, (9708), 9708 states have call successors, (9708) [2025-03-03 20:11:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36033 states to 36033 states and 58164 transitions. [2025-03-03 20:11:16,607 INFO L78 Accepts]: Start accepts. Automaton has 36033 states and 58164 transitions. Word has length 730 [2025-03-03 20:11:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:16,607 INFO L471 AbstractCegarLoop]: Abstraction has 36033 states and 58164 transitions. [2025-03-03 20:11:16,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:16,608 INFO L276 IsEmpty]: Start isEmpty. Operand 36033 states and 58164 transitions. [2025-03-03 20:11:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-03-03 20:11:16,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:16,629 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:16,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:11:16,629 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:16,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:16,630 INFO L85 PathProgramCache]: Analyzing trace with hash -186206202, now seen corresponding path program 1 times [2025-03-03 20:11:16,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:16,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621150547] [2025-03-03 20:11:16,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:16,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:16,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-03-03 20:11:16,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-03-03 20:11:16,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:16,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:17,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:17,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621150547] [2025-03-03 20:11:17,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621150547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:17,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:17,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:11:17,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680938508] [2025-03-03 20:11:17,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:17,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:11:17,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:17,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:11:17,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:11:17,204 INFO L87 Difference]: Start difference. First operand 36033 states and 58164 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:25,105 INFO L93 Difference]: Finished difference Result 133109 states and 211321 transitions. [2025-03-03 20:11:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:11:25,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 730 [2025-03-03 20:11:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:25,482 INFO L225 Difference]: With dead ends: 133109 [2025-03-03 20:11:25,483 INFO L226 Difference]: Without dead ends: 97215 [2025-03-03 20:11:25,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:11:25,587 INFO L435 NwaCegarLoop]: 1440 mSDtfsCounter, 1266 mSDsluCounter, 2283 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 3723 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:25,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 3723 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:11:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97215 states. [2025-03-03 20:11:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97215 to 59145. [2025-03-03 20:11:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59145 states, 42296 states have (on average 1.4540382069226405) internal successors, (61500), 42793 states have internal predecessors, (61500), 16140 states have call successors, (16140), 708 states have call predecessors, (16140), 708 states have return successors, (16140), 15643 states have call predecessors, (16140), 16140 states have call successors, (16140) [2025-03-03 20:11:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59145 states to 59145 states and 93780 transitions. [2025-03-03 20:11:31,727 INFO L78 Accepts]: Start accepts. Automaton has 59145 states and 93780 transitions. Word has length 730 [2025-03-03 20:11:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:31,727 INFO L471 AbstractCegarLoop]: Abstraction has 59145 states and 93780 transitions. [2025-03-03 20:11:31,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 59145 states and 93780 transitions. [2025-03-03 20:11:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-03-03 20:11:31,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:31,767 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:31,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:11:31,767 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:31,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:31,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1105338469, now seen corresponding path program 1 times [2025-03-03 20:11:31,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:31,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539083546] [2025-03-03 20:11:31,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:31,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:31,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-03-03 20:11:31,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-03-03 20:11:31,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:31,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:32,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:32,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539083546] [2025-03-03 20:11:32,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539083546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:32,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:32,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:32,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887779698] [2025-03-03 20:11:32,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:32,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:32,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:32,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:32,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:32,238 INFO L87 Difference]: Start difference. First operand 59145 states and 93780 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:38,359 INFO L93 Difference]: Finished difference Result 118301 states and 187608 transitions. [2025-03-03 20:11:38,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:11:38,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 730 [2025-03-03 20:11:38,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:38,644 INFO L225 Difference]: With dead ends: 118301 [2025-03-03 20:11:38,644 INFO L226 Difference]: Without dead ends: 59295 [2025-03-03 20:11:38,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:38,807 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 1338 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1338 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:38,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1338 Valid, 2819 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:11:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59295 states. [2025-03-03 20:11:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59295 to 59257. [2025-03-03 20:11:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59257 states, 42408 states have (on average 1.4431239388794568) internal successors, (61200), 42905 states have internal predecessors, (61200), 16140 states have call successors, (16140), 708 states have call predecessors, (16140), 708 states have return successors, (16140), 15643 states have call predecessors, (16140), 16140 states have call successors, (16140) [2025-03-03 20:11:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59257 states to 59257 states and 93480 transitions. [2025-03-03 20:11:43,899 INFO L78 Accepts]: Start accepts. Automaton has 59257 states and 93480 transitions. Word has length 730 [2025-03-03 20:11:43,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:43,900 INFO L471 AbstractCegarLoop]: Abstraction has 59257 states and 93480 transitions. [2025-03-03 20:11:43,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 59257 states and 93480 transitions. [2025-03-03 20:11:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-03-03 20:11:43,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:43,934 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:43,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:11:43,934 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:43,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:43,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1219564967, now seen corresponding path program 1 times [2025-03-03 20:11:43,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:43,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762326925] [2025-03-03 20:11:43,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:43,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-03-03 20:11:44,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-03-03 20:11:44,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:44,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:44,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:44,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762326925] [2025-03-03 20:11:44,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762326925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:44,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:44,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:44,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156428066] [2025-03-03 20:11:44,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:44,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:44,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:44,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:44,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:44,495 INFO L87 Difference]: Start difference. First operand 59257 states and 93480 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:53,828 INFO L93 Difference]: Finished difference Result 169963 states and 267574 transitions. [2025-03-03 20:11:53,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:11:53,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 730 [2025-03-03 20:11:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:54,197 INFO L225 Difference]: With dead ends: 169963 [2025-03-03 20:11:54,197 INFO L226 Difference]: Without dead ends: 110845 [2025-03-03 20:11:54,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:54,342 INFO L435 NwaCegarLoop]: 1026 mSDtfsCounter, 1210 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 2660 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:54,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 2660 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:11:54,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110845 states. [2025-03-03 20:12:01,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110845 to 65063. [2025-03-03 20:12:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65063 states, 48214 states have (on average 1.4737213257560045) internal successors, (71054), 48711 states have internal predecessors, (71054), 16140 states have call successors, (16140), 708 states have call predecessors, (16140), 708 states have return successors, (16140), 15643 states have call predecessors, (16140), 16140 states have call successors, (16140) [2025-03-03 20:12:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65063 states to 65063 states and 103334 transitions. [2025-03-03 20:12:01,684 INFO L78 Accepts]: Start accepts. Automaton has 65063 states and 103334 transitions. Word has length 730 [2025-03-03 20:12:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:01,685 INFO L471 AbstractCegarLoop]: Abstraction has 65063 states and 103334 transitions. [2025-03-03 20:12:01,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:12:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 65063 states and 103334 transitions. [2025-03-03 20:12:01,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-03-03 20:12:01,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:01,733 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:01,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 20:12:01,733 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:01,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:01,734 INFO L85 PathProgramCache]: Analyzing trace with hash 964828422, now seen corresponding path program 1 times [2025-03-03 20:12:01,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:01,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085348733] [2025-03-03 20:12:01,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:01,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:01,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-03-03 20:12:01,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-03-03 20:12:01,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:01,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:12:02,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:02,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085348733] [2025-03-03 20:12:02,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085348733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:02,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:02,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:12:02,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916653038] [2025-03-03 20:12:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:02,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:12:02,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:02,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:12:02,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:02,353 INFO L87 Difference]: Start difference. First operand 65063 states and 103334 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114)