./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-51.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 183ff7e14885c1f89cae46f39f0bc46efaeb3ccc298d253cb5ddd39e2e379927 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:20:11,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:20:11,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:20:11,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:20:11,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:20:11,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:20:11,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:20:11,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:20:11,925 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:20:11,925 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:20:11,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:20:11,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:20:11,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:20:11,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:20:11,926 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:20:11,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:20:11,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:20:11,926 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:20:11,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:20:11,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:20:11,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:20:11,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:20:11,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:20:11,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:20:11,927 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:20:11,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:20:11,927 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:20:11,927 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:20:11,927 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:20:11,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:20:11,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:20:11,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:20:11,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:20:11,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:20:11,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:20:11,928 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:20:11,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:20:11,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:20:11,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:20:11,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:20:11,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:20:11,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:20:11,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:20:11,929 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 -> 183ff7e14885c1f89cae46f39f0bc46efaeb3ccc298d253cb5ddd39e2e379927 [2025-03-08 11:20:12,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:20:12,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:20:12,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:20:12,133 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:20:12,134 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:20:12,134 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-51.i [2025-03-08 11:20:13,262 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f66cdea91/313ff6403ed84e1e92159bf4fab76b84/FLAG99d4dcc91 [2025-03-08 11:20:13,529 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:20:13,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-51.i [2025-03-08 11:20:13,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f66cdea91/313ff6403ed84e1e92159bf4fab76b84/FLAG99d4dcc91 [2025-03-08 11:20:13,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f66cdea91/313ff6403ed84e1e92159bf4fab76b84 [2025-03-08 11:20:13,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:20:13,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:20:13,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:20:13,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:20:13,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:20:13,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:20:13" (1/1) ... [2025-03-08 11:20:13,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f8fcee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:13, skipping insertion in model container [2025-03-08 11:20:13,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:20:13" (1/1) ... [2025-03-08 11:20:13,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:20:13,694 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-51.i[916,929] [2025-03-08 11:20:13,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:20:13,848 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:20:13,856 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-51.i[916,929] [2025-03-08 11:20:13,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:20:13,949 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:20:13,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:13 WrapperNode [2025-03-08 11:20:13,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:20:13,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:20:13,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:20:13,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:20:13,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:13" (1/1) ... [2025-03-08 11:20:13,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:13" (1/1) ... [2025-03-08 11:20:14,030 INFO L138 Inliner]: procedures = 26, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 841 [2025-03-08 11:20:14,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:20:14,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:20:14,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:20:14,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:20:14,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:13" (1/1) ... [2025-03-08 11:20:14,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:13" (1/1) ... [2025-03-08 11:20:14,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:13" (1/1) ... [2025-03-08 11:20:14,091 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-08 11:20:14,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:13" (1/1) ... [2025-03-08 11:20:14,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:13" (1/1) ... [2025-03-08 11:20:14,109 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:13" (1/1) ... [2025-03-08 11:20:14,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:13" (1/1) ... [2025-03-08 11:20:14,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:13" (1/1) ... [2025-03-08 11:20:14,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:13" (1/1) ... [2025-03-08 11:20:14,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:20:14,144 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:20:14,144 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:20:14,144 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:20:14,145 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:13" (1/1) ... [2025-03-08 11:20:14,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:20:14,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:20:14,169 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-08 11:20:14,173 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-08 11:20:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:20:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:20:14,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:20:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:20:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:20:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:20:14,281 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:20:14,283 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:20:15,304 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 11:20:15,304 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:20:15,328 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:20:15,328 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:20:15,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:20:15 BoogieIcfgContainer [2025-03-08 11:20:15,329 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:20:15,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:20:15,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:20:15,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:20:15,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:20:13" (1/3) ... [2025-03-08 11:20:15,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2916aee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:20:15, skipping insertion in model container [2025-03-08 11:20:15,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:13" (2/3) ... [2025-03-08 11:20:15,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2916aee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:20:15, skipping insertion in model container [2025-03-08 11:20:15,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:20:15" (3/3) ... [2025-03-08 11:20:15,335 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-51.i [2025-03-08 11:20:15,349 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:20:15,352 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-51.i that has 2 procedures, 347 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:20:15,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:20:15,417 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;@57b81284, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:20:15,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:20:15,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 347 states, 243 states have (on average 1.617283950617284) internal successors, (393), 244 states have internal predecessors, (393), 101 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) [2025-03-08 11:20:15,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-08 11:20:15,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:15,453 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:15,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:15,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:15,458 INFO L85 PathProgramCache]: Analyzing trace with hash 34818533, now seen corresponding path program 1 times [2025-03-08 11:20:15,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:15,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691501347] [2025-03-08 11:20:15,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:15,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:15,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-08 11:20:15,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-08 11:20:15,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:15,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 20000 trivial. 0 not checked. [2025-03-08 11:20:15,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:15,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691501347] [2025-03-08 11:20:15,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691501347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:20:15,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764711527] [2025-03-08 11:20:15,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:15,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:20:15,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:20:15,972 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:20:15,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:20:16,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-08 11:20:16,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-08 11:20:16,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:16,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:16,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 1510 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:20:16,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:20:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 20000 trivial. 0 not checked. [2025-03-08 11:20:16,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:20:16,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764711527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:16,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:20:16,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:20:16,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999608158] [2025-03-08 11:20:16,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:16,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:20:16,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:16,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:20:16,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:20:16,415 INFO L87 Difference]: Start difference. First operand has 347 states, 243 states have (on average 1.617283950617284) internal successors, (393), 244 states have internal predecessors, (393), 101 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) Second operand has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 2 states have call successors, (101) [2025-03-08 11:20:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:16,500 INFO L93 Difference]: Finished difference Result 684 states and 1279 transitions. [2025-03-08 11:20:16,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:20:16,502 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 2 states have call successors, (101) Word has length 650 [2025-03-08 11:20:16,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:16,511 INFO L225 Difference]: With dead ends: 684 [2025-03-08 11:20:16,511 INFO L226 Difference]: Without dead ends: 340 [2025-03-08 11:20:16,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 651 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-08 11:20:16,518 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:16,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 563 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:20:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-08 11:20:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-03-08 11:20:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 237 states have (on average 1.590717299578059) internal successors, (377), 237 states have internal predecessors, (377), 101 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) [2025-03-08 11:20:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 579 transitions. [2025-03-08 11:20:16,599 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 579 transitions. Word has length 650 [2025-03-08 11:20:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:16,600 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 579 transitions. [2025-03-08 11:20:16,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 2 states have call successors, (101) [2025-03-08 11:20:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 579 transitions. [2025-03-08 11:20:16,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-08 11:20:16,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:16,612 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:16,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 11:20:16,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:20:16,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:16,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:16,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1348334980, now seen corresponding path program 1 times [2025-03-08 11:20:16,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:16,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363181010] [2025-03-08 11:20:16,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:16,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:16,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-08 11:20:16,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-08 11:20:16,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:16,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-08 11:20:17,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:17,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363181010] [2025-03-08 11:20:17,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363181010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:17,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:17,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479833079] [2025-03-08 11:20:17,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:17,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:17,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:17,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:17,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:17,407 INFO L87 Difference]: Start difference. First operand 340 states and 579 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:17,546 INFO L93 Difference]: Finished difference Result 915 states and 1566 transitions. [2025-03-08 11:20:17,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:17,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-03-08 11:20:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:17,555 INFO L225 Difference]: With dead ends: 915 [2025-03-08 11:20:17,556 INFO L226 Difference]: Without dead ends: 578 [2025-03-08 11:20:17,558 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-08 11:20:17,558 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 402 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:17,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1100 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:20:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-08 11:20:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 575. [2025-03-08 11:20:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 433 states have (on average 1.625866050808314) internal successors, (704), 434 states have internal predecessors, (704), 139 states have call successors, (139), 2 states have call predecessors, (139), 2 states have return successors, (139), 138 states have call predecessors, (139), 139 states have call successors, (139) [2025-03-08 11:20:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 982 transitions. [2025-03-08 11:20:17,646 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 982 transitions. Word has length 650 [2025-03-08 11:20:17,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:17,648 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 982 transitions. [2025-03-08 11:20:17,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:17,648 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 982 transitions. [2025-03-08 11:20:17,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-08 11:20:17,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:17,661 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:17,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:20:17,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:17,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:17,662 INFO L85 PathProgramCache]: Analyzing trace with hash 777083747, now seen corresponding path program 1 times [2025-03-08 11:20:17,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:17,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261410966] [2025-03-08 11:20:17,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:17,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:17,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-08 11:20:17,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-08 11:20:17,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:17,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-08 11:20:18,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:18,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261410966] [2025-03-08 11:20:18,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261410966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:18,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:18,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:18,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471926396] [2025-03-08 11:20:18,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:18,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:18,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:18,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:18,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:18,041 INFO L87 Difference]: Start difference. First operand 575 states and 982 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:18,174 INFO L93 Difference]: Finished difference Result 1588 states and 2716 transitions. [2025-03-08 11:20:18,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:18,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-03-08 11:20:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:18,200 INFO L225 Difference]: With dead ends: 1588 [2025-03-08 11:20:18,201 INFO L226 Difference]: Without dead ends: 1016 [2025-03-08 11:20:18,202 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-08 11:20:18,203 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 378 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:18,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1101 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:20:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-03-08 11:20:18,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1013. [2025-03-08 11:20:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 785 states have (on average 1.629299363057325) internal successors, (1279), 788 states have internal predecessors, (1279), 223 states have call successors, (223), 4 states have call predecessors, (223), 4 states have return successors, (223), 220 states have call predecessors, (223), 223 states have call successors, (223) [2025-03-08 11:20:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1725 transitions. [2025-03-08 11:20:18,269 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1725 transitions. Word has length 650 [2025-03-08 11:20:18,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:18,270 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1725 transitions. [2025-03-08 11:20:18,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:18,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1725 transitions. [2025-03-08 11:20:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-08 11:20:18,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:18,277 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:18,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:20:18,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:18,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:18,279 INFO L85 PathProgramCache]: Analyzing trace with hash -483859774, now seen corresponding path program 1 times [2025-03-08 11:20:18,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:18,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046058465] [2025-03-08 11:20:18,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:18,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:18,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-08 11:20:18,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-08 11:20:18,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:18,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:18,544 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-08 11:20:18,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:18,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046058465] [2025-03-08 11:20:18,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046058465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:18,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:18,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:18,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606308449] [2025-03-08 11:20:18,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:18,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:18,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:18,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:18,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:18,549 INFO L87 Difference]: Start difference. First operand 1013 states and 1725 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:18,666 INFO L93 Difference]: Finished difference Result 3031 states and 5165 transitions. [2025-03-08 11:20:18,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:18,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-03-08 11:20:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:18,679 INFO L225 Difference]: With dead ends: 3031 [2025-03-08 11:20:18,679 INFO L226 Difference]: Without dead ends: 2021 [2025-03-08 11:20:18,682 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-08 11:20:18,683 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 566 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:18,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1342 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:20:18,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2025-03-08 11:20:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 2019. [2025-03-08 11:20:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 1564 states have (on average 1.6278772378516624) internal successors, (2546), 1570 states have internal predecessors, (2546), 446 states have call successors, (446), 8 states have call predecessors, (446), 8 states have return successors, (446), 440 states have call predecessors, (446), 446 states have call successors, (446) [2025-03-08 11:20:18,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 3438 transitions. [2025-03-08 11:20:18,802 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 3438 transitions. Word has length 650 [2025-03-08 11:20:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:18,803 INFO L471 AbstractCegarLoop]: Abstraction has 2019 states and 3438 transitions. [2025-03-08 11:20:18,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 3438 transitions. [2025-03-08 11:20:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-08 11:20:18,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:18,809 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:18,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:20:18,809 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:18,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:18,810 INFO L85 PathProgramCache]: Analyzing trace with hash 285310241, now seen corresponding path program 1 times [2025-03-08 11:20:18,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:18,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402390787] [2025-03-08 11:20:18,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:18,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:18,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-08 11:20:18,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-08 11:20:18,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:18,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-08 11:20:19,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:19,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402390787] [2025-03-08 11:20:19,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402390787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:19,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:19,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:19,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361519186] [2025-03-08 11:20:19,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:19,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:19,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:19,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:19,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:19,025 INFO L87 Difference]: Start difference. First operand 2019 states and 3438 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:19,214 INFO L93 Difference]: Finished difference Result 6043 states and 10292 transitions. [2025-03-08 11:20:19,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:19,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-03-08 11:20:19,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:19,236 INFO L225 Difference]: With dead ends: 6043 [2025-03-08 11:20:19,237 INFO L226 Difference]: Without dead ends: 4027 [2025-03-08 11:20:19,243 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-08 11:20:19,245 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 561 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:19,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1602 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:20:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4027 states. [2025-03-08 11:20:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4027 to 4017. [2025-03-08 11:20:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 3108 states have (on average 1.6216216216216217) internal successors, (5040), 3120 states have internal predecessors, (5040), 892 states have call successors, (892), 16 states have call predecessors, (892), 16 states have return successors, (892), 880 states have call predecessors, (892), 892 states have call successors, (892) [2025-03-08 11:20:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 6824 transitions. [2025-03-08 11:20:19,521 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 6824 transitions. Word has length 650 [2025-03-08 11:20:19,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:19,522 INFO L471 AbstractCegarLoop]: Abstraction has 4017 states and 6824 transitions. [2025-03-08 11:20:19,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 6824 transitions. [2025-03-08 11:20:19,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-08 11:20:19,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:19,528 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:19,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:20:19,529 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:19,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:19,532 INFO L85 PathProgramCache]: Analyzing trace with hash 218303488, now seen corresponding path program 1 times [2025-03-08 11:20:19,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:19,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267222799] [2025-03-08 11:20:19,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:19,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:19,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-08 11:20:19,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-08 11:20:19,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:19,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-08 11:20:20,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:20,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267222799] [2025-03-08 11:20:20,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267222799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:20,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:20,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:20:20,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130181927] [2025-03-08 11:20:20,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:20,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:20:20,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:20,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:20:20,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:20:20,052 INFO L87 Difference]: Start difference. First operand 4017 states and 6824 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:21,352 INFO L93 Difference]: Finished difference Result 14437 states and 24488 transitions. [2025-03-08 11:20:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:20:21,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-03-08 11:20:21,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:21,399 INFO L225 Difference]: With dead ends: 14437 [2025-03-08 11:20:21,399 INFO L226 Difference]: Without dead ends: 10423 [2025-03-08 11:20:21,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:20:21,413 INFO L435 NwaCegarLoop]: 1035 mSDtfsCounter, 1223 mSDsluCounter, 2775 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 3810 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:21,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 3810 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:20:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10423 states. [2025-03-08 11:20:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10423 to 9065. [2025-03-08 11:20:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9065 states, 7284 states have (on average 1.6364634816035146) internal successors, (11920), 7320 states have internal predecessors, (11920), 1740 states have call successors, (1740), 40 states have call predecessors, (1740), 40 states have return successors, (1740), 1704 states have call predecessors, (1740), 1740 states have call successors, (1740) [2025-03-08 11:20:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9065 states to 9065 states and 15400 transitions. [2025-03-08 11:20:21,930 INFO L78 Accepts]: Start accepts. Automaton has 9065 states and 15400 transitions. Word has length 650 [2025-03-08 11:20:21,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:21,930 INFO L471 AbstractCegarLoop]: Abstraction has 9065 states and 15400 transitions. [2025-03-08 11:20:21,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 9065 states and 15400 transitions. [2025-03-08 11:20:21,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-08 11:20:21,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:21,940 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:21,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:20:21,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:21,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:21,940 INFO L85 PathProgramCache]: Analyzing trace with hash 231836289, now seen corresponding path program 1 times [2025-03-08 11:20:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:21,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377955990] [2025-03-08 11:20:21,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:21,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:21,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-08 11:20:22,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-08 11:20:22,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:22,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-08 11:20:22,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:22,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377955990] [2025-03-08 11:20:22,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377955990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:22,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:22,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:22,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800764779] [2025-03-08 11:20:22,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:22,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:22,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:22,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:22,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:22,252 INFO L87 Difference]: Start difference. First operand 9065 states and 15400 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:22,794 INFO L93 Difference]: Finished difference Result 26997 states and 45910 transitions. [2025-03-08 11:20:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:22,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-03-08 11:20:22,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:22,870 INFO L225 Difference]: With dead ends: 26997 [2025-03-08 11:20:22,871 INFO L226 Difference]: Without dead ends: 17935 [2025-03-08 11:20:22,896 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-08 11:20:22,897 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 510 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:22,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1367 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:20:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17935 states. [2025-03-08 11:20:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17935 to 17933. [2025-03-08 11:20:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17933 states, 14372 states have (on average 1.6301141107709436) internal successors, (23428), 14444 states have internal predecessors, (23428), 3480 states have call successors, (3480), 80 states have call predecessors, (3480), 80 states have return successors, (3480), 3408 states have call predecessors, (3480), 3480 states have call successors, (3480) [2025-03-08 11:20:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17933 states to 17933 states and 30388 transitions. [2025-03-08 11:20:23,904 INFO L78 Accepts]: Start accepts. Automaton has 17933 states and 30388 transitions. Word has length 650 [2025-03-08 11:20:23,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:23,906 INFO L471 AbstractCegarLoop]: Abstraction has 17933 states and 30388 transitions. [2025-03-08 11:20:23,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 17933 states and 30388 transitions. [2025-03-08 11:20:23,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-08 11:20:23,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:23,921 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:23,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:20:23,922 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:23,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:23,923 INFO L85 PathProgramCache]: Analyzing trace with hash 486572834, now seen corresponding path program 1 times [2025-03-08 11:20:23,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:23,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375604773] [2025-03-08 11:20:23,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:23,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:23,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-08 11:20:23,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-08 11:20:23,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:23,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-08 11:20:24,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:24,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375604773] [2025-03-08 11:20:24,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375604773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:24,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:24,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:24,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901077662] [2025-03-08 11:20:24,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:24,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:24,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:24,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:24,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:24,337 INFO L87 Difference]: Start difference. First operand 17933 states and 30388 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:25,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:25,162 INFO L93 Difference]: Finished difference Result 44869 states and 76086 transitions. [2025-03-08 11:20:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:25,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-03-08 11:20:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:25,259 INFO L225 Difference]: With dead ends: 44869 [2025-03-08 11:20:25,259 INFO L226 Difference]: Without dead ends: 26939 [2025-03-08 11:20:25,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:25,308 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 362 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:25,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1185 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:20:25,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26939 states. [2025-03-08 11:20:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26939 to 26897. [2025-03-08 11:20:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26897 states, 21556 states have (on average 1.6283169419187233) internal successors, (35100), 21664 states have internal predecessors, (35100), 5220 states have call successors, (5220), 120 states have call predecessors, (5220), 120 states have return successors, (5220), 5112 states have call predecessors, (5220), 5220 states have call successors, (5220) [2025-03-08 11:20:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26897 states to 26897 states and 45540 transitions. [2025-03-08 11:20:26,742 INFO L78 Accepts]: Start accepts. Automaton has 26897 states and 45540 transitions. Word has length 650 [2025-03-08 11:20:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:26,743 INFO L471 AbstractCegarLoop]: Abstraction has 26897 states and 45540 transitions. [2025-03-08 11:20:26,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 26897 states and 45540 transitions. [2025-03-08 11:20:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-03-08 11:20:26,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:26,759 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:26,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:20:26,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:26,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash -966122104, now seen corresponding path program 1 times [2025-03-08 11:20:26,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:26,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647521236] [2025-03-08 11:20:26,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:26,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:26,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-08 11:20:26,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-08 11:20:26,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:26,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-08 11:20:27,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:27,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647521236] [2025-03-08 11:20:27,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647521236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:27,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:27,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:20:27,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58483419] [2025-03-08 11:20:27,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:27,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:20:27,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:27,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:20:27,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:20:27,186 INFO L87 Difference]: Start difference. First operand 26897 states and 45540 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:29,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:29,510 INFO L93 Difference]: Finished difference Result 80283 states and 134011 transitions. [2025-03-08 11:20:29,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:20:29,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 651 [2025-03-08 11:20:29,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:29,733 INFO L225 Difference]: With dead ends: 80283 [2025-03-08 11:20:29,734 INFO L226 Difference]: Without dead ends: 53389 [2025-03-08 11:20:29,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:20:29,802 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 790 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:29,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 1925 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:20:29,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53389 states. [2025-03-08 11:20:32,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53389 to 42446. [2025-03-08 11:20:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42446 states, 32426 states have (on average 1.5833590328748535) internal successors, (51342), 32655 states have internal predecessors, (51342), 9776 states have call successors, (9776), 243 states have call predecessors, (9776), 243 states have return successors, (9776), 9547 states have call predecessors, (9776), 9776 states have call successors, (9776) [2025-03-08 11:20:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42446 states to 42446 states and 70894 transitions. [2025-03-08 11:20:32,935 INFO L78 Accepts]: Start accepts. Automaton has 42446 states and 70894 transitions. Word has length 651 [2025-03-08 11:20:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:32,936 INFO L471 AbstractCegarLoop]: Abstraction has 42446 states and 70894 transitions. [2025-03-08 11:20:32,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 42446 states and 70894 transitions. [2025-03-08 11:20:32,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-03-08 11:20:32,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:32,961 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:32,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:20:32,961 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:32,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:32,962 INFO L85 PathProgramCache]: Analyzing trace with hash -121650233, now seen corresponding path program 1 times [2025-03-08 11:20:32,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:32,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107016932] [2025-03-08 11:20:32,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:32,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:32,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-08 11:20:33,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-08 11:20:33,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:33,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-08 11:20:33,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:33,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107016932] [2025-03-08 11:20:33,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107016932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:33,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:33,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:20:33,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797179377] [2025-03-08 11:20:33,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:33,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:20:33,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:33,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:20:33,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:20:33,590 INFO L87 Difference]: Start difference. First operand 42446 states and 70894 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:36,687 INFO L93 Difference]: Finished difference Result 102663 states and 170874 transitions. [2025-03-08 11:20:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:20:36,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 651 [2025-03-08 11:20:36,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:36,930 INFO L225 Difference]: With dead ends: 102663 [2025-03-08 11:20:36,930 INFO L226 Difference]: Without dead ends: 60049 [2025-03-08 11:20:37,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:20:37,045 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 1523 mSDsluCounter, 1884 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:37,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 2446 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:20:37,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60049 states. [2025-03-08 11:20:40,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60049 to 41218. [2025-03-08 11:20:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41218 states, 34055 states have (on average 1.6311848480399354) internal successors, (55550), 34206 states have internal predecessors, (55550), 6950 states have call successors, (6950), 212 states have call predecessors, (6950), 212 states have return successors, (6950), 6799 states have call predecessors, (6950), 6950 states have call successors, (6950) [2025-03-08 11:20:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41218 states to 41218 states and 69450 transitions. [2025-03-08 11:20:40,289 INFO L78 Accepts]: Start accepts. Automaton has 41218 states and 69450 transitions. Word has length 651 [2025-03-08 11:20:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:40,290 INFO L471 AbstractCegarLoop]: Abstraction has 41218 states and 69450 transitions. [2025-03-08 11:20:40,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 41218 states and 69450 transitions. [2025-03-08 11:20:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-03-08 11:20:40,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:40,319 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:40,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:20:40,320 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:40,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:40,321 INFO L85 PathProgramCache]: Analyzing trace with hash 759358793, now seen corresponding path program 1 times [2025-03-08 11:20:40,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:40,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738013192] [2025-03-08 11:20:40,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:40,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:40,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-08 11:20:40,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-08 11:20:40,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:40,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-08 11:20:40,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:40,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738013192] [2025-03-08 11:20:40,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738013192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:40,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:40,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:40,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362972806] [2025-03-08 11:20:40,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:40,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:40,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:40,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:40,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:40,509 INFO L87 Difference]: Start difference. First operand 41218 states and 69450 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:42,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:42,686 INFO L93 Difference]: Finished difference Result 100577 states and 167946 transitions. [2025-03-08 11:20:42,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:42,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 651 [2025-03-08 11:20:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:42,895 INFO L225 Difference]: With dead ends: 100577 [2025-03-08 11:20:42,895 INFO L226 Difference]: Without dead ends: 59430 [2025-03-08 11:20:42,980 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-08 11:20:42,981 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 296 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:42,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1120 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:20:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59430 states. [2025-03-08 11:20:46,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59430 to 59416. [2025-03-08 11:20:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59416 states, 45251 states have (on average 1.5654018695719432) internal successors, (70836), 45564 states have internal predecessors, (70836), 13742 states have call successors, (13742), 422 states have call predecessors, (13742), 422 states have return successors, (13742), 13429 states have call predecessors, (13742), 13742 states have call successors, (13742) [2025-03-08 11:20:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59416 states to 59416 states and 98320 transitions. [2025-03-08 11:20:46,368 INFO L78 Accepts]: Start accepts. Automaton has 59416 states and 98320 transitions. Word has length 651 [2025-03-08 11:20:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:46,369 INFO L471 AbstractCegarLoop]: Abstraction has 59416 states and 98320 transitions. [2025-03-08 11:20:46,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 59416 states and 98320 transitions. [2025-03-08 11:20:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-03-08 11:20:46,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:46,399 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:46,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:20:46,399 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:46,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1602134313, now seen corresponding path program 1 times [2025-03-08 11:20:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:46,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992104762] [2025-03-08 11:20:46,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:46,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:46,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-08 11:20:46,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-08 11:20:46,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:46,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-08 11:20:46,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:46,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992104762] [2025-03-08 11:20:46,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992104762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:46,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:46,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:20:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619306279] [2025-03-08 11:20:46,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:46,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:20:46,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:46,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:20:46,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:20:46,926 INFO L87 Difference]: Start difference. First operand 59416 states and 98320 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 11:20:53,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:53,508 INFO L93 Difference]: Finished difference Result 195072 states and 320522 transitions. [2025-03-08 11:20:53,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:20:53,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 651 [2025-03-08 11:20:53,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:53,962 INFO L225 Difference]: With dead ends: 195072 [2025-03-08 11:20:53,962 INFO L226 Difference]: Without dead ends: 135727 [2025-03-08 11:20:54,096 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-08 11:20:54,097 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 1095 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:54,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1848 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:20:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135727 states.